/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 05:02:05,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 05:02:05,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 05:02:05,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 05:02:05,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 05:02:05,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 05:02:05,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 05:02:05,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 05:02:05,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 05:02:05,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 05:02:05,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 05:02:05,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 05:02:05,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 05:02:05,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 05:02:05,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 05:02:05,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 05:02:05,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 05:02:05,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 05:02:05,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 05:02:05,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 05:02:05,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 05:02:05,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 05:02:05,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 05:02:05,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 05:02:05,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 05:02:05,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 05:02:05,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 05:02:05,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 05:02:05,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 05:02:05,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 05:02:05,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 05:02:05,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 05:02:05,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 05:02:05,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 05:02:05,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 05:02:05,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 05:02:05,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 05:02:05,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 05:02:05,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 05:02:05,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 05:02:05,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 05:02:05,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 05:02:05,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 05:02:05,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 05:02:05,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 05:02:05,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 05:02:05,739 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 05:02:05,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 05:02:05,740 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 05:02:05,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 05:02:05,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 05:02:05,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 05:02:05,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 05:02:05,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 05:02:05,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 05:02:05,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 05:02:05,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 05:02:05,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 05:02:05,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 05:02:05,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 05:02:05,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 05:02:05,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 05:02:05,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 05:02:05,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:02:05,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 05:02:05,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 05:02:05,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 05:02:05,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 05:02:05,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 05:02:05,744 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 05:02:05,744 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 05:02:06,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 05:02:06,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 05:02:06,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 05:02:06,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 05:02:06,075 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 05:02:06,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-12-13 05:02:07,312 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 05:02:07,541 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 05:02:07,542 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-12-13 05:02:07,547 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f854690e/f08ef0acc6b14c7987b9f484b20f78c7/FLAG543422f5f [2022-12-13 05:02:07,559 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f854690e/f08ef0acc6b14c7987b9f484b20f78c7 [2022-12-13 05:02:07,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 05:02:07,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 05:02:07,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 05:02:07,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 05:02:07,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 05:02:07,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3f4983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07, skipping insertion in model container [2022-12-13 05:02:07,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 05:02:07,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 05:02:07,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,739 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/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-12-13 05:02:07,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:02:07,773 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 05:02:07,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:02:07,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:02:07,811 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/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-12-13 05:02:07,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:02:07,831 INFO L208 MainTranslator]: Completed translation [2022-12-13 05:02:07,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07 WrapperNode [2022-12-13 05:02:07,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 05:02:07,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 05:02:07,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 05:02:07,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 05:02:07,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,891 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 179 [2022-12-13 05:02:07,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 05:02:07,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 05:02:07,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 05:02:07,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 05:02:07,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,928 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 05:02:07,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 05:02:07,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 05:02:07,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 05:02:07,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (1/1) ... [2022-12-13 05:02:07,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:02:07,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:02:07,977 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 05:02:07,996 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 05:02:08,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 05:02:08,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 05:02:08,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 05:02:08,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 05:02:08,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 05:02:08,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 05:02:08,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 05:02:08,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 05:02:08,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 05:02:08,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 05:02:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 05:02:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 05:02:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 05:02:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 05:02:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 05:02:08,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 05:02:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 05:02:08,021 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 05:02:08,147 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 05:02:08,149 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 05:02:08,416 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 05:02:08,532 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 05:02:08,532 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 05:02:08,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:02:08 BoogieIcfgContainer [2022-12-13 05:02:08,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 05:02:08,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 05:02:08,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 05:02:08,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 05:02:08,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:02:07" (1/3) ... [2022-12-13 05:02:08,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b99941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:02:08, skipping insertion in model container [2022-12-13 05:02:08,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:02:07" (2/3) ... [2022-12-13 05:02:08,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b99941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:02:08, skipping insertion in model container [2022-12-13 05:02:08,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:02:08" (3/3) ... [2022-12-13 05:02:08,548 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2022-12-13 05:02:08,564 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 05:02:08,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 05:02:08,564 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 05:02:08,664 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 05:02:08,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 312 flow [2022-12-13 05:02:08,773 INFO L130 PetriNetUnfolder]: 9/141 cut-off events. [2022-12-13 05:02:08,774 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 05:02:08,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 9/141 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-13 05:02:08,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 144 transitions, 312 flow [2022-12-13 05:02:08,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 131 transitions, 280 flow [2022-12-13 05:02:08,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:08,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 131 transitions, 280 flow [2022-12-13 05:02:08,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 131 transitions, 280 flow [2022-12-13 05:02:08,857 INFO L130 PetriNetUnfolder]: 9/131 cut-off events. [2022-12-13 05:02:08,858 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 05:02:08,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 9/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-13 05:02:08,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 131 transitions, 280 flow [2022-12-13 05:02:08,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 1464 [2022-12-13 05:02:13,462 INFO L241 LiptonReduction]: Total number of compositions: 109 [2022-12-13 05:02:13,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 05:02:13,480 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;@5cc2d67b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 05:02:13,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 05:02:13,486 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-13 05:02:13,486 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 05:02:13,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:13,487 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 05:02:13,487 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 05:02:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1581976625, now seen corresponding path program 1 times [2022-12-13 05:02:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:13,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24815998] [2022-12-13 05:02:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:13,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:14,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:14,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24815998] [2022-12-13 05:02:14,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24815998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:14,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:14,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:02:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823851960] [2022-12-13 05:02:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:14,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:02:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:14,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:02:14,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 05:02:14,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 05:02:14,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 05:02:14,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:14,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 05:02:14,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:14,213 INFO L130 PetriNetUnfolder]: 169/271 cut-off events. [2022-12-13 05:02:14,213 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 05:02:14,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 271 events. 169/271 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 668 event pairs, 108 based on Foata normal form. 8/235 useless extension candidates. Maximal degree in co-relation 372. Up to 217 conditions per place. [2022-12-13 05:02:14,217 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 21 selfloop transitions, 2 changer transitions 11/34 dead transitions. [2022-12-13 05:02:14,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 163 flow [2022-12-13 05:02:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:02:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:02:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 05:02:14,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-13 05:02:14,248 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-13 05:02:14,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 34 transitions, 163 flow [2022-12-13 05:02:14,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 23 transitions, 110 flow [2022-12-13 05:02:14,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:14,254 INFO L89 Accepts]: Start accepts. Operand has 31 places, 23 transitions, 110 flow [2022-12-13 05:02:14,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:14,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:14,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 110 flow [2022-12-13 05:02:14,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 23 transitions, 110 flow [2022-12-13 05:02:14,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:15,243 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:02:15,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 992 [2022-12-13 05:02:15,245 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 106 flow [2022-12-13 05:02:15,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 05:02:15,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:15,246 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 05:02:15,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 05:02:15,246 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 05:02:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash 18405854, now seen corresponding path program 1 times [2022-12-13 05:02:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:15,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276129107] [2022-12-13 05:02:15,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:15,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:15,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276129107] [2022-12-13 05:02:15,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276129107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:15,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:15,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:02:15,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450042328] [2022-12-13 05:02:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:15,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:02:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:02:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 05:02:15,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 05:02:15,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 05:02:15,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:15,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 05:02:15,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:15,489 INFO L130 PetriNetUnfolder]: 212/344 cut-off events. [2022-12-13 05:02:15,489 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 05:02:15,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 344 events. 212/344 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 964 event pairs, 141 based on Foata normal form. 26/298 useless extension candidates. Maximal degree in co-relation 546. Up to 345 conditions per place. [2022-12-13 05:02:15,492 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 21 selfloop transitions, 2 changer transitions 17/40 dead transitions. [2022-12-13 05:02:15,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 273 flow [2022-12-13 05:02:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:02:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:02:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 05:02:15,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-13 05:02:15,513 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-13 05:02:15,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 40 transitions, 273 flow [2022-12-13 05:02:15,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 23 transitions, 156 flow [2022-12-13 05:02:15,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:15,517 INFO L89 Accepts]: Start accepts. Operand has 32 places, 23 transitions, 156 flow [2022-12-13 05:02:15,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:15,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:15,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 156 flow [2022-12-13 05:02:15,519 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 156 flow [2022-12-13 05:02:15,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:16,594 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:02:16,595 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1078 [2022-12-13 05:02:16,595 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 150 flow [2022-12-13 05:02:16,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 05:02:16,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:16,595 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 05:02:16,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 05:02:16,596 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 05:02:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2068820001, now seen corresponding path program 1 times [2022-12-13 05:02:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:16,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465727464] [2022-12-13 05:02:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:19,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465727464] [2022-12-13 05:02:19,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465727464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:19,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:19,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 05:02:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869568447] [2022-12-13 05:02:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:19,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 05:02:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:19,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 05:02:19,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 05:02:19,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 05:02:19,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 150 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:02:19,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:19,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 05:02:19,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:20,557 INFO L130 PetriNetUnfolder]: 392/643 cut-off events. [2022-12-13 05:02:20,558 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-13 05:02:20,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2688 conditions, 643 events. 392/643 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2387 event pairs, 142 based on Foata normal form. 1/512 useless extension candidates. Maximal degree in co-relation 1304. Up to 644 conditions per place. [2022-12-13 05:02:20,567 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 73 selfloop transitions, 12 changer transitions 9/94 dead transitions. [2022-12-13 05:02:20,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 94 transitions, 836 flow [2022-12-13 05:02:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 05:02:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 05:02:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-12-13 05:02:20,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4797979797979798 [2022-12-13 05:02:20,573 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2022-12-13 05:02:20,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 94 transitions, 836 flow [2022-12-13 05:02:20,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 85 transitions, 752 flow [2022-12-13 05:02:20,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:20,583 INFO L89 Accepts]: Start accepts. Operand has 38 places, 85 transitions, 752 flow [2022-12-13 05:02:20,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:20,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:20,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 85 transitions, 752 flow [2022-12-13 05:02:20,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 85 transitions, 752 flow [2022-12-13 05:02:20,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:23,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:02:23,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2884 [2022-12-13 05:02:23,467 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 84 transitions, 744 flow [2022-12-13 05:02:23,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:02:23,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:23,468 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 05:02:23,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 05:02:23,468 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 05:02:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2074685456, now seen corresponding path program 1 times [2022-12-13 05:02:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:23,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227465576] [2022-12-13 05:02:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:23,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:23,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:23,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227465576] [2022-12-13 05:02:23,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227465576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:23,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:23,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:02:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012273743] [2022-12-13 05:02:23,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:23,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:02:23,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:23,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:02:23,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 05:02:23,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 05:02:23,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 84 transitions, 744 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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 05:02:23,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:23,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 05:02:23,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:23,681 INFO L130 PetriNetUnfolder]: 228/405 cut-off events. [2022-12-13 05:02:23,682 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-13 05:02:23,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2127 conditions, 405 events. 228/405 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1452 event pairs, 36 based on Foata normal form. 58/375 useless extension candidates. Maximal degree in co-relation 1057. Up to 406 conditions per place. [2022-12-13 05:02:23,686 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 101 selfloop transitions, 14 changer transitions 6/121 dead transitions. [2022-12-13 05:02:23,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 121 transitions, 1312 flow [2022-12-13 05:02:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:02:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:02:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 05:02:23,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44565217391304346 [2022-12-13 05:02:23,688 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2022-12-13 05:02:23,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 121 transitions, 1312 flow [2022-12-13 05:02:23,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 115 transitions, 1246 flow [2022-12-13 05:02:23,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:23,694 INFO L89 Accepts]: Start accepts. Operand has 39 places, 115 transitions, 1246 flow [2022-12-13 05:02:23,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:23,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:23,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 115 transitions, 1246 flow [2022-12-13 05:02:23,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 115 transitions, 1246 flow [2022-12-13 05:02:23,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:23,699 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:02:23,707 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 05:02:23,708 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 115 transitions, 1246 flow [2022-12-13 05:02:23,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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 05:02:23,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:23,708 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 05:02:23,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 05:02:23,709 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 05:02:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:23,709 INFO L85 PathProgramCache]: Analyzing trace with hash 21511652, now seen corresponding path program 2 times [2022-12-13 05:02:23,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:23,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870762541] [2022-12-13 05:02:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:23,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:25,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870762541] [2022-12-13 05:02:25,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870762541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:25,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:25,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:02:25,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592241078] [2022-12-13 05:02:25,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:25,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:02:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:02:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:02:25,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 05:02:25,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 115 transitions, 1246 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:25,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:25,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 05:02:25,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:26,984 INFO L130 PetriNetUnfolder]: 369/655 cut-off events. [2022-12-13 05:02:26,985 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-13 05:02:26,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 655 events. 369/655 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2755 event pairs, 48 based on Foata normal form. 1/514 useless extension candidates. Maximal degree in co-relation 2368. Up to 656 conditions per place. [2022-12-13 05:02:26,991 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 160 selfloop transitions, 45 changer transitions 13/218 dead transitions. [2022-12-13 05:02:26,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 218 transitions, 2799 flow [2022-12-13 05:02:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 05:02:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 05:02:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-12-13 05:02:26,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4830917874396135 [2022-12-13 05:02:26,993 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-13 05:02:26,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 218 transitions, 2799 flow [2022-12-13 05:02:26,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 205 transitions, 2625 flow [2022-12-13 05:02:27,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:27,004 INFO L89 Accepts]: Start accepts. Operand has 46 places, 205 transitions, 2625 flow [2022-12-13 05:02:27,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:27,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:27,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 205 transitions, 2625 flow [2022-12-13 05:02:27,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 205 transitions, 2625 flow [2022-12-13 05:02:27,010 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:27,013 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:02:27,152 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:02:27,153 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 05:02:27,153 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 204 transitions, 2615 flow [2022-12-13 05:02:27,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:27,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:27,153 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 05:02:27,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 05:02:27,154 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 05:02:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash 184347080, now seen corresponding path program 3 times [2022-12-13 05:02:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:27,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156070281] [2022-12-13 05:02:27,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:27,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:28,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:28,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156070281] [2022-12-13 05:02:28,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156070281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:28,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:28,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:02:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061537062] [2022-12-13 05:02:28,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:28,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:02:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:28,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:02:28,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:02:28,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:02:28,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 204 transitions, 2615 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:28,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:28,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:02:28,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:30,202 INFO L130 PetriNetUnfolder]: 466/879 cut-off events. [2022-12-13 05:02:30,202 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2022-12-13 05:02:30,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6376 conditions, 879 events. 466/879 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4364 event pairs, 43 based on Foata normal form. 1/707 useless extension candidates. Maximal degree in co-relation 3639. Up to 880 conditions per place. [2022-12-13 05:02:30,211 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 286 selfloop transitions, 52 changer transitions 13/351 dead transitions. [2022-12-13 05:02:30,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 351 transitions, 5240 flow [2022-12-13 05:02:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 05:02:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 05:02:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2022-12-13 05:02:30,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2022-12-13 05:02:30,217 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2022-12-13 05:02:30,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 351 transitions, 5240 flow [2022-12-13 05:02:30,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 338 transitions, 5040 flow [2022-12-13 05:02:30,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:30,233 INFO L89 Accepts]: Start accepts. Operand has 53 places, 338 transitions, 5040 flow [2022-12-13 05:02:30,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:30,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:30,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 338 transitions, 5040 flow [2022-12-13 05:02:30,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 338 transitions, 5040 flow [2022-12-13 05:02:30,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:30,247 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:02:30,369 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:02:30,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 05:02:30,370 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 337 transitions, 5028 flow [2022-12-13 05:02:30,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:30,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:30,370 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 05:02:30,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 05:02:30,371 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 05:02:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:30,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1457043774, now seen corresponding path program 1 times [2022-12-13 05:02:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:30,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745360237] [2022-12-13 05:02:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:31,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:31,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745360237] [2022-12-13 05:02:31,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745360237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:31,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:31,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:02:31,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790534013] [2022-12-13 05:02:31,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:31,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:02:31,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:31,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:02:31,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:02:31,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:02:31,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 337 transitions, 5028 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 05:02:31,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:31,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:02:31,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:32,042 INFO L130 PetriNetUnfolder]: 530/1056 cut-off events. [2022-12-13 05:02:32,042 INFO L131 PetriNetUnfolder]: For 249/249 co-relation queries the response was YES. [2022-12-13 05:02:32,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8730 conditions, 1056 events. 530/1056 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5752 event pairs, 34 based on Foata normal form. 2/869 useless extension candidates. Maximal degree in co-relation 4810. Up to 1057 conditions per place. [2022-12-13 05:02:32,053 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 383 selfloop transitions, 44 changer transitions 45/472 dead transitions. [2022-12-13 05:02:32,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 472 transitions, 8021 flow [2022-12-13 05:02:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 05:02:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 05:02:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2022-12-13 05:02:32,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.412 [2022-12-13 05:02:32,056 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 32 predicate places. [2022-12-13 05:02:32,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 472 transitions, 8021 flow [2022-12-13 05:02:32,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 427 transitions, 7245 flow [2022-12-13 05:02:32,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:32,078 INFO L89 Accepts]: Start accepts. Operand has 59 places, 427 transitions, 7245 flow [2022-12-13 05:02:32,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:32,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:32,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 427 transitions, 7245 flow [2022-12-13 05:02:32,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 427 transitions, 7245 flow [2022-12-13 05:02:32,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:32,092 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:02:32,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 05:02:32,092 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 427 transitions, 7245 flow [2022-12-13 05:02:32,093 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 05:02:32,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:32,093 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 05:02:32,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 05:02:32,093 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 05:02:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1084004243, now seen corresponding path program 1 times [2022-12-13 05:02:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:32,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007394931] [2022-12-13 05:02:32,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:32,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:32,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007394931] [2022-12-13 05:02:32,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007394931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:32,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:32,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:02:32,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335075494] [2022-12-13 05:02:32,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:32,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:02:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:02:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:02:32,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:02:32,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 427 transitions, 7245 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 05:02:32,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:32,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:02:32,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:33,594 INFO L130 PetriNetUnfolder]: 521/1024 cut-off events. [2022-12-13 05:02:33,595 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-13 05:02:33,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9489 conditions, 1024 events. 521/1024 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5452 event pairs, 37 based on Foata normal form. 2/844 useless extension candidates. Maximal degree in co-relation 5321. Up to 1025 conditions per place. [2022-12-13 05:02:33,607 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 383 selfloop transitions, 35 changer transitions 31/449 dead transitions. [2022-12-13 05:02:33,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 449 transitions, 8522 flow [2022-12-13 05:02:33,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 05:02:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 05:02:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-12-13 05:02:33,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2022-12-13 05:02:33,611 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2022-12-13 05:02:33,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 449 transitions, 8522 flow [2022-12-13 05:02:33,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 418 transitions, 7926 flow [2022-12-13 05:02:33,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:33,628 INFO L89 Accepts]: Start accepts. Operand has 65 places, 418 transitions, 7926 flow [2022-12-13 05:02:33,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:33,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:33,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 418 transitions, 7926 flow [2022-12-13 05:02:33,638 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 418 transitions, 7926 flow [2022-12-13 05:02:33,638 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:33,640 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:02:33,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 05:02:33,642 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 418 transitions, 7926 flow [2022-12-13 05:02:33,642 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 05:02:33,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:33,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:02:33,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 05:02:33,642 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 05:02:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1562046188, now seen corresponding path program 1 times [2022-12-13 05:02:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:33,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110137396] [2022-12-13 05:02:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:36,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 05:02:36,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:36,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110137396] [2022-12-13 05:02:36,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110137396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:36,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:36,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 05:02:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151423135] [2022-12-13 05:02:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:36,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 05:02:36,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 05:02:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 05:02:36,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 05:02:36,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 418 transitions, 7926 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:02:36,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:36,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 05:02:36,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:37,585 INFO L130 PetriNetUnfolder]: 623/1162 cut-off events. [2022-12-13 05:02:37,586 INFO L131 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-12-13 05:02:37,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11915 conditions, 1162 events. 623/1162 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6031 event pairs, 52 based on Foata normal form. 1/940 useless extension candidates. Maximal degree in co-relation 5784. Up to 1163 conditions per place. [2022-12-13 05:02:37,594 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 422 selfloop transitions, 42 changer transitions 13/477 dead transitions. [2022-12-13 05:02:37,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 477 transitions, 9987 flow [2022-12-13 05:02:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 05:02:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 05:02:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-12-13 05:02:37,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38768115942028986 [2022-12-13 05:02:37,596 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2022-12-13 05:02:37,596 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 477 transitions, 9987 flow [2022-12-13 05:02:37,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 464 transitions, 9709 flow [2022-12-13 05:02:37,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:37,615 INFO L89 Accepts]: Start accepts. Operand has 75 places, 464 transitions, 9709 flow [2022-12-13 05:02:37,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:37,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:37,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 464 transitions, 9709 flow [2022-12-13 05:02:37,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 464 transitions, 9709 flow [2022-12-13 05:02:37,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:37,629 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:02:40,339 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:02:40,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2726 [2022-12-13 05:02:40,340 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 462 transitions, 9671 flow [2022-12-13 05:02:40,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:02:40,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:40,341 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 05:02:40,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 05:02:40,341 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 05:02:40,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:40,341 INFO L85 PathProgramCache]: Analyzing trace with hash -668882817, now seen corresponding path program 1 times [2022-12-13 05:02:40,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:40,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510953034] [2022-12-13 05:02:40,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:40,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:42,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:42,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510953034] [2022-12-13 05:02:42,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510953034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:42,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:42,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:02:42,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827193704] [2022-12-13 05:02:42,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:42,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:02:42,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:42,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:02:42,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:02:42,612 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:02:42,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 462 transitions, 9671 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:42,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:42,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:02:42,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:43,446 INFO L130 PetriNetUnfolder]: 680/1244 cut-off events. [2022-12-13 05:02:43,447 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2022-12-13 05:02:43,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13994 conditions, 1244 events. 680/1244 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6442 event pairs, 57 based on Foata normal form. 1/998 useless extension candidates. Maximal degree in co-relation 6349. Up to 1245 conditions per place. [2022-12-13 05:02:43,456 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 438 selfloop transitions, 53 changer transitions 13/504 dead transitions. [2022-12-13 05:02:43,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 504 transitions, 11552 flow [2022-12-13 05:02:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:02:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:02:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 05:02:43,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.385 [2022-12-13 05:02:43,458 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2022-12-13 05:02:43,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 504 transitions, 11552 flow [2022-12-13 05:02:43,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 491 transitions, 11248 flow [2022-12-13 05:02:43,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:43,478 INFO L89 Accepts]: Start accepts. Operand has 79 places, 491 transitions, 11248 flow [2022-12-13 05:02:43,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:43,482 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:43,482 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 491 transitions, 11248 flow [2022-12-13 05:02:43,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 491 transitions, 11248 flow [2022-12-13 05:02:43,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:43,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:02:43,634 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:02:43,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 05:02:43,635 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 490 transitions, 11228 flow [2022-12-13 05:02:43,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:43,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:43,635 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 05:02:43,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 05:02:43,635 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 05:02:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1212839215, now seen corresponding path program 1 times [2022-12-13 05:02:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:43,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132013145] [2022-12-13 05:02:43,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:43,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:45,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 05:02:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132013145] [2022-12-13 05:02:45,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132013145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:45,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:45,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:02:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380831980] [2022-12-13 05:02:45,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:45,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:02:45,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:45,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:02:45,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:02:45,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:02:45,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 490 transitions, 11228 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 05:02:45,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:45,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:02:45,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:46,175 INFO L130 PetriNetUnfolder]: 694/1268 cut-off events. [2022-12-13 05:02:46,176 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-13 05:02:46,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15535 conditions, 1268 events. 694/1268 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6613 event pairs, 57 based on Foata normal form. 1/1017 useless extension candidates. Maximal degree in co-relation 7012. Up to 1269 conditions per place. [2022-12-13 05:02:46,185 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 456 selfloop transitions, 44 changer transitions 15/515 dead transitions. [2022-12-13 05:02:46,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 515 transitions, 12835 flow [2022-12-13 05:02:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:02:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:02:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:02:46,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 05:02:46,187 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2022-12-13 05:02:46,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 515 transitions, 12835 flow [2022-12-13 05:02:46,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 500 transitions, 12455 flow [2022-12-13 05:02:46,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:46,209 INFO L89 Accepts]: Start accepts. Operand has 83 places, 500 transitions, 12455 flow [2022-12-13 05:02:46,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:46,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:46,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 500 transitions, 12455 flow [2022-12-13 05:02:46,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 500 transitions, 12455 flow [2022-12-13 05:02:46,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:46,225 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:02:46,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 05:02:46,226 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 500 transitions, 12455 flow [2022-12-13 05:02:46,226 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 05:02:46,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:46,226 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 05:02:46,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 05:02:46,228 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 05:02:46,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1348909858, now seen corresponding path program 1 times [2022-12-13 05:02:46,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:46,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641619226] [2022-12-13 05:02:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641619226] [2022-12-13 05:02:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641619226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:47,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:47,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:02:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796028078] [2022-12-13 05:02:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:47,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:02:47,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:47,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:02:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:02:47,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:02:47,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 500 transitions, 12455 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 05:02:47,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:47,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:02:47,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:47,928 INFO L130 PetriNetUnfolder]: 704/1289 cut-off events. [2022-12-13 05:02:47,929 INFO L131 PetriNetUnfolder]: For 248/248 co-relation queries the response was YES. [2022-12-13 05:02:47,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17083 conditions, 1289 events. 704/1289 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6744 event pairs, 54 based on Foata normal form. 1/1035 useless extension candidates. Maximal degree in co-relation 7585. Up to 1290 conditions per place. [2022-12-13 05:02:47,938 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 459 selfloop transitions, 50 changer transitions 15/524 dead transitions. [2022-12-13 05:02:47,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 524 transitions, 14106 flow [2022-12-13 05:02:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:02:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:02:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-13 05:02:47,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-13 05:02:47,940 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2022-12-13 05:02:47,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 524 transitions, 14106 flow [2022-12-13 05:02:47,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 509 transitions, 13696 flow [2022-12-13 05:02:47,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:47,956 INFO L89 Accepts]: Start accepts. Operand has 88 places, 509 transitions, 13696 flow [2022-12-13 05:02:47,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:47,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:47,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 509 transitions, 13696 flow [2022-12-13 05:02:47,971 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 509 transitions, 13696 flow [2022-12-13 05:02:47,971 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:47,973 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:02:47,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 05:02:47,974 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 509 transitions, 13696 flow [2022-12-13 05:02:47,974 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 05:02:47,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:47,974 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 05:02:47,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 05:02:47,974 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 05:02:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1270151121, now seen corresponding path program 2 times [2022-12-13 05:02:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:47,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141055499] [2022-12-13 05:02:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:49,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 05:02:49,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:49,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141055499] [2022-12-13 05:02:49,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141055499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:49,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:49,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:02:49,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420415153] [2022-12-13 05:02:49,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:49,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:02:49,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:49,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:02:49,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:02:49,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:02:49,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 509 transitions, 13696 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:49,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:49,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:02:49,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:50,528 INFO L130 PetriNetUnfolder]: 725/1331 cut-off events. [2022-12-13 05:02:50,528 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2022-12-13 05:02:50,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18971 conditions, 1331 events. 725/1331 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7071 event pairs, 52 based on Foata normal form. 1/1070 useless extension candidates. Maximal degree in co-relation 8158. Up to 1332 conditions per place. [2022-12-13 05:02:50,535 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 475 selfloop transitions, 55 changer transitions 13/543 dead transitions. [2022-12-13 05:02:50,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 543 transitions, 15702 flow [2022-12-13 05:02:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:02:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:02:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:02:50,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-13 05:02:50,537 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2022-12-13 05:02:50,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 543 transitions, 15702 flow [2022-12-13 05:02:50,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 530 transitions, 15320 flow [2022-12-13 05:02:50,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:50,554 INFO L89 Accepts]: Start accepts. Operand has 94 places, 530 transitions, 15320 flow [2022-12-13 05:02:50,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:50,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:50,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 530 transitions, 15320 flow [2022-12-13 05:02:50,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 530 transitions, 15320 flow [2022-12-13 05:02:50,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:50,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:02:50,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:02:50,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 05:02:50,703 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 529 transitions, 15294 flow [2022-12-13 05:02:50,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:50,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:50,704 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 05:02:50,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 05:02:50,704 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 05:02:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1892867521, now seen corresponding path program 3 times [2022-12-13 05:02:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:50,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074308110] [2022-12-13 05:02:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:52,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074308110] [2022-12-13 05:02:52,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074308110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:52,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:52,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:02:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592648900] [2022-12-13 05:02:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:52,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:02:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:52,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:02:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:02:52,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:02:52,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 529 transitions, 15294 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:52,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:52,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:02:52,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:53,941 INFO L130 PetriNetUnfolder]: 742/1362 cut-off events. [2022-12-13 05:02:53,941 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-12-13 05:02:53,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20778 conditions, 1362 events. 742/1362 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7316 event pairs, 59 based on Foata normal form. 1/1097 useless extension candidates. Maximal degree in co-relation 8731. Up to 1363 conditions per place. [2022-12-13 05:02:53,950 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 490 selfloop transitions, 52 changer transitions 15/557 dead transitions. [2022-12-13 05:02:53,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 557 transitions, 17225 flow [2022-12-13 05:02:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:02:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:02:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:02:53,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39 [2022-12-13 05:02:53,952 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-13 05:02:53,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 557 transitions, 17225 flow [2022-12-13 05:02:53,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 542 transitions, 16755 flow [2022-12-13 05:02:53,976 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:53,976 INFO L89 Accepts]: Start accepts. Operand has 98 places, 542 transitions, 16755 flow [2022-12-13 05:02:53,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:53,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:53,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 542 transitions, 16755 flow [2022-12-13 05:02:53,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 542 transitions, 16755 flow [2022-12-13 05:02:53,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:53,993 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:02:53,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 05:02:53,994 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 542 transitions, 16755 flow [2022-12-13 05:02:53,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:53,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:53,994 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 05:02:53,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 05:02:53,995 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 05:02:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash -506047389, now seen corresponding path program 4 times [2022-12-13 05:02:53,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:53,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854536844] [2022-12-13 05:02:53,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:55,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:55,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854536844] [2022-12-13 05:02:55,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854536844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:55,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:55,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:02:55,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082388992] [2022-12-13 05:02:55,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:55,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:02:55,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:55,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:02:55,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:02:55,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:02:55,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 542 transitions, 16755 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:55,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:55,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:02:55,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:56,510 INFO L130 PetriNetUnfolder]: 927/1656 cut-off events. [2022-12-13 05:02:56,510 INFO L131 PetriNetUnfolder]: For 283/283 co-relation queries the response was YES. [2022-12-13 05:02:56,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26905 conditions, 1656 events. 927/1656 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9055 event pairs, 59 based on Foata normal form. 1/1320 useless extension candidates. Maximal degree in co-relation 11410. Up to 1657 conditions per place. [2022-12-13 05:02:56,522 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 581 selfloop transitions, 77 changer transitions 13/671 dead transitions. [2022-12-13 05:02:56,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 671 transitions, 22075 flow [2022-12-13 05:02:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:02:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:02:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 05:02:56,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 05:02:56,523 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2022-12-13 05:02:56,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 671 transitions, 22075 flow [2022-12-13 05:02:56,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 658 transitions, 21641 flow [2022-12-13 05:02:56,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:02:56,545 INFO L89 Accepts]: Start accepts. Operand has 104 places, 658 transitions, 21641 flow [2022-12-13 05:02:56,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:02:56,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:02:56,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 658 transitions, 21641 flow [2022-12-13 05:02:56,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 658 transitions, 21641 flow [2022-12-13 05:02:56,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:02:56,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:02:56,676 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:02:56,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 05:02:56,677 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 657 transitions, 21611 flow [2022-12-13 05:02:56,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:56,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:02:56,677 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 05:02:56,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 05:02:56,678 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 05:02:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:02:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash -616984253, now seen corresponding path program 5 times [2022-12-13 05:02:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:02:56,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534349272] [2022-12-13 05:02:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:02:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:02:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:02:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:02:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534349272] [2022-12-13 05:02:59,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534349272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:02:59,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:02:59,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:02:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677086339] [2022-12-13 05:02:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:02:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:02:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:02:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:02:59,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:02:59,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 657 transitions, 21611 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:02:59,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:59,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:02:59,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:01,023 INFO L130 PetriNetUnfolder]: 931/1664 cut-off events. [2022-12-13 05:03:01,024 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-13 05:03:01,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28701 conditions, 1664 events. 931/1664 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9105 event pairs, 60 based on Foata normal form. 1/1328 useless extension candidates. Maximal degree in co-relation 12113. Up to 1665 conditions per place. [2022-12-13 05:03:01,035 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 568 selfloop transitions, 95 changer transitions 13/676 dead transitions. [2022-12-13 05:03:01,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 676 transitions, 23592 flow [2022-12-13 05:03:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 05:03:01,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.405 [2022-12-13 05:03:01,040 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2022-12-13 05:03:01,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 676 transitions, 23592 flow [2022-12-13 05:03:01,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 663 transitions, 23132 flow [2022-12-13 05:03:01,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:01,070 INFO L89 Accepts]: Start accepts. Operand has 109 places, 663 transitions, 23132 flow [2022-12-13 05:03:01,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:01,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:01,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 663 transitions, 23132 flow [2022-12-13 05:03:01,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 663 transitions, 23132 flow [2022-12-13 05:03:01,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:01,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:01,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:03:01,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 05:03:01,201 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 662 transitions, 23100 flow [2022-12-13 05:03:01,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:01,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:01,201 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 05:03:01,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 05:03:01,201 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 05:03:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1505545512, now seen corresponding path program 1 times [2022-12-13 05:03:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:01,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804973810] [2022-12-13 05:03:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:03,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:03,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804973810] [2022-12-13 05:03:03,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804973810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:03,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:03,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:03:03,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121457483] [2022-12-13 05:03:03,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:03,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:03:03,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:03,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:03:03,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:03:03,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:03:03,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 662 transitions, 23100 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 05:03:03,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:03,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:03:03,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:03,881 INFO L130 PetriNetUnfolder]: 933/1668 cut-off events. [2022-12-13 05:03:03,881 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2022-12-13 05:03:03,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30441 conditions, 1668 events. 933/1668 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9183 event pairs, 59 based on Foata normal form. 1/1333 useless extension candidates. Maximal degree in co-relation 12816. Up to 1669 conditions per place. [2022-12-13 05:03:03,893 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 588 selfloop transitions, 75 changer transitions 16/679 dead transitions. [2022-12-13 05:03:03,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 679 transitions, 25057 flow [2022-12-13 05:03:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 05:03:03,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3894230769230769 [2022-12-13 05:03:03,895 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2022-12-13 05:03:03,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 679 transitions, 25057 flow [2022-12-13 05:03:03,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 663 transitions, 24459 flow [2022-12-13 05:03:03,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:03,924 INFO L89 Accepts]: Start accepts. Operand has 113 places, 663 transitions, 24459 flow [2022-12-13 05:03:03,930 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:03,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:03,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 663 transitions, 24459 flow [2022-12-13 05:03:03,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 663 transitions, 24459 flow [2022-12-13 05:03:03,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:03,946 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:03,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 05:03:03,947 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 663 transitions, 24459 flow [2022-12-13 05:03:03,947 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 05:03:03,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:03,947 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 05:03:03,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 05:03:03,947 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 05:03:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1375348497, now seen corresponding path program 6 times [2022-12-13 05:03:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:03,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622742565] [2022-12-13 05:03:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:03,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:05,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 05:03:05,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:05,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622742565] [2022-12-13 05:03:05,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622742565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:05,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:05,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:03:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117681757] [2022-12-13 05:03:05,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:05,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:03:05,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:05,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:03:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:03:05,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:03:05,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 663 transitions, 24459 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:05,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:05,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:03:05,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:05,851 INFO L130 PetriNetUnfolder]: 1055/1853 cut-off events. [2022-12-13 05:03:05,851 INFO L131 PetriNetUnfolder]: For 296/296 co-relation queries the response was YES. [2022-12-13 05:03:05,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35663 conditions, 1853 events. 1055/1853 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10206 event pairs, 59 based on Foata normal form. 1/1460 useless extension candidates. Maximal degree in co-relation 15422. Up to 1854 conditions per place. [2022-12-13 05:03:05,865 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 651 selfloop transitions, 91 changer transitions 13/755 dead transitions. [2022-12-13 05:03:05,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 755 transitions, 29347 flow [2022-12-13 05:03:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-12-13 05:03:05,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-13 05:03:05,867 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2022-12-13 05:03:05,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 755 transitions, 29347 flow [2022-12-13 05:03:05,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 742 transitions, 28835 flow [2022-12-13 05:03:05,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:05,899 INFO L89 Accepts]: Start accepts. Operand has 119 places, 742 transitions, 28835 flow [2022-12-13 05:03:05,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:05,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:05,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 742 transitions, 28835 flow [2022-12-13 05:03:05,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 742 transitions, 28835 flow [2022-12-13 05:03:05,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:05,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:06,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:03:06,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-13 05:03:06,070 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 741 transitions, 28799 flow [2022-12-13 05:03:06,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:06,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:06,071 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 05:03:06,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 05:03:06,071 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 05:03:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1862288075, now seen corresponding path program 7 times [2022-12-13 05:03:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:06,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847051168] [2022-12-13 05:03:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:07,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 05:03:07,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:07,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847051168] [2022-12-13 05:03:07,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847051168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:07,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:07,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:03:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362552204] [2022-12-13 05:03:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:07,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:03:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:03:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:03:07,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:03:07,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 741 transitions, 28799 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:07,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:07,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:03:07,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:08,048 INFO L130 PetriNetUnfolder]: 1106/1936 cut-off events. [2022-12-13 05:03:08,048 INFO L131 PetriNetUnfolder]: For 315/315 co-relation queries the response was YES. [2022-12-13 05:03:08,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39196 conditions, 1936 events. 1106/1936 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10746 event pairs, 60 based on Foata normal form. 1/1518 useless extension candidates. Maximal degree in co-relation 16710. Up to 1937 conditions per place. [2022-12-13 05:03:08,065 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 685 selfloop transitions, 94 changer transitions 14/793 dead transitions. [2022-12-13 05:03:08,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 793 transitions, 32412 flow [2022-12-13 05:03:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-13 05:03:08,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-13 05:03:08,066 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2022-12-13 05:03:08,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 793 transitions, 32412 flow [2022-12-13 05:03:08,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 779 transitions, 31834 flow [2022-12-13 05:03:08,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:08,138 INFO L89 Accepts]: Start accepts. Operand has 124 places, 779 transitions, 31834 flow [2022-12-13 05:03:08,143 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:08,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:08,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 779 transitions, 31834 flow [2022-12-13 05:03:08,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 779 transitions, 31834 flow [2022-12-13 05:03:08,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:08,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:08,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:03:08,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 05:03:08,274 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 778 transitions, 31796 flow [2022-12-13 05:03:08,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:08,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:08,274 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 05:03:08,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 05:03:08,275 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 05:03:08,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:08,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2058357692, now seen corresponding path program 1 times [2022-12-13 05:03:08,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:08,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780739051] [2022-12-13 05:03:08,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:08,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:09,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:09,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780739051] [2022-12-13 05:03:09,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780739051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:09,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:09,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:03:09,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186269129] [2022-12-13 05:03:09,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:09,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:03:09,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:09,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:03:09,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:03:09,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:03:09,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 778 transitions, 31796 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 05:03:09,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:09,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:03:09,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:10,642 INFO L130 PetriNetUnfolder]: 1112/1950 cut-off events. [2022-12-13 05:03:10,642 INFO L131 PetriNetUnfolder]: For 316/316 co-relation queries the response was YES. [2022-12-13 05:03:10,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41434 conditions, 1950 events. 1112/1950 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10945 event pairs, 60 based on Foata normal form. 1/1533 useless extension candidates. Maximal degree in co-relation 17643. Up to 1951 conditions per place. [2022-12-13 05:03:10,660 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 690 selfloop transitions, 96 changer transitions 16/802 dead transitions. [2022-12-13 05:03:10,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 802 transitions, 34387 flow [2022-12-13 05:03:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-12-13 05:03:10,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34134615384615385 [2022-12-13 05:03:10,661 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 101 predicate places. [2022-12-13 05:03:10,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 802 transitions, 34387 flow [2022-12-13 05:03:10,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 786 transitions, 33695 flow [2022-12-13 05:03:10,696 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:10,697 INFO L89 Accepts]: Start accepts. Operand has 128 places, 786 transitions, 33695 flow [2022-12-13 05:03:10,702 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:10,702 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:10,702 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 786 transitions, 33695 flow [2022-12-13 05:03:10,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 786 transitions, 33695 flow [2022-12-13 05:03:10,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:10,716 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:10,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 05:03:10,717 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 786 transitions, 33695 flow [2022-12-13 05:03:10,717 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 05:03:10,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:10,717 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 05:03:10,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 05:03:10,717 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 05:03:10,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash 227672711, now seen corresponding path program 1 times [2022-12-13 05:03:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:10,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436228583] [2022-12-13 05:03:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:12,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 05:03:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:12,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436228583] [2022-12-13 05:03:12,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436228583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:12,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:12,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:03:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835770041] [2022-12-13 05:03:12,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:12,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:03:12,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:03:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:03:12,076 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:03:12,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 786 transitions, 33695 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 05:03:12,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:12,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:03:12,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:13,060 INFO L130 PetriNetUnfolder]: 1128/1979 cut-off events. [2022-12-13 05:03:13,060 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-12-13 05:03:13,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44030 conditions, 1979 events. 1128/1979 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11103 event pairs, 57 based on Foata normal form. 1/1555 useless extension candidates. Maximal degree in co-relation 18652. Up to 1980 conditions per place. [2022-12-13 05:03:13,076 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 710 selfloop transitions, 90 changer transitions 15/815 dead transitions. [2022-12-13 05:03:13,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 815 transitions, 36576 flow [2022-12-13 05:03:13,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-13 05:03:13,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 05:03:13,083 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 106 predicate places. [2022-12-13 05:03:13,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 815 transitions, 36576 flow [2022-12-13 05:03:13,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 800 transitions, 35896 flow [2022-12-13 05:03:13,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:13,120 INFO L89 Accepts]: Start accepts. Operand has 133 places, 800 transitions, 35896 flow [2022-12-13 05:03:13,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:13,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:13,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 800 transitions, 35896 flow [2022-12-13 05:03:13,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 800 transitions, 35896 flow [2022-12-13 05:03:13,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:13,143 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:13,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 05:03:13,143 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 800 transitions, 35896 flow [2022-12-13 05:03:13,143 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 05:03:13,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:13,144 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 05:03:13,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 05:03:13,144 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 05:03:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1967088065, now seen corresponding path program 8 times [2022-12-13 05:03:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:13,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098169774] [2022-12-13 05:03:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:13,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:14,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098169774] [2022-12-13 05:03:14,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098169774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:14,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:14,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:03:14,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765510553] [2022-12-13 05:03:14,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:14,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:03:14,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:14,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:03:14,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:03:14,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:03:14,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 800 transitions, 35896 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:03:14,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:14,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:03:14,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:15,414 INFO L130 PetriNetUnfolder]: 1151/2022 cut-off events. [2022-12-13 05:03:15,415 INFO L131 PetriNetUnfolder]: For 331/331 co-relation queries the response was YES. [2022-12-13 05:03:15,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47009 conditions, 2022 events. 1151/2022 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11449 event pairs, 60 based on Foata normal form. 1/1589 useless extension candidates. Maximal degree in co-relation 19491. Up to 2023 conditions per place. [2022-12-13 05:03:15,435 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 708 selfloop transitions, 109 changer transitions 13/830 dead transitions. [2022-12-13 05:03:15,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 830 transitions, 38909 flow [2022-12-13 05:03:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:03:15,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-13 05:03:15,436 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 111 predicate places. [2022-12-13 05:03:15,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 830 transitions, 38909 flow [2022-12-13 05:03:15,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 817 transitions, 38293 flow [2022-12-13 05:03:15,485 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:15,485 INFO L89 Accepts]: Start accepts. Operand has 139 places, 817 transitions, 38293 flow [2022-12-13 05:03:15,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:15,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:15,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 817 transitions, 38293 flow [2022-12-13 05:03:15,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 817 transitions, 38293 flow [2022-12-13 05:03:15,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:15,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:15,631 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:03:15,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 05:03:15,631 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 816 transitions, 38249 flow [2022-12-13 05:03:15,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:03:15,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:15,632 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 05:03:15,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 05:03:15,632 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 05:03:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1679188484, now seen corresponding path program 1 times [2022-12-13 05:03:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:15,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365321327] [2022-12-13 05:03:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:16,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:16,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365321327] [2022-12-13 05:03:16,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365321327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:16,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:16,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:03:16,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531159143] [2022-12-13 05:03:16,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:16,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:03:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:03:16,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:03:16,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:03:16,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 816 transitions, 38249 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 05:03:16,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:16,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:03:16,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:17,461 INFO L130 PetriNetUnfolder]: 1146/2016 cut-off events. [2022-12-13 05:03:17,462 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-13 05:03:17,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48889 conditions, 2016 events. 1146/2016 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11437 event pairs, 57 based on Foata normal form. 1/1589 useless extension candidates. Maximal degree in co-relation 20330. Up to 2017 conditions per place. [2022-12-13 05:03:17,477 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 708 selfloop transitions, 107 changer transitions 14/829 dead transitions. [2022-12-13 05:03:17,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 829 transitions, 40523 flow [2022-12-13 05:03:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 05:03:17,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.385 [2022-12-13 05:03:17,478 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 116 predicate places. [2022-12-13 05:03:17,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 829 transitions, 40523 flow [2022-12-13 05:03:17,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 815 transitions, 39831 flow [2022-12-13 05:03:17,516 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:17,516 INFO L89 Accepts]: Start accepts. Operand has 143 places, 815 transitions, 39831 flow [2022-12-13 05:03:17,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:17,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:17,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 815 transitions, 39831 flow [2022-12-13 05:03:17,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 815 transitions, 39831 flow [2022-12-13 05:03:17,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:17,537 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:17,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 05:03:17,537 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 815 transitions, 39831 flow [2022-12-13 05:03:17,538 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 05:03:17,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:17,538 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 05:03:17,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 05:03:17,538 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 05:03:17,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1266294944, now seen corresponding path program 1 times [2022-12-13 05:03:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:17,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146514879] [2022-12-13 05:03:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:17,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146514879] [2022-12-13 05:03:17,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146514879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:17,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:17,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:03:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129121153] [2022-12-13 05:03:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:17,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:03:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:17,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:03:17,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:03:17,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:03:17,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 815 transitions, 39831 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:17,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:17,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:03:17,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:18,361 INFO L130 PetriNetUnfolder]: 1234/2162 cut-off events. [2022-12-13 05:03:18,361 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-13 05:03:18,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54585 conditions, 2162 events. 1234/2162 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12380 event pairs, 9 based on Foata normal form. 0/1721 useless extension candidates. Maximal degree in co-relation 22025. Up to 2163 conditions per place. [2022-12-13 05:03:18,380 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 866 selfloop transitions, 120 changer transitions 0/986 dead transitions. [2022-12-13 05:03:18,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 986 transitions, 50158 flow [2022-12-13 05:03:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 05:03:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 05:03:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-13 05:03:18,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-13 05:03:18,382 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 119 predicate places. [2022-12-13 05:03:18,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 986 transitions, 50158 flow [2022-12-13 05:03:18,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 986 transitions, 50158 flow [2022-12-13 05:03:18,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:18,428 INFO L89 Accepts]: Start accepts. Operand has 148 places, 986 transitions, 50158 flow [2022-12-13 05:03:18,438 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:18,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:18,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 986 transitions, 50158 flow [2022-12-13 05:03:18,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 986 transitions, 50158 flow [2022-12-13 05:03:18,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:18,460 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:18,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 05:03:18,461 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 986 transitions, 50158 flow [2022-12-13 05:03:18,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:18,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:18,461 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 05:03:18,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 05:03:18,461 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 05:03:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -182358928, now seen corresponding path program 1 times [2022-12-13 05:03:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:18,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539225366] [2022-12-13 05:03:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:18,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539225366] [2022-12-13 05:03:18,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539225366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:18,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:18,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:03:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596987672] [2022-12-13 05:03:18,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:18,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:03:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:18,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:03:18,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:03:18,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:03:18,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 986 transitions, 50158 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:18,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:18,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:03:18,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:19,348 INFO L130 PetriNetUnfolder]: 947/1766 cut-off events. [2022-12-13 05:03:19,348 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2022-12-13 05:03:19,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46395 conditions, 1766 events. 947/1766 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10490 event pairs, 11 based on Foata normal form. 119/1534 useless extension candidates. Maximal degree in co-relation 18765. Up to 1767 conditions per place. [2022-12-13 05:03:19,360 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 601 selfloop transitions, 67 changer transitions 177/845 dead transitions. [2022-12-13 05:03:19,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 845 transitions, 44684 flow [2022-12-13 05:03:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:03:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:03:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-13 05:03:19,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-13 05:03:19,362 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 123 predicate places. [2022-12-13 05:03:19,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 845 transitions, 44684 flow [2022-12-13 05:03:19,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 668 transitions, 35282 flow [2022-12-13 05:03:19,396 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:19,396 INFO L89 Accepts]: Start accepts. Operand has 141 places, 668 transitions, 35282 flow [2022-12-13 05:03:19,402 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:19,402 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:19,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 668 transitions, 35282 flow [2022-12-13 05:03:19,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 668 transitions, 35282 flow [2022-12-13 05:03:19,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:19,415 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:19,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 05:03:19,416 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 668 transitions, 35282 flow [2022-12-13 05:03:19,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:19,418 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:19,418 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 05:03:19,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 05:03:19,419 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 05:03:19,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1310681202, now seen corresponding path program 2 times [2022-12-13 05:03:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:19,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281773196] [2022-12-13 05:03:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:19,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:19,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281773196] [2022-12-13 05:03:19,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281773196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:19,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:19,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:03:19,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387241614] [2022-12-13 05:03:19,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:19,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:03:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:19,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:03:19,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:03:19,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:03:19,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 668 transitions, 35282 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:19,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:19,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:03:19,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:20,009 INFO L130 PetriNetUnfolder]: 825/1474 cut-off events. [2022-12-13 05:03:20,009 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-12-13 05:03:20,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40178 conditions, 1474 events. 825/1474 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7785 event pairs, 15 based on Foata normal form. 28/1227 useless extension candidates. Maximal degree in co-relation 15793. Up to 1475 conditions per place. [2022-12-13 05:03:20,021 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 561 selfloop transitions, 74 changer transitions 26/661 dead transitions. [2022-12-13 05:03:20,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 661 transitions, 36246 flow [2022-12-13 05:03:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 05:03:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 05:03:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-13 05:03:20,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 05:03:20,023 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 117 predicate places. [2022-12-13 05:03:20,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 661 transitions, 36246 flow [2022-12-13 05:03:20,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 635 transitions, 34818 flow [2022-12-13 05:03:20,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:20,054 INFO L89 Accepts]: Start accepts. Operand has 139 places, 635 transitions, 34818 flow [2022-12-13 05:03:20,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:20,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:20,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 635 transitions, 34818 flow [2022-12-13 05:03:20,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 635 transitions, 34818 flow [2022-12-13 05:03:20,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:20,073 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:20,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 05:03:20,073 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 635 transitions, 34818 flow [2022-12-13 05:03:20,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:20,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:20,074 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 05:03:20,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 05:03:20,074 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 05:03:20,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1908574938, now seen corresponding path program 3 times [2022-12-13 05:03:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:20,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52731896] [2022-12-13 05:03:20,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:20,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:20,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52731896] [2022-12-13 05:03:20,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52731896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:20,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:20,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:03:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383728962] [2022-12-13 05:03:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:20,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:03:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:20,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:03:20,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:03:20,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:03:20,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 635 transitions, 34818 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:20,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:20,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:03:20,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:20,668 INFO L130 PetriNetUnfolder]: 870/1521 cut-off events. [2022-12-13 05:03:20,669 INFO L131 PetriNetUnfolder]: For 246/246 co-relation queries the response was YES. [2022-12-13 05:03:20,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42969 conditions, 1521 events. 870/1521 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7873 event pairs, 13 based on Foata normal form. 0/1250 useless extension candidates. Maximal degree in co-relation 16876. Up to 1522 conditions per place. [2022-12-13 05:03:20,686 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 598 selfloop transitions, 77 changer transitions 0/675 dead transitions. [2022-12-13 05:03:20,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 675 transitions, 38355 flow [2022-12-13 05:03:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:03:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:03:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 05:03:20,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 05:03:20,688 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 114 predicate places. [2022-12-13 05:03:20,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 675 transitions, 38355 flow [2022-12-13 05:03:20,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 675 transitions, 38355 flow [2022-12-13 05:03:20,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:20,725 INFO L89 Accepts]: Start accepts. Operand has 143 places, 675 transitions, 38355 flow [2022-12-13 05:03:20,735 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:20,735 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:20,735 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 675 transitions, 38355 flow [2022-12-13 05:03:20,748 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 675 transitions, 38355 flow [2022-12-13 05:03:20,748 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:20,750 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:20,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 05:03:20,750 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 675 transitions, 38355 flow [2022-12-13 05:03:20,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:20,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:20,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:03:20,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 05:03:20,751 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 05:03:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1178016416, now seen corresponding path program 4 times [2022-12-13 05:03:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:20,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423049111] [2022-12-13 05:03:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423049111] [2022-12-13 05:03:20,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423049111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:20,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:20,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:03:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660346433] [2022-12-13 05:03:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:20,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:03:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:20,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:03:20,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:03:20,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:03:20,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 675 transitions, 38355 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:20,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:20,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:03:20,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:21,429 INFO L130 PetriNetUnfolder]: 829/1520 cut-off events. [2022-12-13 05:03:21,429 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-12-13 05:03:21,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44479 conditions, 1520 events. 829/1520 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8297 event pairs, 16 based on Foata normal form. 40/1309 useless extension candidates. Maximal degree in co-relation 15815. Up to 1521 conditions per place. [2022-12-13 05:03:21,442 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 571 selfloop transitions, 70 changer transitions 58/699 dead transitions. [2022-12-13 05:03:21,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 699 transitions, 41139 flow [2022-12-13 05:03:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:03:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:03:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-13 05:03:21,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-13 05:03:21,443 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 117 predicate places. [2022-12-13 05:03:21,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 699 transitions, 41139 flow [2022-12-13 05:03:21,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 641 transitions, 37721 flow [2022-12-13 05:03:21,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:21,476 INFO L89 Accepts]: Start accepts. Operand has 141 places, 641 transitions, 37721 flow [2022-12-13 05:03:21,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:21,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:21,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 641 transitions, 37721 flow [2022-12-13 05:03:21,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 641 transitions, 37721 flow [2022-12-13 05:03:21,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:21,500 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:21,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 05:03:21,501 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 641 transitions, 37721 flow [2022-12-13 05:03:21,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:21,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:21,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] [2022-12-13 05:03:21,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 05:03:21,501 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 05:03:21,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1480180664, now seen corresponding path program 5 times [2022-12-13 05:03:21,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:21,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149406264] [2022-12-13 05:03:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:21,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:21,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:21,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149406264] [2022-12-13 05:03:21,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149406264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:21,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:21,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:03:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500629834] [2022-12-13 05:03:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:21,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:03:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:21,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:03:21,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:03:21,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:03:21,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 641 transitions, 37721 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:21,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:21,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:03:21,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:21,985 INFO L130 PetriNetUnfolder]: 785/1344 cut-off events. [2022-12-13 05:03:21,985 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-13 05:03:21,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40651 conditions, 1344 events. 785/1344 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6490 event pairs, 14 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 15244. Up to 1345 conditions per place. [2022-12-13 05:03:21,998 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 494 selfloop transitions, 88 changer transitions 0/582 dead transitions. [2022-12-13 05:03:21,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 582 transitions, 35385 flow [2022-12-13 05:03:21,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:03:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:03:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-13 05:03:21,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-13 05:03:22,005 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 111 predicate places. [2022-12-13 05:03:22,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 582 transitions, 35385 flow [2022-12-13 05:03:22,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 582 transitions, 35385 flow [2022-12-13 05:03:22,038 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:22,039 INFO L89 Accepts]: Start accepts. Operand has 140 places, 582 transitions, 35385 flow [2022-12-13 05:03:22,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:22,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:22,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 582 transitions, 35385 flow [2022-12-13 05:03:22,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 582 transitions, 35385 flow [2022-12-13 05:03:22,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:22,060 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:22,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 05:03:22,061 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 582 transitions, 35385 flow [2022-12-13 05:03:22,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 05:03:22,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:22,062 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:03:22,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 05:03:22,062 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 05:03:22,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:22,062 INFO L85 PathProgramCache]: Analyzing trace with hash -484590403, now seen corresponding path program 1 times [2022-12-13 05:03:22,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:22,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125652225] [2022-12-13 05:03:22,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:22,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:24,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:24,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125652225] [2022-12-13 05:03:24,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125652225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:24,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:24,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 05:03:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949333652] [2022-12-13 05:03:24,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:24,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 05:03:24,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:24,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 05:03:24,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 05:03:24,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 05:03:24,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 582 transitions, 35385 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:03:24,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:24,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 05:03:24,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:26,655 INFO L130 PetriNetUnfolder]: 971/1631 cut-off events. [2022-12-13 05:03:26,656 INFO L131 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-12-13 05:03:26,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50948 conditions, 1631 events. 971/1631 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8087 event pairs, 14 based on Foata normal form. 1/1362 useless extension candidates. Maximal degree in co-relation 19760. Up to 1632 conditions per place. [2022-12-13 05:03:26,671 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 620 selfloop transitions, 60 changer transitions 21/701 dead transitions. [2022-12-13 05:03:26,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 701 transitions, 44017 flow [2022-12-13 05:03:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 05:03:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 05:03:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 99 transitions. [2022-12-13 05:03:26,672 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 05:03:26,673 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 121 predicate places. [2022-12-13 05:03:26,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 701 transitions, 44017 flow [2022-12-13 05:03:26,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 680 transitions, 42685 flow [2022-12-13 05:03:26,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:26,712 INFO L89 Accepts]: Start accepts. Operand has 149 places, 680 transitions, 42685 flow [2022-12-13 05:03:26,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:26,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:26,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 680 transitions, 42685 flow [2022-12-13 05:03:26,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 680 transitions, 42685 flow [2022-12-13 05:03:26,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:30,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:30,983 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:31,127 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 05:03:31,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4415 [2022-12-13 05:03:31,127 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 677 transitions, 42503 flow [2022-12-13 05:03:31,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:03:31,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:31,128 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 05:03:31,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 05:03:31,128 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 05:03:31,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:31,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1790490912, now seen corresponding path program 1 times [2022-12-13 05:03:31,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:31,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460396914] [2022-12-13 05:03:31,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:33,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460396914] [2022-12-13 05:03:33,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460396914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:33,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:33,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:03:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667514527] [2022-12-13 05:03:33,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:33,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:03:33,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:03:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:03:33,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:03:33,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 677 transitions, 42503 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:33,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:33,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:03:33,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:34,744 INFO L130 PetriNetUnfolder]: 976/1646 cut-off events. [2022-12-13 05:03:34,745 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-13 05:03:34,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53068 conditions, 1646 events. 976/1646 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8272 event pairs, 14 based on Foata normal form. 1/1376 useless extension candidates. Maximal degree in co-relation 20366. Up to 1647 conditions per place. [2022-12-13 05:03:34,761 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 603 selfloop transitions, 80 changer transitions 27/710 dead transitions. [2022-12-13 05:03:34,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 710 transitions, 46011 flow [2022-12-13 05:03:34,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 05:03:34,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35648148148148145 [2022-12-13 05:03:34,763 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 124 predicate places. [2022-12-13 05:03:34,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 710 transitions, 46011 flow [2022-12-13 05:03:34,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 683 transitions, 44246 flow [2022-12-13 05:03:34,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:34,806 INFO L89 Accepts]: Start accepts. Operand has 150 places, 683 transitions, 44246 flow [2022-12-13 05:03:34,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:34,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:34,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 683 transitions, 44246 flow [2022-12-13 05:03:34,833 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 683 transitions, 44246 flow [2022-12-13 05:03:34,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:34,836 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:34,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 05:03:34,839 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 683 transitions, 44246 flow [2022-12-13 05:03:34,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:34,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:34,839 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 05:03:34,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 05:03:34,840 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 05:03:34,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1805469130, now seen corresponding path program 2 times [2022-12-13 05:03:34,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:34,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695084918] [2022-12-13 05:03:34,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:37,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695084918] [2022-12-13 05:03:37,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695084918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:37,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:37,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:03:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960245237] [2022-12-13 05:03:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:37,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:03:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:03:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:03:37,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:03:37,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 683 transitions, 44246 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:37,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:37,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:03:37,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:38,868 INFO L130 PetriNetUnfolder]: 967/1632 cut-off events. [2022-12-13 05:03:38,868 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-13 05:03:38,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54245 conditions, 1632 events. 967/1632 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8118 event pairs, 16 based on Foata normal form. 1/1363 useless extension candidates. Maximal degree in co-relation 20931. Up to 1633 conditions per place. [2022-12-13 05:03:38,883 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 592 selfloop transitions, 92 changer transitions 17/701 dead transitions. [2022-12-13 05:03:38,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 701 transitions, 46821 flow [2022-12-13 05:03:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-13 05:03:38,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-13 05:03:38,884 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 128 predicate places. [2022-12-13 05:03:38,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 701 transitions, 46821 flow [2022-12-13 05:03:38,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 684 transitions, 45675 flow [2022-12-13 05:03:38,923 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:38,923 INFO L89 Accepts]: Start accepts. Operand has 156 places, 684 transitions, 45675 flow [2022-12-13 05:03:38,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:38,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:38,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 684 transitions, 45675 flow [2022-12-13 05:03:38,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 684 transitions, 45675 flow [2022-12-13 05:03:38,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:38,952 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:39,064 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:03:39,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 05:03:39,065 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 683 transitions, 45611 flow [2022-12-13 05:03:39,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:39,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:39,065 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 05:03:39,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 05:03:39,066 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 05:03:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash -889763974, now seen corresponding path program 3 times [2022-12-13 05:03:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:39,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613709834] [2022-12-13 05:03:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:39,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:41,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:41,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613709834] [2022-12-13 05:03:41,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613709834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:41,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:41,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:03:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831829966] [2022-12-13 05:03:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:41,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:03:41,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:41,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:03:41,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:03:41,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:03:41,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 683 transitions, 45611 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:41,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:41,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:03:41,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:43,238 INFO L130 PetriNetUnfolder]: 960/1623 cut-off events. [2022-12-13 05:03:43,238 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-13 05:03:43,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55570 conditions, 1623 events. 960/1623 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8110 event pairs, 17 based on Foata normal form. 1/1354 useless extension candidates. Maximal degree in co-relation 21531. Up to 1624 conditions per place. [2022-12-13 05:03:43,254 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 587 selfloop transitions, 95 changer transitions 15/697 dead transitions. [2022-12-13 05:03:43,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 697 transitions, 47947 flow [2022-12-13 05:03:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:03:43,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 05:03:43,256 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 133 predicate places. [2022-12-13 05:03:43,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 697 transitions, 47947 flow [2022-12-13 05:03:43,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 682 transitions, 46906 flow [2022-12-13 05:03:43,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:43,366 INFO L89 Accepts]: Start accepts. Operand has 161 places, 682 transitions, 46906 flow [2022-12-13 05:03:43,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:43,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:43,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 682 transitions, 46906 flow [2022-12-13 05:03:43,390 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 682 transitions, 46906 flow [2022-12-13 05:03:43,390 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:43,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:43,505 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:03:43,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 05:03:43,506 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 681 transitions, 46840 flow [2022-12-13 05:03:43,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:43,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:43,506 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 05:03:43,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 05:03:43,507 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 05:03:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:43,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1854989321, now seen corresponding path program 1 times [2022-12-13 05:03:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:43,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839439484] [2022-12-13 05:03:43,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:43,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:46,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839439484] [2022-12-13 05:03:46,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839439484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:46,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:46,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:03:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803536234] [2022-12-13 05:03:46,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:46,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:03:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:46,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:03:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:03:46,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:03:46,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 681 transitions, 46840 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 05:03:46,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:46,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:03:46,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:47,710 INFO L130 PetriNetUnfolder]: 957/1622 cut-off events. [2022-12-13 05:03:47,710 INFO L131 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2022-12-13 05:03:47,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57160 conditions, 1622 events. 957/1622 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8134 event pairs, 15 based on Foata normal form. 1/1353 useless extension candidates. Maximal degree in co-relation 22129. Up to 1623 conditions per place. [2022-12-13 05:03:47,726 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 588 selfloop transitions, 88 changer transitions 21/697 dead transitions. [2022-12-13 05:03:47,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 697 transitions, 49343 flow [2022-12-13 05:03:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 05:03:47,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35648148148148145 [2022-12-13 05:03:47,728 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 138 predicate places. [2022-12-13 05:03:47,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 697 transitions, 49343 flow [2022-12-13 05:03:47,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 676 transitions, 47847 flow [2022-12-13 05:03:47,771 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:47,771 INFO L89 Accepts]: Start accepts. Operand has 165 places, 676 transitions, 47847 flow [2022-12-13 05:03:47,781 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:47,781 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:47,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 676 transitions, 47847 flow [2022-12-13 05:03:47,796 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 676 transitions, 47847 flow [2022-12-13 05:03:47,796 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:47,801 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:47,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [631] L51-5-->L104-3: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.offset_27| 0) (= |v_ULTIMATE.start_main_#t~pre18#1_79| |v_#pthreadsForks_125|) (= v_~end~0_250 (+ v_~end~0_251 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_41| 4294967296) (mod v_~A~0_103 4294967296))) (= (store |v_#memory_int_257| |v_ULTIMATE.start_main_~#t3~0#1.base_83| (store (select |v_#memory_int_257| |v_ULTIMATE.start_main_~#t3~0#1.base_83|) |v_ULTIMATE.start_main_~#t3~0#1.offset_83| |v_ULTIMATE.start_main_#t~pre18#1_79|)) |v_#memory_int_256|) (= |v_thread1Thread1of1ForFork2_#res#1.base_27| 0) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_45| 4294967296) (mod (select (select |v_#memory_int_257| v_~queue~0.base_147) (+ (* v_~end~0_251 4) v_~queue~0.offset_147)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29|) (= (+ |v_#pthreadsForks_125| 1) |v_#pthreadsForks_124|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_29| 0)) (not (= (ite (and (<= 0 v_~end~0_251) (< v_~end~0_251 v_~n~0_153)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_29| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29|)) InVars {~queue~0.offset=v_~queue~0.offset_147, ~A~0=v_~A~0_103, #pthreadsForks=|v_#pthreadsForks_125|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_45|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_41|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_83|, #memory_int=|v_#memory_int_257|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_83|, ~end~0=v_~end~0_251, ~queue~0.base=v_~queue~0.base_147, ~n~0=v_~n~0_153} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_79|, ~queue~0.offset=v_~queue~0.offset_147, ~A~0=v_~A~0_103, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_45|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_83|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_29|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_83|, ~queue~0.base=v_~queue~0.base_147, #pthreadsForks=|v_#pthreadsForks_124|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_29|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_41|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29|, #memory_int=|v_#memory_int_256|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_77|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_27|, ~end~0=v_~end~0_250, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_67|, ~n~0=v_~n~0_153, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_27|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-13 05:03:48,146 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:03:48,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 375 [2022-12-13 05:03:48,146 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 675 transitions, 47781 flow [2022-12-13 05:03:48,146 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 05:03:48,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:48,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:03:48,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 05:03:48,147 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 05:03:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1141350592, now seen corresponding path program 1 times [2022-12-13 05:03:48,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:48,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860534301] [2022-12-13 05:03:48,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:49,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:49,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860534301] [2022-12-13 05:03:49,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860534301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:49,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:49,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:03:49,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510168367] [2022-12-13 05:03:49,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:49,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:03:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:03:49,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:03:49,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:03:49,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 675 transitions, 47781 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:03:49,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:49,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:03:49,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:50,227 INFO L130 PetriNetUnfolder]: 951/1603 cut-off events. [2022-12-13 05:03:50,228 INFO L131 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2022-12-13 05:03:50,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58097 conditions, 1603 events. 951/1603 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7958 event pairs, 14 based on Foata normal form. 1/1342 useless extension candidates. Maximal degree in co-relation 22509. Up to 1604 conditions per place. [2022-12-13 05:03:50,248 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 588 selfloop transitions, 86 changer transitions 14/688 dead transitions. [2022-12-13 05:03:50,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 688 transitions, 50085 flow [2022-12-13 05:03:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:03:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:03:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-12-13 05:03:50,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35978835978835977 [2022-12-13 05:03:50,249 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 141 predicate places. [2022-12-13 05:03:50,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 688 transitions, 50085 flow [2022-12-13 05:03:50,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 674 transitions, 49055 flow [2022-12-13 05:03:50,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:50,301 INFO L89 Accepts]: Start accepts. Operand has 168 places, 674 transitions, 49055 flow [2022-12-13 05:03:50,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:50,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:50,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 674 transitions, 49055 flow [2022-12-13 05:03:50,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 674 transitions, 49055 flow [2022-12-13 05:03:50,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:50,329 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:50,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 05:03:50,329 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 674 transitions, 49055 flow [2022-12-13 05:03:50,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:03:50,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:50,330 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 05:03:50,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 05:03:50,330 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 05:03:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash -265316731, now seen corresponding path program 1 times [2022-12-13 05:03:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:50,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812758074] [2022-12-13 05:03:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:52,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:52,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812758074] [2022-12-13 05:03:52,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812758074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:52,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:52,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:03:52,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247399824] [2022-12-13 05:03:52,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:52,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:03:52,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:52,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:03:52,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:03:52,581 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:03:52,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 674 transitions, 49055 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 05:03:52,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:52,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:03:52,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:53,631 INFO L130 PetriNetUnfolder]: 950/1602 cut-off events. [2022-12-13 05:03:53,632 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-13 05:03:53,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59662 conditions, 1602 events. 950/1602 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7961 event pairs, 16 based on Foata normal form. 1/1341 useless extension candidates. Maximal degree in co-relation 23094. Up to 1603 conditions per place. [2022-12-13 05:03:53,649 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 582 selfloop transitions, 88 changer transitions 17/687 dead transitions. [2022-12-13 05:03:53,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 687 transitions, 51383 flow [2022-12-13 05:03:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-13 05:03:53,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3605769230769231 [2022-12-13 05:03:53,652 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 146 predicate places. [2022-12-13 05:03:53,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 687 transitions, 51383 flow [2022-12-13 05:03:53,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 670 transitions, 50102 flow [2022-12-13 05:03:53,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:53,705 INFO L89 Accepts]: Start accepts. Operand has 172 places, 670 transitions, 50102 flow [2022-12-13 05:03:53,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:53,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:53,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 670 transitions, 50102 flow [2022-12-13 05:03:53,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 670 transitions, 50102 flow [2022-12-13 05:03:53,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:53,736 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:03:53,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 05:03:53,737 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 670 transitions, 50102 flow [2022-12-13 05:03:53,737 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 05:03:53,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:53,737 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 05:03:53,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 05:03:53,737 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 05:03:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash 991631912, now seen corresponding path program 4 times [2022-12-13 05:03:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:53,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648895535] [2022-12-13 05:03:53,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:53,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:03:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:56,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648895535] [2022-12-13 05:03:56,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648895535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:03:56,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:03:56,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:03:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367897921] [2022-12-13 05:03:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:03:56,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:03:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:03:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:03:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:03:56,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:03:56,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 670 transitions, 50102 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:56,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:03:56,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:03:56,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:03:57,449 INFO L130 PetriNetUnfolder]: 956/1618 cut-off events. [2022-12-13 05:03:57,450 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-13 05:03:57,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61876 conditions, 1618 events. 956/1618 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8095 event pairs, 14 based on Foata normal form. 1/1357 useless extension candidates. Maximal degree in co-relation 24020. Up to 1619 conditions per place. [2022-12-13 05:03:57,466 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 584 selfloop transitions, 95 changer transitions 17/696 dead transitions. [2022-12-13 05:03:57,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 696 transitions, 53445 flow [2022-12-13 05:03:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:03:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:03:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-12-13 05:03:57,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.345 [2022-12-13 05:03:57,468 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 150 predicate places. [2022-12-13 05:03:57,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 696 transitions, 53445 flow [2022-12-13 05:03:57,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 679 transitions, 52129 flow [2022-12-13 05:03:57,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:57,512 INFO L89 Accepts]: Start accepts. Operand has 178 places, 679 transitions, 52129 flow [2022-12-13 05:03:57,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:57,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:57,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 679 transitions, 52129 flow [2022-12-13 05:03:57,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 679 transitions, 52129 flow [2022-12-13 05:03:57,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:57,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:57,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] $Ultimate##0-->thread1EXIT: Formula: (and (not (= (ite (and (< v_~end~0_265 v_~n~0_159) (<= 0 v_~end~0_265)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_~i~0#1_45| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_31| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_45| 4294967296) (mod v_~A~0_109 4294967296))) (= (ite (= (mod (select (select |v_#memory_int_268| v_~queue~0.base_153) (+ (* v_~end~0_265 4) v_~queue~0.offset_153)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_49| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (= |v_thread1Thread1of1ForFork2_~x~0#1_49| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_31| 0) (= v_~end~0_264 (+ v_~end~0_265 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|)) InVars {~queue~0.offset=v_~queue~0.offset_153, ~A~0=v_~A~0_109, #memory_int=|v_#memory_int_268|, ~end~0=v_~end~0_265, ~queue~0.base=v_~queue~0.base_153, ~n~0=v_~n~0_159} OutVars{~queue~0.offset=v_~queue~0.offset_153, ~A~0=v_~A~0_109, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_49|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_33|, ~queue~0.base=v_~queue~0.base_153, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_33|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, #memory_int=|v_#memory_int_268|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_31|, ~end~0=v_~end~0_264, ~n~0=v_~n~0_159, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_31|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:03:57,798 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:03:57,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 287 [2022-12-13 05:03:57,799 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 677 transitions, 51981 flow [2022-12-13 05:03:57,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:03:57,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:57,799 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 05:03:57,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 05:03:57,799 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 05:03:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1864711456, now seen corresponding path program 5 times [2022-12-13 05:03:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:57,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308751566] [2022-12-13 05:03:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:00,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:00,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308751566] [2022-12-13 05:04:00,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308751566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:00,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:00,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:04:00,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138461369] [2022-12-13 05:04:00,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:00,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:04:00,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:00,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:04:00,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:04:00,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:04:00,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 677 transitions, 51981 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:04:00,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:00,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:04:00,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:01,604 INFO L130 PetriNetUnfolder]: 959/1630 cut-off events. [2022-12-13 05:04:01,604 INFO L131 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2022-12-13 05:04:01,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63969 conditions, 1630 events. 959/1630 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8202 event pairs, 16 based on Foata normal form. 1/1368 useless extension candidates. Maximal degree in co-relation 24811. Up to 1631 conditions per place. [2022-12-13 05:04:01,623 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 630 selfloop transitions, 51 changer transitions 23/704 dead transitions. [2022-12-13 05:04:01,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 704 transitions, 55474 flow [2022-12-13 05:04:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:04:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:04:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-12-13 05:04:01,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36574074074074076 [2022-12-13 05:04:01,624 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 154 predicate places. [2022-12-13 05:04:01,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 704 transitions, 55474 flow [2022-12-13 05:04:01,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 681 transitions, 53650 flow [2022-12-13 05:04:01,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:01,671 INFO L89 Accepts]: Start accepts. Operand has 182 places, 681 transitions, 53650 flow [2022-12-13 05:04:01,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:01,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:01,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 681 transitions, 53650 flow [2022-12-13 05:04:01,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 681 transitions, 53650 flow [2022-12-13 05:04:01,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:01,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:04:01,937 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:04:01,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-13 05:04:01,938 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 679 transitions, 53496 flow [2022-12-13 05:04:01,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:04:01,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:01,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:04:01,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 05:04:01,939 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 05:04:01,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash -53318479, now seen corresponding path program 1 times [2022-12-13 05:04:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:01,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267982342] [2022-12-13 05:04:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:01,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:02,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:02,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267982342] [2022-12-13 05:04:02,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267982342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:02,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:02,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:04:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133220381] [2022-12-13 05:04:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:02,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:04:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:04:02,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:04:02,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:04:02,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 679 transitions, 53496 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:04:02,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:02,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:04:02,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:03,698 INFO L130 PetriNetUnfolder]: 955/1623 cut-off events. [2022-12-13 05:04:03,698 INFO L131 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2022-12-13 05:04:03,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65321 conditions, 1623 events. 955/1623 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8211 event pairs, 15 based on Foata normal form. 1/1361 useless extension candidates. Maximal degree in co-relation 25327. Up to 1624 conditions per place. [2022-12-13 05:04:03,716 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 596 selfloop transitions, 91 changer transitions 14/701 dead transitions. [2022-12-13 05:04:03,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 701 transitions, 56641 flow [2022-12-13 05:04:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:04:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:04:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-13 05:04:03,717 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34183673469387754 [2022-12-13 05:04:03,718 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 157 predicate places. [2022-12-13 05:04:03,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 701 transitions, 56641 flow [2022-12-13 05:04:03,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 687 transitions, 55501 flow [2022-12-13 05:04:03,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:03,765 INFO L89 Accepts]: Start accepts. Operand has 184 places, 687 transitions, 55501 flow [2022-12-13 05:04:03,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:03,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:03,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 687 transitions, 55501 flow [2022-12-13 05:04:03,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 687 transitions, 55501 flow [2022-12-13 05:04:03,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:03,793 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:04:03,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 05:04:03,794 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 687 transitions, 55501 flow [2022-12-13 05:04:03,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:04:03,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:03,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:04:03,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 05:04:03,794 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 05:04:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash -330997326, now seen corresponding path program 1 times [2022-12-13 05:04:03,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:03,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111257844] [2022-12-13 05:04:03,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:08,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111257844] [2022-12-13 05:04:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111257844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:08,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:08,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:04:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702621327] [2022-12-13 05:04:08,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:08,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:04:08,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:08,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:04:08,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:04:08,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:04:08,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 687 transitions, 55501 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:04:08,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:08,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:04:08,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:09,204 INFO L130 PetriNetUnfolder]: 954/1622 cut-off events. [2022-12-13 05:04:09,204 INFO L131 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2022-12-13 05:04:09,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66903 conditions, 1622 events. 954/1622 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8161 event pairs, 14 based on Foata normal form. 1/1361 useless extension candidates. Maximal degree in co-relation 25917. Up to 1623 conditions per place. [2022-12-13 05:04:09,222 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 609 selfloop transitions, 74 changer transitions 17/700 dead transitions. [2022-12-13 05:04:09,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 700 transitions, 57959 flow [2022-12-13 05:04:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:04:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:04:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-13 05:04:09,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37566137566137564 [2022-12-13 05:04:09,224 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 161 predicate places. [2022-12-13 05:04:09,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 700 transitions, 57959 flow [2022-12-13 05:04:09,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 683 transitions, 56542 flow [2022-12-13 05:04:09,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:09,273 INFO L89 Accepts]: Start accepts. Operand has 188 places, 683 transitions, 56542 flow [2022-12-13 05:04:09,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:09,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:09,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 683 transitions, 56542 flow [2022-12-13 05:04:09,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 683 transitions, 56542 flow [2022-12-13 05:04:09,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:09,310 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:04:09,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 05:04:09,310 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 683 transitions, 56542 flow [2022-12-13 05:04:09,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:04:09,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:09,311 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 05:04:09,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 05:04:09,311 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 05:04:09,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1174243416, now seen corresponding path program 1 times [2022-12-13 05:04:09,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:09,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571261273] [2022-12-13 05:04:09,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:11,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571261273] [2022-12-13 05:04:11,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571261273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:11,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:11,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:04:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013474225] [2022-12-13 05:04:11,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:11,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:04:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:04:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:04:11,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:04:11,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 683 transitions, 56542 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 05:04:11,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:11,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:04:11,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:12,173 INFO L130 PetriNetUnfolder]: 953/1613 cut-off events. [2022-12-13 05:04:12,174 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-13 05:04:12,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68145 conditions, 1613 events. 953/1613 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8047 event pairs, 16 based on Foata normal form. 1/1358 useless extension candidates. Maximal degree in co-relation 26251. Up to 1614 conditions per place. [2022-12-13 05:04:12,193 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 586 selfloop transitions, 88 changer transitions 22/696 dead transitions. [2022-12-13 05:04:12,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 696 transitions, 59018 flow [2022-12-13 05:04:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:04:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:04:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-13 05:04:12,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2022-12-13 05:04:12,194 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 166 predicate places. [2022-12-13 05:04:12,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 696 transitions, 59018 flow [2022-12-13 05:04:12,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 674 transitions, 57144 flow [2022-12-13 05:04:12,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:12,244 INFO L89 Accepts]: Start accepts. Operand has 192 places, 674 transitions, 57144 flow [2022-12-13 05:04:12,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:12,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:12,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 674 transitions, 57144 flow [2022-12-13 05:04:12,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 674 transitions, 57144 flow [2022-12-13 05:04:12,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:12,277 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:04:12,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 05:04:12,278 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 674 transitions, 57144 flow [2022-12-13 05:04:12,278 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 05:04:12,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:12,278 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 05:04:12,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 05:04:12,278 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 05:04:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2048962636, now seen corresponding path program 6 times [2022-12-13 05:04:12,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:12,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145461915] [2022-12-13 05:04:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:13,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:13,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145461915] [2022-12-13 05:04:13,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145461915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:13,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:13,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:04:13,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722650873] [2022-12-13 05:04:13,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:13,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:04:13,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:13,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:04:13,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:04:13,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:04:13,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 674 transitions, 57144 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 05:04:13,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:13,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:04:13,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:14,210 INFO L130 PetriNetUnfolder]: 1002/1677 cut-off events. [2022-12-13 05:04:14,210 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2022-12-13 05:04:14,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72522 conditions, 1677 events. 1002/1677 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8336 event pairs, 12 based on Foata normal form. 1/1408 useless extension candidates. Maximal degree in co-relation 27562. Up to 1678 conditions per place. [2022-12-13 05:04:14,230 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 602 selfloop transitions, 108 changer transitions 15/725 dead transitions. [2022-12-13 05:04:14,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 725 transitions, 62920 flow [2022-12-13 05:04:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:04:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:04:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-12-13 05:04:14,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-13 05:04:14,231 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 170 predicate places. [2022-12-13 05:04:14,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 725 transitions, 62920 flow [2022-12-13 05:04:14,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 710 transitions, 61609 flow [2022-12-13 05:04:14,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:14,284 INFO L89 Accepts]: Start accepts. Operand has 198 places, 710 transitions, 61609 flow [2022-12-13 05:04:14,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:14,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:14,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 710 transitions, 61609 flow [2022-12-13 05:04:14,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 710 transitions, 61609 flow [2022-12-13 05:04:14,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:14,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:04:14,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [639] L51-5-->L104-3: Formula: (and (= (ite (= (mod (select (select |v_#memory_int_287| v_~queue~0.base_161) (+ (* v_~end~0_281 4) v_~queue~0.offset_161)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_55| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_35| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_51| 4294967296) (mod v_~A~0_117 4294967296))) (= |v_ULTIMATE.start_main_#t~pre18#1_93| |v_#pthreadsForks_153|) (= (+ |v_#pthreadsForks_153| 1) |v_#pthreadsForks_152|) (= (store |v_#memory_int_287| |v_ULTIMATE.start_main_~#t3~0#1.base_97| (store (select |v_#memory_int_287| |v_ULTIMATE.start_main_~#t3~0#1.base_97|) |v_ULTIMATE.start_main_~#t3~0#1.offset_97| |v_ULTIMATE.start_main_#t~pre18#1_93|)) |v_#memory_int_286|) (= |v_thread1Thread1of1ForFork2_#res#1.base_35| 0) (= (+ v_~end~0_281 1) v_~end~0_280) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_37| 0)) (not (= (ite (and (< v_~end~0_281 v_~n~0_167) (<= 0 v_~end~0_281)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_161, ~A~0=v_~A~0_117, #pthreadsForks=|v_#pthreadsForks_153|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_55|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_97|, #memory_int=|v_#memory_int_287|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_97|, ~end~0=v_~end~0_281, ~queue~0.base=v_~queue~0.base_161, ~n~0=v_~n~0_167} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_93|, ~queue~0.offset=v_~queue~0.offset_161, ~A~0=v_~A~0_117, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_55|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_97|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_37|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_97|, ~queue~0.base=v_~queue~0.base_161, #pthreadsForks=|v_#pthreadsForks_152|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_37|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|, #memory_int=|v_#memory_int_286|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_91|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_35|, ~end~0=v_~end~0_280, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_81|, ~n~0=v_~n~0_167, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_35|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-13 05:04:14,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:04:14,798 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:04:14,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 516 [2022-12-13 05:04:14,799 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 708 transitions, 61443 flow [2022-12-13 05:04:14,799 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 05:04:14,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:14,800 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 05:04:14,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 05:04:14,800 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 05:04:14,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1133257480, now seen corresponding path program 7 times [2022-12-13 05:04:14,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:14,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357727354] [2022-12-13 05:04:14,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:16,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357727354] [2022-12-13 05:04:16,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357727354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:16,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:16,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:04:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097525677] [2022-12-13 05:04:16,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:16,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:04:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:04:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:04:16,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:04:16,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 708 transitions, 61443 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:04:16,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:16,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:04:16,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:17,466 INFO L130 PetriNetUnfolder]: 997/1668 cut-off events. [2022-12-13 05:04:17,466 INFO L131 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-12-13 05:04:17,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73805 conditions, 1668 events. 997/1668 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8241 event pairs, 15 based on Foata normal form. 1/1403 useless extension candidates. Maximal degree in co-relation 28073. Up to 1669 conditions per place. [2022-12-13 05:04:17,487 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 588 selfloop transitions, 116 changer transitions 18/722 dead transitions. [2022-12-13 05:04:17,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 722 transitions, 64109 flow [2022-12-13 05:04:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:04:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:04:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-12-13 05:04:17,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3425925925925926 [2022-12-13 05:04:17,489 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 174 predicate places. [2022-12-13 05:04:17,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 722 transitions, 64109 flow [2022-12-13 05:04:17,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 704 transitions, 62501 flow [2022-12-13 05:04:17,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:17,542 INFO L89 Accepts]: Start accepts. Operand has 202 places, 704 transitions, 62501 flow [2022-12-13 05:04:17,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:17,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:17,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 704 transitions, 62501 flow [2022-12-13 05:04:17,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 704 transitions, 62501 flow [2022-12-13 05:04:17,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:17,579 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-13 05:04:17,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:04:17,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] L51-5-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_298| v_~queue~0.base_167)) (.cse1 (mod v_~A~0_123 4294967296))) (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_59| 4294967296) (mod (select .cse0 (+ (* v_~end~0_296 4) v_~queue~0.offset_167)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= v_~end~0_294 (+ v_~end~0_296 2)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_39| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| (ite (= (mod (select .cse0 (+ (* v_~end~0_294 4) (- 4) v_~queue~0.offset_167)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_67| 4294967296)) 1 0)) (not (= (ite (and (<= 1 v_~end~0_294) (< v_~end~0_294 (+ v_~n~0_173 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_41| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_55| 4294967296) .cse1)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_69| 4294967296) .cse1)) (not (= (ite (and (< v_~end~0_296 v_~n~0_173) (<= 0 v_~end~0_296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_41| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_39| 0))) InVars {~queue~0.offset=v_~queue~0.offset_167, ~A~0=v_~A~0_123, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_59|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, #memory_int=|v_#memory_int_298|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_69|, ~end~0=v_~end~0_296, ~queue~0.base=v_~queue~0.base_167, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_67|, ~n~0=v_~n~0_173} OutVars{~queue~0.offset=v_~queue~0.offset_167, ~A~0=v_~A~0_123, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_59|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_41|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_41|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_69|, ~queue~0.base=v_~queue~0.base_167, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_41|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_41|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, #memory_int=|v_#memory_int_298|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_51|, ~end~0=v_~end~0_294, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_39|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_67|, ~n~0=v_~n~0_173, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_39|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:04:18,065 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:04:18,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 524 [2022-12-13 05:04:18,066 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 702 transitions, 62331 flow [2022-12-13 05:04:18,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:04:18,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:18,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:04:18,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 05:04:18,066 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 05:04:18,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash 671967751, now seen corresponding path program 1 times [2022-12-13 05:04:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:18,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128573874] [2022-12-13 05:04:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:20,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:20,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128573874] [2022-12-13 05:04:20,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128573874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:20,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:20,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:04:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282387298] [2022-12-13 05:04:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:20,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:04:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:20,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:04:20,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:04:20,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 05:04:20,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 702 transitions, 62331 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:04:20,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:20,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 05:04:20,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:21,110 INFO L130 PetriNetUnfolder]: 987/1651 cut-off events. [2022-12-13 05:04:21,111 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-13 05:04:21,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74709 conditions, 1651 events. 987/1651 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8183 event pairs, 17 based on Foata normal form. 1/1392 useless extension candidates. Maximal degree in co-relation 28488. Up to 1652 conditions per place. [2022-12-13 05:04:21,136 INFO L137 encePairwiseOnDemand]: 14/29 looper letters, 588 selfloop transitions, 113 changer transitions 14/715 dead transitions. [2022-12-13 05:04:21,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 715 transitions, 64923 flow [2022-12-13 05:04:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:04:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:04:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-12-13 05:04:21,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33497536945812806 [2022-12-13 05:04:21,140 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 174 predicate places. [2022-12-13 05:04:21,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 715 transitions, 64923 flow [2022-12-13 05:04:21,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 701 transitions, 63641 flow [2022-12-13 05:04:21,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:21,204 INFO L89 Accepts]: Start accepts. Operand has 201 places, 701 transitions, 63641 flow [2022-12-13 05:04:21,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:21,217 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:21,217 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 701 transitions, 63641 flow [2022-12-13 05:04:21,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 701 transitions, 63641 flow [2022-12-13 05:04:21,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:21,236 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:04:21,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 05:04:21,236 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 701 transitions, 63641 flow [2022-12-13 05:04:21,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:04:21,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:21,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:04:21,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 05:04:21,237 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 05:04:21,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1972171785, now seen corresponding path program 1 times [2022-12-13 05:04:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:21,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119834777] [2022-12-13 05:04:21,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:21,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:22,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:22,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119834777] [2022-12-13 05:04:22,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119834777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:22,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:22,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:04:22,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245721646] [2022-12-13 05:04:22,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:22,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:04:22,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:22,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:04:22,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:04:22,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:04:22,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 701 transitions, 63641 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:04:22,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:22,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:04:22,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:23,352 INFO L130 PetriNetUnfolder]: 986/1650 cut-off events. [2022-12-13 05:04:23,352 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-13 05:04:23,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76313 conditions, 1650 events. 986/1650 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8161 event pairs, 14 based on Foata normal form. 1/1392 useless extension candidates. Maximal degree in co-relation 29072. Up to 1651 conditions per place. [2022-12-13 05:04:23,373 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 588 selfloop transitions, 112 changer transitions 14/714 dead transitions. [2022-12-13 05:04:23,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 714 transitions, 66257 flow [2022-12-13 05:04:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:04:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:04:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-13 05:04:23,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34183673469387754 [2022-12-13 05:04:23,374 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 178 predicate places. [2022-12-13 05:04:23,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 714 transitions, 66257 flow [2022-12-13 05:04:23,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 700 transitions, 64947 flow [2022-12-13 05:04:23,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:23,428 INFO L89 Accepts]: Start accepts. Operand has 205 places, 700 transitions, 64947 flow [2022-12-13 05:04:23,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:23,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:23,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 700 transitions, 64947 flow [2022-12-13 05:04:23,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 700 transitions, 64947 flow [2022-12-13 05:04:23,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:23,469 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:04:23,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 05:04:23,470 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 700 transitions, 64947 flow [2022-12-13 05:04:23,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:04:23,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:23,470 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 05:04:23,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 05:04:23,470 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 05:04:23,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1230218336, now seen corresponding path program 1 times [2022-12-13 05:04:23,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:23,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630539432] [2022-12-13 05:04:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:23,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:25,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630539432] [2022-12-13 05:04:25,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630539432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:25,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:25,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:04:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913167788] [2022-12-13 05:04:25,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:25,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:04:25,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:04:25,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:04:25,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:04:25,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 700 transitions, 64947 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 05:04:25,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:25,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:04:25,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:26,324 INFO L130 PetriNetUnfolder]: 985/1649 cut-off events. [2022-12-13 05:04:26,324 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2022-12-13 05:04:26,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77915 conditions, 1649 events. 985/1649 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8174 event pairs, 14 based on Foata normal form. 1/1391 useless extension candidates. Maximal degree in co-relation 29654. Up to 1650 conditions per place. [2022-12-13 05:04:26,346 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 581 selfloop transitions, 111 changer transitions 21/713 dead transitions. [2022-12-13 05:04:26,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 713 transitions, 67587 flow [2022-12-13 05:04:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:04:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:04:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-12-13 05:04:26,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 05:04:26,347 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 183 predicate places. [2022-12-13 05:04:26,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 713 transitions, 67587 flow [2022-12-13 05:04:26,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 692 transitions, 65587 flow [2022-12-13 05:04:26,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:26,402 INFO L89 Accepts]: Start accepts. Operand has 207 places, 692 transitions, 65587 flow [2022-12-13 05:04:26,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:26,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:26,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 692 transitions, 65587 flow [2022-12-13 05:04:26,435 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 692 transitions, 65587 flow [2022-12-13 05:04:26,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:26,437 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:04:26,437 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 05:04:26,437 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 692 transitions, 65587 flow [2022-12-13 05:04:26,437 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 05:04:26,437 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:26,437 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 05:04:26,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 05:04:26,438 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 05:04:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:26,438 INFO L85 PathProgramCache]: Analyzing trace with hash -764800544, now seen corresponding path program 1 times [2022-12-13 05:04:26,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:26,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900576741] [2022-12-13 05:04:26,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:26,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:29,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:29,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900576741] [2022-12-13 05:04:29,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900576741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:29,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:29,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:04:29,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264163649] [2022-12-13 05:04:29,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:29,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:04:29,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:04:29,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:04:29,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:04:29,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 692 transitions, 65587 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 05:04:29,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:29,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:04:29,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:30,364 INFO L130 PetriNetUnfolder]: 977/1635 cut-off events. [2022-12-13 05:04:30,365 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2022-12-13 05:04:30,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78888 conditions, 1635 events. 977/1635 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8066 event pairs, 14 based on Foata normal form. 1/1380 useless extension candidates. Maximal degree in co-relation 30091. Up to 1636 conditions per place. [2022-12-13 05:04:30,387 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 577 selfloop transitions, 109 changer transitions 19/705 dead transitions. [2022-12-13 05:04:30,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 705 transitions, 68237 flow [2022-12-13 05:04:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:04:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:04:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-12-13 05:04:30,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3317307692307692 [2022-12-13 05:04:30,388 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 185 predicate places. [2022-12-13 05:04:30,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 705 transitions, 68237 flow [2022-12-13 05:04:30,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 686 transitions, 66387 flow [2022-12-13 05:04:30,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:30,443 INFO L89 Accepts]: Start accepts. Operand has 207 places, 686 transitions, 66387 flow [2022-12-13 05:04:30,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:30,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:30,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 686 transitions, 66387 flow [2022-12-13 05:04:30,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 686 transitions, 66387 flow [2022-12-13 05:04:30,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:30,480 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:04:30,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 05:04:30,480 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 686 transitions, 66387 flow [2022-12-13 05:04:30,481 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 05:04:30,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:30,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:04:30,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 05:04:30,481 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 05:04:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 505097350, now seen corresponding path program 1 times [2022-12-13 05:04:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:30,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652784283] [2022-12-13 05:04:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:34,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 05:04:34,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:34,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652784283] [2022-12-13 05:04:34,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652784283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:34,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:34,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 05:04:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558252719] [2022-12-13 05:04:34,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:34,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 05:04:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 05:04:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 05:04:34,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:04:34,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 686 transitions, 66387 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:04:34,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:34,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:04:34,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:36,590 INFO L130 PetriNetUnfolder]: 1154/1894 cut-off events. [2022-12-13 05:04:36,590 INFO L131 PetriNetUnfolder]: For 258/258 co-relation queries the response was YES. [2022-12-13 05:04:36,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93259 conditions, 1894 events. 1154/1894 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9417 event pairs, 12 based on Foata normal form. 1/1574 useless extension candidates. Maximal degree in co-relation 36949. Up to 1895 conditions per place. [2022-12-13 05:04:36,616 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 675 selfloop transitions, 109 changer transitions 21/805 dead transitions. [2022-12-13 05:04:36,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 805 transitions, 79511 flow [2022-12-13 05:04:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 05:04:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 05:04:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-12-13 05:04:36,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 05:04:36,618 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 188 predicate places. [2022-12-13 05:04:36,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 805 transitions, 79511 flow [2022-12-13 05:04:36,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 784 transitions, 77423 flow [2022-12-13 05:04:36,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:36,686 INFO L89 Accepts]: Start accepts. Operand has 216 places, 784 transitions, 77423 flow [2022-12-13 05:04:36,706 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:36,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:36,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 784 transitions, 77423 flow [2022-12-13 05:04:36,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 784 transitions, 77423 flow [2022-12-13 05:04:36,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:42,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:04:42,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [647] $Ultimate##0-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_73| 4294967296) (mod v_~A~0_133 4294967296))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_55| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_71| 4294967296) (mod (select (select |v_#memory_int_320| v_~queue~0.base_179) (+ (* v_~end~0_313 4) v_~queue~0.offset_179)) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_55| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_55|) (not (= (ite (and (< v_~end~0_313 v_~n~0_183) (<= 0 v_~end~0_313)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_45| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_71| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_45| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_55| 0)) (= v_~end~0_312 (+ v_~end~0_313 1)) (= |v_thread2Thread1of1ForFork0_~i~1#1_73| 0)) InVars {~queue~0.offset=v_~queue~0.offset_179, ~A~0=v_~A~0_133, #memory_int=|v_#memory_int_320|, ~end~0=v_~end~0_313, ~queue~0.base=v_~queue~0.base_179, ~n~0=v_~n~0_183} OutVars{~queue~0.offset=v_~queue~0.offset_179, ~A~0=v_~A~0_133, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_45|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_55|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_73|, ~queue~0.base=v_~queue~0.base_179, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_55|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_45|, #memory_int=|v_#memory_int_320|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_55|, ~end~0=v_~end~0_312, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_71|, ~n~0=v_~n~0_183, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_55|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:04:42,691 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 05:04:42,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6007 [2022-12-13 05:04:42,692 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 781 transitions, 77133 flow [2022-12-13 05:04:42,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:04:42,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:42,692 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 05:04:42,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 05:04:42,692 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 05:04:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash -257101492, now seen corresponding path program 1 times [2022-12-13 05:04:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:42,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447180714] [2022-12-13 05:04:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:45,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 05:04:45,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447180714] [2022-12-13 05:04:45,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447180714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:45,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:45,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:04:45,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782310547] [2022-12-13 05:04:45,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:45,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:04:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:45,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:04:45,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:04:45,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:04:45,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 781 transitions, 77133 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:04:45,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:45,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:04:45,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:47,044 INFO L130 PetriNetUnfolder]: 1159/1909 cut-off events. [2022-12-13 05:04:47,044 INFO L131 PetriNetUnfolder]: For 257/257 co-relation queries the response was YES. [2022-12-13 05:04:47,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95912 conditions, 1909 events. 1159/1909 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9597 event pairs, 14 based on Foata normal form. 1/1588 useless extension candidates. Maximal degree in co-relation 37654. Up to 1910 conditions per place. [2022-12-13 05:04:47,071 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 685 selfloop transitions, 102 changer transitions 27/814 dead transitions. [2022-12-13 05:04:47,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 814 transitions, 82037 flow [2022-12-13 05:04:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:04:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:04:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:04:47,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2022-12-13 05:04:47,073 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 191 predicate places. [2022-12-13 05:04:47,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 814 transitions, 82037 flow [2022-12-13 05:04:47,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 787 transitions, 79300 flow [2022-12-13 05:04:47,167 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:47,167 INFO L89 Accepts]: Start accepts. Operand has 217 places, 787 transitions, 79300 flow [2022-12-13 05:04:47,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:47,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:47,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 787 transitions, 79300 flow [2022-12-13 05:04:47,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 787 transitions, 79300 flow [2022-12-13 05:04:47,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:47,236 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:04:47,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 05:04:47,237 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 787 transitions, 79300 flow [2022-12-13 05:04:47,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:04:47,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:47,237 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 05:04:47,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 05:04:47,237 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 05:04:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash -272079710, now seen corresponding path program 2 times [2022-12-13 05:04:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:47,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230528246] [2022-12-13 05:04:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:47,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:04:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:04:54,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:04:54,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230528246] [2022-12-13 05:04:54,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230528246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:04:54,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:04:54,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:04:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90713973] [2022-12-13 05:04:54,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:04:54,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:04:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:04:54,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:04:54,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:04:54,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:04:54,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 787 transitions, 79300 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:04:54,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:04:54,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:04:54,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:04:56,584 INFO L130 PetriNetUnfolder]: 1150/1895 cut-off events. [2022-12-13 05:04:56,584 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2022-12-13 05:04:56,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97100 conditions, 1895 events. 1150/1895 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9477 event pairs, 14 based on Foata normal form. 1/1575 useless extension candidates. Maximal degree in co-relation 38300. Up to 1896 conditions per place. [2022-12-13 05:04:56,611 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 671 selfloop transitions, 117 changer transitions 17/805 dead transitions. [2022-12-13 05:04:56,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 805 transitions, 82731 flow [2022-12-13 05:04:56,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:04:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:04:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 05:04:56,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3701923076923077 [2022-12-13 05:04:56,613 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 195 predicate places. [2022-12-13 05:04:56,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 224 places, 805 transitions, 82731 flow [2022-12-13 05:04:56,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 788 transitions, 80973 flow [2022-12-13 05:04:56,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:04:56,682 INFO L89 Accepts]: Start accepts. Operand has 223 places, 788 transitions, 80973 flow [2022-12-13 05:04:56,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:04:56,706 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:04:56,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 788 transitions, 80973 flow [2022-12-13 05:04:56,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 788 transitions, 80973 flow [2022-12-13 05:04:56,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:04:56,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:04:56,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:04:56,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 05:04:56,842 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 787 transitions, 80873 flow [2022-12-13 05:04:56,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:04:56,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:04:56,842 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 05:04:56,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 05:04:56,843 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 05:04:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:04:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash 643625446, now seen corresponding path program 3 times [2022-12-13 05:04:56,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:04:56,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732855878] [2022-12-13 05:04:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:04:56,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:04:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:00,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:00,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732855878] [2022-12-13 05:05:00,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732855878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:00,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:00,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:05:00,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468406011] [2022-12-13 05:05:00,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:00,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:05:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:00,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:05:00,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:05:00,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:05:00,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 787 transitions, 80873 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:05:00,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:00,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:05:00,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:01,508 INFO L130 PetriNetUnfolder]: 1143/1886 cut-off events. [2022-12-13 05:05:01,508 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-12-13 05:05:01,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98526 conditions, 1886 events. 1143/1886 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9433 event pairs, 17 based on Foata normal form. 1/1566 useless extension candidates. Maximal degree in co-relation 38999. Up to 1887 conditions per place. [2022-12-13 05:05:01,664 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 666 selfloop transitions, 120 changer transitions 15/801 dead transitions. [2022-12-13 05:05:01,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 801 transitions, 83921 flow [2022-12-13 05:05:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-12-13 05:05:01,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36574074074074076 [2022-12-13 05:05:01,666 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 200 predicate places. [2022-12-13 05:05:01,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 801 transitions, 83921 flow [2022-12-13 05:05:01,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 786 transitions, 82340 flow [2022-12-13 05:05:01,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:01,733 INFO L89 Accepts]: Start accepts. Operand has 228 places, 786 transitions, 82340 flow [2022-12-13 05:05:01,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:01,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:01,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 786 transitions, 82340 flow [2022-12-13 05:05:01,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 786 transitions, 82340 flow [2022-12-13 05:05:01,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:01,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:05:01,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:05:01,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-13 05:05:01,922 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 785 transitions, 82238 flow [2022-12-13 05:05:01,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:05:01,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:01,922 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 05:05:01,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 05:05:01,922 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 05:05:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1079194901, now seen corresponding path program 1 times [2022-12-13 05:05:01,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:01,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362714834] [2022-12-13 05:05:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:03,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 05:05:03,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:03,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362714834] [2022-12-13 05:05:03,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362714834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:03,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:03,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:05:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422616546] [2022-12-13 05:05:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:03,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:05:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:03,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:05:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:05:03,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:05:03,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 785 transitions, 82238 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 05:05:03,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:03,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:05:03,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:04,503 INFO L130 PetriNetUnfolder]: 1140/1885 cut-off events. [2022-12-13 05:05:04,503 INFO L131 PetriNetUnfolder]: For 249/249 co-relation queries the response was YES. [2022-12-13 05:05:04,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100361 conditions, 1885 events. 1140/1885 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9464 event pairs, 15 based on Foata normal form. 1/1565 useless extension candidates. Maximal degree in co-relation 39696. Up to 1886 conditions per place. [2022-12-13 05:05:04,530 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 699 selfloop transitions, 81 changer transitions 21/801 dead transitions. [2022-12-13 05:05:04,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 801 transitions, 85525 flow [2022-12-13 05:05:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:05:04,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2022-12-13 05:05:04,532 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 205 predicate places. [2022-12-13 05:05:04,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 801 transitions, 85525 flow [2022-12-13 05:05:04,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 780 transitions, 83273 flow [2022-12-13 05:05:04,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:04,608 INFO L89 Accepts]: Start accepts. Operand has 232 places, 780 transitions, 83273 flow [2022-12-13 05:05:04,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:04,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:04,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 780 transitions, 83273 flow [2022-12-13 05:05:04,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 780 transitions, 83273 flow [2022-12-13 05:05:04,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:04,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:05:04,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [651] L51-5-->L104-3: Formula: (and (= (+ |v_#pthreadsForks_189| 1) |v_#pthreadsForks_188|) (= (store |v_#memory_int_335| |v_ULTIMATE.start_main_~#t3~0#1.base_117| (store (select |v_#memory_int_335| |v_ULTIMATE.start_main_~#t3~0#1.base_117|) |v_ULTIMATE.start_main_~#t3~0#1.offset_117| |v_ULTIMATE.start_main_#t~pre18#1_113|)) |v_#memory_int_334|) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_61| 4294967296) (mod v_~A~0_139 4294967296))) (= (+ v_~end~0_325 1) v_~end~0_324) (= |v_thread1Thread1of1ForFork2_#res#1.offset_45| 0) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_65| 4294967296) (mod (select (select |v_#memory_int_335| v_~queue~0.base_185) (+ (* v_~end~0_325 4) v_~queue~0.offset_185)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (not (= (ite (and (<= 0 v_~end~0_325) (< v_~end~0_325 v_~n~0_189)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_main_#t~pre18#1_113| |v_#pthreadsForks_189|) (= |v_thread1Thread1of1ForFork2_#res#1.base_45| 0)) InVars {~queue~0.offset=v_~queue~0.offset_185, ~A~0=v_~A~0_139, #pthreadsForks=|v_#pthreadsForks_189|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_65|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_61|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_117|, #memory_int=|v_#memory_int_335|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_117|, ~end~0=v_~end~0_325, ~queue~0.base=v_~queue~0.base_185, ~n~0=v_~n~0_189} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_113|, ~queue~0.offset=v_~queue~0.offset_185, ~A~0=v_~A~0_139, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_65|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_117|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_47|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_117|, ~queue~0.base=v_~queue~0.base_185, #pthreadsForks=|v_#pthreadsForks_188|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_47|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_61|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|, #memory_int=|v_#memory_int_334|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_111|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_45|, ~end~0=v_~end~0_324, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_101|, ~n~0=v_~n~0_189, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_45|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-13 05:05:05,164 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:05:05,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 557 [2022-12-13 05:05:05,164 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 779 transitions, 83171 flow [2022-12-13 05:05:05,164 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 05:05:05,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:05,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:05:05,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 05:05:05,165 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 05:05:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash -114701160, now seen corresponding path program 1 times [2022-12-13 05:05:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:05,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464638033] [2022-12-13 05:05:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:06,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:06,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464638033] [2022-12-13 05:05:06,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464638033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:06,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:06,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:05:06,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893236849] [2022-12-13 05:05:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:06,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:05:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:06,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:05:06,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:05:06,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:05:06,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 779 transitions, 83171 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:05:06,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:06,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:05:06,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:07,849 INFO L130 PetriNetUnfolder]: 1134/1866 cut-off events. [2022-12-13 05:05:07,849 INFO L131 PetriNetUnfolder]: For 247/247 co-relation queries the response was YES. [2022-12-13 05:05:07,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101219 conditions, 1866 events. 1134/1866 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9289 event pairs, 16 based on Foata normal form. 1/1554 useless extension candidates. Maximal degree in co-relation 40067. Up to 1867 conditions per place. [2022-12-13 05:05:07,878 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 667 selfloop transitions, 111 changer transitions 14/792 dead transitions. [2022-12-13 05:05:07,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 792 transitions, 86151 flow [2022-12-13 05:05:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:05:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:05:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-12-13 05:05:07,879 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3520408163265306 [2022-12-13 05:05:07,880 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 208 predicate places. [2022-12-13 05:05:07,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 792 transitions, 86151 flow [2022-12-13 05:05:08,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 778 transitions, 84617 flow [2022-12-13 05:05:08,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:08,101 INFO L89 Accepts]: Start accepts. Operand has 235 places, 778 transitions, 84617 flow [2022-12-13 05:05:08,118 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:08,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:08,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 778 transitions, 84617 flow [2022-12-13 05:05:08,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 778 transitions, 84617 flow [2022-12-13 05:05:08,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:08,144 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:05:08,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 05:05:08,144 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 778 transitions, 84617 flow [2022-12-13 05:05:08,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:05:08,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:08,145 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 05:05:08,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 05:05:08,145 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 05:05:08,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash -548215379, now seen corresponding path program 1 times [2022-12-13 05:05:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:08,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814486137] [2022-12-13 05:05:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:08,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:11,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:11,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814486137] [2022-12-13 05:05:11,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814486137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:11,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:11,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:05:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243686283] [2022-12-13 05:05:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:11,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:05:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:11,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:05:11,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:05:11,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:05:11,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 778 transitions, 84617 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 05:05:11,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:11,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:05:11,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:13,709 INFO L130 PetriNetUnfolder]: 1133/1865 cut-off events. [2022-12-13 05:05:13,710 INFO L131 PetriNetUnfolder]: For 247/247 co-relation queries the response was YES. [2022-12-13 05:05:13,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103029 conditions, 1865 events. 1133/1865 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9278 event pairs, 16 based on Foata normal form. 1/1553 useless extension candidates. Maximal degree in co-relation 40751. Up to 1866 conditions per place. [2022-12-13 05:05:13,737 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 661 selfloop transitions, 113 changer transitions 17/791 dead transitions. [2022-12-13 05:05:13,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 791 transitions, 87621 flow [2022-12-13 05:05:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-13 05:05:13,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2022-12-13 05:05:13,739 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 213 predicate places. [2022-12-13 05:05:13,739 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 791 transitions, 87621 flow [2022-12-13 05:05:13,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 774 transitions, 85728 flow [2022-12-13 05:05:13,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:13,811 INFO L89 Accepts]: Start accepts. Operand has 239 places, 774 transitions, 85728 flow [2022-12-13 05:05:13,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:13,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:13,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 774 transitions, 85728 flow [2022-12-13 05:05:13,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 774 transitions, 85728 flow [2022-12-13 05:05:13,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:13,861 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:05:13,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 05:05:13,863 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 774 transitions, 85728 flow [2022-12-13 05:05:13,863 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 05:05:13,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:13,863 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 05:05:13,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 05:05:13,864 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 05:05:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:13,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1769945964, now seen corresponding path program 4 times [2022-12-13 05:05:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:13,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016878249] [2022-12-13 05:05:13,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:17,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016878249] [2022-12-13 05:05:17,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016878249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:17,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:17,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:05:17,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992101635] [2022-12-13 05:05:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:17,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:05:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:17,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:05:17,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:05:17,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:05:17,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 774 transitions, 85728 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:05:17,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:17,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:05:17,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:18,630 INFO L130 PetriNetUnfolder]: 1139/1881 cut-off events. [2022-12-13 05:05:18,630 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-12-13 05:05:18,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105794 conditions, 1881 events. 1139/1881 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9439 event pairs, 15 based on Foata normal form. 1/1569 useless extension candidates. Maximal degree in co-relation 41938. Up to 1882 conditions per place. [2022-12-13 05:05:18,661 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 659 selfloop transitions, 124 changer transitions 17/800 dead transitions. [2022-12-13 05:05:18,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 800 transitions, 90215 flow [2022-12-13 05:05:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-12-13 05:05:18,662 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33653846153846156 [2022-12-13 05:05:18,662 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 217 predicate places. [2022-12-13 05:05:18,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 800 transitions, 90215 flow [2022-12-13 05:05:18,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 783 transitions, 88287 flow [2022-12-13 05:05:18,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:18,859 INFO L89 Accepts]: Start accepts. Operand has 245 places, 783 transitions, 88287 flow [2022-12-13 05:05:18,877 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:18,877 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:18,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 783 transitions, 88287 flow [2022-12-13 05:05:18,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 783 transitions, 88287 flow [2022-12-13 05:05:18,902 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:18,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:05:19,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:05:19,143 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:05:19,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 285 [2022-12-13 05:05:19,143 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 781 transitions, 88067 flow [2022-12-13 05:05:19,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:05:19,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:19,144 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 05:05:19,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 05:05:19,144 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 05:05:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash -331322036, now seen corresponding path program 5 times [2022-12-13 05:05:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:19,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604217262] [2022-12-13 05:05:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:19,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:22,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:22,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604217262] [2022-12-13 05:05:22,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604217262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:22,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:22,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:05:22,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446698247] [2022-12-13 05:05:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:22,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:05:22,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:05:22,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:05:22,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:05:22,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 781 transitions, 88067 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:05:22,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:22,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:05:22,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:24,050 INFO L130 PetriNetUnfolder]: 1142/1893 cut-off events. [2022-12-13 05:05:24,050 INFO L131 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2022-12-13 05:05:24,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108366 conditions, 1893 events. 1142/1893 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9559 event pairs, 15 based on Foata normal form. 1/1580 useless extension candidates. Maximal degree in co-relation 42918. Up to 1894 conditions per place. [2022-12-13 05:05:24,080 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 683 selfloop transitions, 96 changer transitions 29/808 dead transitions. [2022-12-13 05:05:24,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 808 transitions, 92740 flow [2022-12-13 05:05:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 05:05:24,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-13 05:05:24,082 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 221 predicate places. [2022-12-13 05:05:24,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 808 transitions, 92740 flow [2022-12-13 05:05:24,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 779 transitions, 89401 flow [2022-12-13 05:05:24,157 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:24,158 INFO L89 Accepts]: Start accepts. Operand has 247 places, 779 transitions, 89401 flow [2022-12-13 05:05:24,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:24,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:24,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 779 transitions, 89401 flow [2022-12-13 05:05:24,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 779 transitions, 89401 flow [2022-12-13 05:05:24,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:24,202 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:05:24,203 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 05:05:24,203 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 779 transitions, 89401 flow [2022-12-13 05:05:24,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:05:24,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:24,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:05:24,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 05:05:24,203 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 05:05:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash 548715285, now seen corresponding path program 1 times [2022-12-13 05:05:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:24,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162638949] [2022-12-13 05:05:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:25,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162638949] [2022-12-13 05:05:25,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162638949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:25,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:25,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:05:25,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496091822] [2022-12-13 05:05:25,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:25,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:05:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:25,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:05:25,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:05:25,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:05:25,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 779 transitions, 89401 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:05:25,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:25,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:05:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:26,225 INFO L130 PetriNetUnfolder]: 1137/1877 cut-off events. [2022-12-13 05:05:26,225 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-12-13 05:05:26,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109330 conditions, 1877 events. 1137/1877 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9421 event pairs, 14 based on Foata normal form. 1/1570 useless extension candidates. Maximal degree in co-relation 43088. Up to 1878 conditions per place. [2022-12-13 05:05:26,255 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 666 selfloop transitions, 121 changer transitions 14/801 dead transitions. [2022-12-13 05:05:26,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 801 transitions, 93538 flow [2022-12-13 05:05:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:05:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:05:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-13 05:05:26,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34183673469387754 [2022-12-13 05:05:26,256 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 224 predicate places. [2022-12-13 05:05:26,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 801 transitions, 93538 flow [2022-12-13 05:05:26,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 787 transitions, 91894 flow [2022-12-13 05:05:26,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:26,335 INFO L89 Accepts]: Start accepts. Operand has 251 places, 787 transitions, 91894 flow [2022-12-13 05:05:26,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:26,358 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:26,358 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 787 transitions, 91894 flow [2022-12-13 05:05:26,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 787 transitions, 91894 flow [2022-12-13 05:05:26,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:26,385 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:05:26,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 05:05:26,386 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 787 transitions, 91894 flow [2022-12-13 05:05:26,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:05:26,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:26,386 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 05:05:26,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 05:05:26,386 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 05:05:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:26,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1457142064, now seen corresponding path program 1 times [2022-12-13 05:05:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:26,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681288339] [2022-12-13 05:05:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:28,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:28,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681288339] [2022-12-13 05:05:28,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681288339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:28,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:28,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:05:28,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512536615] [2022-12-13 05:05:28,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:28,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:05:28,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:28,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:05:28,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:05:28,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:05:28,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 787 transitions, 91894 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 05:05:28,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:28,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:05:28,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:29,654 INFO L130 PetriNetUnfolder]: 1136/1876 cut-off events. [2022-12-13 05:05:29,654 INFO L131 PetriNetUnfolder]: For 257/257 co-relation queries the response was YES. [2022-12-13 05:05:29,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111148 conditions, 1876 events. 1136/1876 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9439 event pairs, 12 based on Foata normal form. 1/1570 useless extension candidates. Maximal degree in co-relation 43770. Up to 1877 conditions per place. [2022-12-13 05:05:29,684 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 661 selfloop transitions, 117 changer transitions 22/800 dead transitions. [2022-12-13 05:05:29,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 800 transitions, 95020 flow [2022-12-13 05:05:29,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-12-13 05:05:29,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2022-12-13 05:05:29,685 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 229 predicate places. [2022-12-13 05:05:29,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 800 transitions, 95020 flow [2022-12-13 05:05:29,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 778 transitions, 92398 flow [2022-12-13 05:05:29,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:29,762 INFO L89 Accepts]: Start accepts. Operand has 255 places, 778 transitions, 92398 flow [2022-12-13 05:05:29,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:29,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:29,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 778 transitions, 92398 flow [2022-12-13 05:05:29,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 778 transitions, 92398 flow [2022-12-13 05:05:29,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:29,814 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:05:29,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 05:05:29,814 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 778 transitions, 92398 flow [2022-12-13 05:05:29,815 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 05:05:29,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:29,815 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 05:05:29,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 05:05:29,815 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 05:05:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1628320396, now seen corresponding path program 6 times [2022-12-13 05:05:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:29,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559407803] [2022-12-13 05:05:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:32,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:32,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559407803] [2022-12-13 05:05:32,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559407803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:32,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:32,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:05:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35551703] [2022-12-13 05:05:32,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:05:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:32,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:05:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:05:32,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:05:32,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 778 transitions, 92398 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:05:32,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:32,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:05:32,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:34,521 INFO L130 PetriNetUnfolder]: 1130/1861 cut-off events. [2022-12-13 05:05:34,521 INFO L131 PetriNetUnfolder]: For 251/251 co-relation queries the response was YES. [2022-12-13 05:05:34,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112120 conditions, 1861 events. 1130/1861 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9245 event pairs, 14 based on Foata normal form. 1/1559 useless extension candidates. Maximal degree in co-relation 44210. Up to 1862 conditions per place. [2022-12-13 05:05:34,552 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 639 selfloop transitions, 136 changer transitions 17/792 dead transitions. [2022-12-13 05:05:34,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 792 transitions, 95652 flow [2022-12-13 05:05:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-12-13 05:05:34,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3557692307692308 [2022-12-13 05:05:34,554 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 233 predicate places. [2022-12-13 05:05:34,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 792 transitions, 95652 flow [2022-12-13 05:05:34,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 775 transitions, 93588 flow [2022-12-13 05:05:34,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:34,633 INFO L89 Accepts]: Start accepts. Operand has 261 places, 775 transitions, 93588 flow [2022-12-13 05:05:34,657 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:34,657 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:34,657 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 775 transitions, 93588 flow [2022-12-13 05:05:34,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 775 transitions, 93588 flow [2022-12-13 05:05:34,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:34,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:05:34,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [657] L67-5-->L104-3: Formula: (and (= v_~end~0_346 (+ v_~end~0_347 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_65| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_65| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_65|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_55| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_65| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_83| 4294967296) (mod (select (select |v_#memory_int_359| v_~queue~0.base_195) (+ (* v_~end~0_347 4) v_~queue~0.offset_195)) 4294967296)) 1 0)) (not (= (ite (and (< v_~end~0_347 v_~n~0_199) (<= 0 v_~end~0_347)) 1 0) 0)) (= (+ |v_#pthreadsForks_213| 1) |v_#pthreadsForks_212|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_85| 4294967296) (mod v_~A~0_149 4294967296))) (= (store |v_#memory_int_359| |v_ULTIMATE.start_main_~#t3~0#1.base_129| (store (select |v_#memory_int_359| |v_ULTIMATE.start_main_~#t3~0#1.base_129|) |v_ULTIMATE.start_main_~#t3~0#1.offset_129| |v_ULTIMATE.start_main_#t~pre18#1_125|)) |v_#memory_int_358|) (= |v_ULTIMATE.start_main_#t~pre18#1_125| |v_#pthreadsForks_213|) (= |v_thread2Thread1of1ForFork0_#res#1.base_55| 0)) InVars {~queue~0.offset=v_~queue~0.offset_195, ~A~0=v_~A~0_149, #pthreadsForks=|v_#pthreadsForks_213|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_129|, #memory_int=|v_#memory_int_359|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_129|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_85|, ~end~0=v_~end~0_347, ~queue~0.base=v_~queue~0.base_195, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_83|, ~n~0=v_~n~0_199} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_125|, ~queue~0.offset=v_~queue~0.offset_195, ~A~0=v_~A~0_149, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_129|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_55|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_65|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_129|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_85|, ~queue~0.base=v_~queue~0.base_195, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_65|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_55|, #pthreadsForks=|v_#pthreadsForks_212|, #memory_int=|v_#memory_int_358|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_123|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_65|, ~end~0=v_~end~0_346, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_113|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_83|, ~n~0=v_~n~0_199, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_65|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-13 05:05:35,052 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:05:35,163 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:05:35,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 530 [2022-12-13 05:05:35,163 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 773 transitions, 93354 flow [2022-12-13 05:05:35,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:05:35,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:35,164 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 05:05:35,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 05:05:35,164 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 05:05:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -712615240, now seen corresponding path program 7 times [2022-12-13 05:05:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:35,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435642489] [2022-12-13 05:05:35,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:35,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:36,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:36,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435642489] [2022-12-13 05:05:36,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435642489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:36,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:36,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:05:36,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734861445] [2022-12-13 05:05:36,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:36,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:05:36,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:36,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:05:36,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:05:36,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:05:36,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 773 transitions, 93354 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:05:36,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:36,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:05:36,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:37,833 INFO L130 PetriNetUnfolder]: 1123/1848 cut-off events. [2022-12-13 05:05:37,833 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-12-13 05:05:37,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113189 conditions, 1848 events. 1123/1848 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9161 event pairs, 17 based on Foata normal form. 1/1550 useless extension candidates. Maximal degree in co-relation 44766. Up to 1849 conditions per place. [2022-12-13 05:05:37,864 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 634 selfloop transitions, 138 changer transitions 15/787 dead transitions. [2022-12-13 05:05:37,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 787 transitions, 96626 flow [2022-12-13 05:05:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-13 05:05:37,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2022-12-13 05:05:37,865 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 235 predicate places. [2022-12-13 05:05:37,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 787 transitions, 96626 flow [2022-12-13 05:05:37,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 772 transitions, 94775 flow [2022-12-13 05:05:37,944 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:37,944 INFO L89 Accepts]: Start accepts. Operand has 263 places, 772 transitions, 94775 flow [2022-12-13 05:05:37,967 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:37,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:37,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 772 transitions, 94775 flow [2022-12-13 05:05:37,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 772 transitions, 94775 flow [2022-12-13 05:05:37,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:38,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-13 05:05:38,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:05:38,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_155 4294967296)) (.cse1 (select |v_#memory_int_370| v_~queue~0.base_201))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_59|) (= v_~end~0_360 (+ v_~end~0_362 2)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_89| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_59| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_57| 0) (not (= (ite (and (<= 0 v_~end~0_362) (< v_~end~0_362 v_~n~0_205)) 1 0) 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_75| 4294967296) .cse0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (mod (select .cse1 (+ (* v_~end~0_360 4) (- 4) v_~queue~0.offset_201)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_79| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_59|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69| (ite (= (mod (select .cse1 (+ (* v_~end~0_362 4) v_~queue~0.offset_201)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_87| 4294967296)) 1 0)) (not (= (ite (and (<= 1 v_~end~0_360) (< v_~end~0_360 (+ v_~n~0_205 1))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_59| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_57| 0))) InVars {~queue~0.offset=v_~queue~0.offset_201, ~A~0=v_~A~0_155, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_79|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_75|, #memory_int=|v_#memory_int_370|, ~end~0=v_~end~0_362, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_89|, ~queue~0.base=v_~queue~0.base_201, ~n~0=v_~n~0_205, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_87|} OutVars{~queue~0.offset=v_~queue~0.offset_201, ~A~0=v_~A~0_155, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_79|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_59|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_89|, ~queue~0.base=v_~queue~0.base_201, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_59|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_59|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_75|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_59|, #memory_int=|v_#memory_int_370|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_57|, ~end~0=v_~end~0_360, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_69|, ~n~0=v_~n~0_205, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_87|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_57|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_59|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_69|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:05:38,491 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:05:38,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 548 [2022-12-13 05:05:38,493 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 770 transitions, 94537 flow [2022-12-13 05:05:38,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:05:38,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:38,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:05:38,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 05:05:38,493 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 05:05:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:38,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2049142507, now seen corresponding path program 1 times [2022-12-13 05:05:38,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:38,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45010943] [2022-12-13 05:05:38,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:38,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:39,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:39,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45010943] [2022-12-13 05:05:39,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45010943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:39,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:39,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:05:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973701766] [2022-12-13 05:05:39,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:39,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 05:05:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 05:05:39,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 05:05:39,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 05:05:39,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 770 transitions, 94537 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:05:39,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:39,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 05:05:39,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:40,498 INFO L130 PetriNetUnfolder]: 1118/1838 cut-off events. [2022-12-13 05:05:40,498 INFO L131 PetriNetUnfolder]: For 251/251 co-relation queries the response was YES. [2022-12-13 05:05:40,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114419 conditions, 1838 events. 1118/1838 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9086 event pairs, 14 based on Foata normal form. 1/1543 useless extension candidates. Maximal degree in co-relation 45254. Up to 1839 conditions per place. [2022-12-13 05:05:40,541 INFO L137 encePairwiseOnDemand]: 12/30 looper letters, 635 selfloop transitions, 133 changer transitions 15/783 dead transitions. [2022-12-13 05:05:40,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 783 transitions, 97707 flow [2022-12-13 05:05:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:05:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:05:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-12-13 05:05:40,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3238095238095238 [2022-12-13 05:05:40,543 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 237 predicate places. [2022-12-13 05:05:40,543 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 783 transitions, 97707 flow [2022-12-13 05:05:40,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 264 places, 768 transitions, 95821 flow [2022-12-13 05:05:40,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:40,627 INFO L89 Accepts]: Start accepts. Operand has 264 places, 768 transitions, 95821 flow [2022-12-13 05:05:40,648 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:40,648 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:40,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 768 transitions, 95821 flow [2022-12-13 05:05:40,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 768 transitions, 95821 flow [2022-12-13 05:05:40,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:40,686 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:05:40,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 05:05:40,687 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 768 transitions, 95821 flow [2022-12-13 05:05:40,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:05:40,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:40,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:05:40,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 05:05:40,688 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 05:05:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1513116984, now seen corresponding path program 1 times [2022-12-13 05:05:40,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:40,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880805710] [2022-12-13 05:05:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:40,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:44,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:44,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880805710] [2022-12-13 05:05:44,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880805710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:44,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:44,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:05:44,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217846040] [2022-12-13 05:05:44,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:44,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:05:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:05:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:05:44,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:05:44,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 768 transitions, 95821 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 05:05:44,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:44,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:05:44,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:45,609 INFO L130 PetriNetUnfolder]: 1116/1836 cut-off events. [2022-12-13 05:05:45,610 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-12-13 05:05:45,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116128 conditions, 1836 events. 1116/1836 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9110 event pairs, 14 based on Foata normal form. 1/1542 useless extension candidates. Maximal degree in co-relation 45853. Up to 1837 conditions per place. [2022-12-13 05:05:45,641 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 633 selfloop transitions, 131 changer transitions 17/781 dead transitions. [2022-12-13 05:05:45,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 781 transitions, 99013 flow [2022-12-13 05:05:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-12-13 05:05:45,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-13 05:05:45,643 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 242 predicate places. [2022-12-13 05:05:45,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 781 transitions, 99013 flow [2022-12-13 05:05:45,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 764 transitions, 96848 flow [2022-12-13 05:05:45,722 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:45,723 INFO L89 Accepts]: Start accepts. Operand has 267 places, 764 transitions, 96848 flow [2022-12-13 05:05:45,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:45,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:45,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 764 transitions, 96848 flow [2022-12-13 05:05:45,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 764 transitions, 96848 flow [2022-12-13 05:05:45,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:45,772 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:05:45,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 05:05:45,772 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 764 transitions, 96848 flow [2022-12-13 05:05:45,772 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 05:05:45,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:45,772 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 05:05:45,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 05:05:45,773 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 05:05:45,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:45,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1845138948, now seen corresponding path program 1 times [2022-12-13 05:05:45,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:45,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736890064] [2022-12-13 05:05:45,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:45,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:47,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 05:05:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:47,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736890064] [2022-12-13 05:05:47,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736890064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:47,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:47,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:05:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926554925] [2022-12-13 05:05:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:47,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:05:47,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:47,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:05:47,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:05:47,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:05:47,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 764 transitions, 96848 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 05:05:47,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:47,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:05:47,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:48,284 INFO L130 PetriNetUnfolder]: 1113/1830 cut-off events. [2022-12-13 05:05:48,284 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-12-13 05:05:48,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117578 conditions, 1830 events. 1113/1830 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9041 event pairs, 16 based on Foata normal form. 1/1536 useless extension candidates. Maximal degree in co-relation 46451. Up to 1831 conditions per place. [2022-12-13 05:05:48,316 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 629 selfloop transitions, 129 changer transitions 19/777 dead transitions. [2022-12-13 05:05:48,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 777 transitions, 100058 flow [2022-12-13 05:05:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:05:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:05:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-12-13 05:05:48,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2022-12-13 05:05:48,318 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 245 predicate places. [2022-12-13 05:05:48,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 777 transitions, 100058 flow [2022-12-13 05:05:48,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 758 transitions, 97600 flow [2022-12-13 05:05:48,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:48,399 INFO L89 Accepts]: Start accepts. Operand has 267 places, 758 transitions, 97600 flow [2022-12-13 05:05:48,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:48,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:48,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 758 transitions, 97600 flow [2022-12-13 05:05:48,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 758 transitions, 97600 flow [2022-12-13 05:05:48,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:48,454 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:05:48,455 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 05:05:48,455 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 758 transitions, 97600 flow [2022-12-13 05:05:48,455 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 05:05:48,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:05:48,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:05:48,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 05:05:48,455 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 05:05:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:05:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash 795529114, now seen corresponding path program 1 times [2022-12-13 05:05:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:05:48,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286299588] [2022-12-13 05:05:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:05:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:05:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:05:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:05:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:05:53,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286299588] [2022-12-13 05:05:53,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286299588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:05:53,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:05:53,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 05:05:53,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056567408] [2022-12-13 05:05:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:05:53,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 05:05:53,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:05:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 05:05:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 05:05:53,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:05:53,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 758 transitions, 97600 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:05:53,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:05:53,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:05:53,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:05:56,247 INFO L130 PetriNetUnfolder]: 1290/2089 cut-off events. [2022-12-13 05:05:56,247 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2022-12-13 05:05:56,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136288 conditions, 2089 events. 1290/2089 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10391 event pairs, 17 based on Foata normal form. 1/1730 useless extension candidates. Maximal degree in co-relation 55440. Up to 2090 conditions per place. [2022-12-13 05:05:56,285 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 732 selfloop transitions, 124 changer transitions 21/877 dead transitions. [2022-12-13 05:05:56,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 877 transitions, 114676 flow [2022-12-13 05:05:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 05:05:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 05:05:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2022-12-13 05:05:56,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3531468531468531 [2022-12-13 05:05:56,286 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 248 predicate places. [2022-12-13 05:05:56,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 877 transitions, 114676 flow [2022-12-13 05:05:56,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 856 transitions, 111916 flow [2022-12-13 05:05:56,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:05:56,390 INFO L89 Accepts]: Start accepts. Operand has 276 places, 856 transitions, 111916 flow [2022-12-13 05:05:56,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:05:56,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:05:56,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 856 transitions, 111916 flow [2022-12-13 05:05:56,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 856 transitions, 111916 flow [2022-12-13 05:05:56,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:05:56,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:05:56,572 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [663] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_65| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_75| 0)) (= v_~end~0_374 (+ v_~end~0_375 1)) (= |v_thread2Thread1of1ForFork0_#res#1.base_65| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_93| 4294967296) (mod (select (select |v_#memory_int_380| v_~queue~0.base_207) (+ (* v_~end~0_375 4) v_~queue~0.offset_207)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= |v_thread2Thread1of1ForFork0_~x~1#1_93| 0) (= |v_thread2Thread1of1ForFork0_~i~1#1_95| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_95| 4294967296) (mod v_~A~0_161 4294967296))) (not (= (ite (and (< v_~end~0_375 v_~n~0_211) (<= 0 v_~end~0_375)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_207, ~A~0=v_~A~0_161, #memory_int=|v_#memory_int_380|, ~end~0=v_~end~0_375, ~queue~0.base=v_~queue~0.base_207, ~n~0=v_~n~0_211} OutVars{~queue~0.offset=v_~queue~0.offset_207, ~A~0=v_~A~0_161, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_65|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_95|, ~queue~0.base=v_~queue~0.base_207, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_75|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_65|, #memory_int=|v_#memory_int_380|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_75|, ~end~0=v_~end~0_374, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_93|, ~n~0=v_~n~0_211, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_75|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:06:02,145 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 05:06:02,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5756 [2022-12-13 05:06:02,146 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 853 transitions, 111530 flow [2022-12-13 05:06:02,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 05:06:02,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:02,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:06:02,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 05:06:02,146 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 05:06:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash -547472862, now seen corresponding path program 1 times [2022-12-13 05:06:02,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:02,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35252681] [2022-12-13 05:06:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:06:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:06:04,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:06:04,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35252681] [2022-12-13 05:06:04,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35252681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:06:04,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:06:04,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:06:04,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57366581] [2022-12-13 05:06:04,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:06:04,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:06:04,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:06:04,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:06:04,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:06:04,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 05:06:04,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 853 transitions, 111530 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:06:04,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:06:04,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 05:06:04,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:06:05,479 INFO L130 PetriNetUnfolder]: 1295/2104 cut-off events. [2022-12-13 05:06:05,479 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-13 05:06:05,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139376 conditions, 2104 events. 1295/2104 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10584 event pairs, 14 based on Foata normal form. 1/1744 useless extension candidates. Maximal degree in co-relation 56228. Up to 2105 conditions per place. [2022-12-13 05:06:05,518 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 754 selfloop transitions, 118 changer transitions 14/886 dead transitions. [2022-12-13 05:06:05,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 886 transitions, 117634 flow [2022-12-13 05:06:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:06:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:06:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-13 05:06:05,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3645320197044335 [2022-12-13 05:06:05,519 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 250 predicate places. [2022-12-13 05:06:05,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 886 transitions, 117634 flow [2022-12-13 05:06:05,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 277 places, 872 transitions, 115766 flow [2022-12-13 05:06:05,616 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:06:05,616 INFO L89 Accepts]: Start accepts. Operand has 277 places, 872 transitions, 115766 flow [2022-12-13 05:06:05,644 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:06:05,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:06:05,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 277 places, 872 transitions, 115766 flow [2022-12-13 05:06:05,675 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 277 places, 872 transitions, 115766 flow [2022-12-13 05:06:05,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:06:05,677 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:06:05,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 05:06:05,678 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 872 transitions, 115766 flow [2022-12-13 05:06:05,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:06:05,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:05,678 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 05:06:05,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 05:06:05,678 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 05:06:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash 451193109, now seen corresponding path program 1 times [2022-12-13 05:06:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:05,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646955325] [2022-12-13 05:06:05,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:05,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:06:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:06:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:06:08,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646955325] [2022-12-13 05:06:08,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646955325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:06:08,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:06:08,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:06:08,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325277211] [2022-12-13 05:06:08,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:06:08,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:06:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:06:08,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:06:08,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:06:08,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:06:08,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 872 transitions, 115766 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 05:06:08,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:06:08,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:06:08,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:06:10,760 INFO L130 PetriNetUnfolder]: 1294/2103 cut-off events. [2022-12-13 05:06:10,760 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-12-13 05:06:10,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141413 conditions, 2103 events. 1294/2103 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10532 event pairs, 14 based on Foata normal form. 1/1744 useless extension candidates. Maximal degree in co-relation 57011. Up to 2104 conditions per place. [2022-12-13 05:06:10,799 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 769 selfloop transitions, 90 changer transitions 26/885 dead transitions. [2022-12-13 05:06:10,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 885 transitions, 119270 flow [2022-12-13 05:06:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:06:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:06:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:06:10,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2022-12-13 05:06:10,800 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 255 predicate places. [2022-12-13 05:06:10,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 885 transitions, 119270 flow [2022-12-13 05:06:10,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 859 transitions, 115751 flow [2022-12-13 05:06:10,895 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:06:10,895 INFO L89 Accepts]: Start accepts. Operand has 281 places, 859 transitions, 115751 flow [2022-12-13 05:06:10,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:06:10,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:06:10,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 859 transitions, 115751 flow [2022-12-13 05:06:10,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 859 transitions, 115751 flow [2022-12-13 05:06:10,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:06:10,966 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:06:10,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 05:06:10,967 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 859 transitions, 115751 flow [2022-12-13 05:06:10,967 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 05:06:10,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:10,967 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 05:06:10,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 05:06:10,967 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 05:06:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash 264237357, now seen corresponding path program 1 times [2022-12-13 05:06:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:10,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911372249] [2022-12-13 05:06:10,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:06:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:06:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:06:11,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911372249] [2022-12-13 05:06:11,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911372249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:06:11,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:06:11,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:06:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645626265] [2022-12-13 05:06:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:06:11,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:06:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:06:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:06:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:06:11,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 05:06:11,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 859 transitions, 115751 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 05:06:11,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:06:11,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 05:06:11,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:06:13,508 INFO L130 PetriNetUnfolder]: 1458/2338 cut-off events. [2022-12-13 05:06:13,508 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-13 05:06:13,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159536 conditions, 2338 events. 1458/2338 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11758 event pairs, 14 based on Foata normal form. 1/1925 useless extension candidates. Maximal degree in co-relation 65142. Up to 2339 conditions per place. [2022-12-13 05:06:13,553 INFO L137 encePairwiseOnDemand]: 11/27 looper letters, 777 selfloop transitions, 184 changer transitions 22/983 dead transitions. [2022-12-13 05:06:13,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 983 transitions, 134426 flow [2022-12-13 05:06:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:06:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:06:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 05:06:13,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35648148148148145 [2022-12-13 05:06:13,554 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 259 predicate places. [2022-12-13 05:06:13,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 288 places, 983 transitions, 134426 flow [2022-12-13 05:06:13,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 287 places, 961 transitions, 131404 flow [2022-12-13 05:06:13,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:06:13,828 INFO L89 Accepts]: Start accepts. Operand has 287 places, 961 transitions, 131404 flow [2022-12-13 05:06:13,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:06:13,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:06:13,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 961 transitions, 131404 flow [2022-12-13 05:06:13,901 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 287 places, 961 transitions, 131404 flow [2022-12-13 05:06:13,901 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:06:13,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:06:14,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:06:14,132 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:06:14,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 304 [2022-12-13 05:06:14,132 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 960 transitions, 131272 flow [2022-12-13 05:06:14,132 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 05:06:14,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:14,132 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 05:06:14,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 05:06:14,132 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 05:06:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1179942513, now seen corresponding path program 2 times [2022-12-13 05:06:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:14,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358728755] [2022-12-13 05:06:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:06:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:06:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:06:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358728755] [2022-12-13 05:06:17,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358728755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:06:17,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:06:17,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:06:17,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417951448] [2022-12-13 05:06:17,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:06:17,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:06:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:06:17,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:06:17,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:06:17,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 05:06:17,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 960 transitions, 131272 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:06:17,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:06:17,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 05:06:17,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:06:19,213 INFO L130 PetriNetUnfolder]: 1445/2329 cut-off events. [2022-12-13 05:06:19,213 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-13 05:06:19,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161254 conditions, 2329 events. 1445/2329 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11808 event pairs, 17 based on Foata normal form. 1/1921 useless extension candidates. Maximal degree in co-relation 66170. Up to 2330 conditions per place. [2022-12-13 05:06:19,256 INFO L137 encePairwiseOnDemand]: 13/29 looper letters, 799 selfloop transitions, 166 changer transitions 17/982 dead transitions. [2022-12-13 05:06:19,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 982 transitions, 136252 flow [2022-12-13 05:06:19,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:06:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:06:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 05:06:19,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34913793103448276 [2022-12-13 05:06:19,257 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 264 predicate places. [2022-12-13 05:06:19,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 293 places, 982 transitions, 136252 flow [2022-12-13 05:06:19,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 965 transitions, 133882 flow [2022-12-13 05:06:19,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:06:19,380 INFO L89 Accepts]: Start accepts. Operand has 292 places, 965 transitions, 133882 flow [2022-12-13 05:06:19,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:06:19,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:06:19,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 292 places, 965 transitions, 133882 flow [2022-12-13 05:06:19,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 292 places, 965 transitions, 133882 flow [2022-12-13 05:06:19,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:06:19,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:06:19,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:06:19,680 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:06:19,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 300 [2022-12-13 05:06:19,680 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 964 transitions, 133748 flow [2022-12-13 05:06:19,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:06:19,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:19,681 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 05:06:19,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 05:06:19,681 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 05:06:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash -4861833, now seen corresponding path program 1 times [2022-12-13 05:06:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:19,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802293233] [2022-12-13 05:06:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:06:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:06:22,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:06:22,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802293233] [2022-12-13 05:06:22,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802293233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:06:22,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:06:22,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:06:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978614938] [2022-12-13 05:06:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:06:22,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:06:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:06:22,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:06:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:06:22,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:06:22,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 964 transitions, 133748 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 05:06:22,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:06:22,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:06:22,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:06:24,425 INFO L130 PetriNetUnfolder]: 1437/2324 cut-off events. [2022-12-13 05:06:24,425 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-13 05:06:24,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163234 conditions, 2324 events. 1437/2324 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11857 event pairs, 17 based on Foata normal form. 1/1916 useless extension candidates. Maximal degree in co-relation 67060. Up to 2325 conditions per place. [2022-12-13 05:06:24,470 INFO L137 encePairwiseOnDemand]: 14/31 looper letters, 797 selfloop transitions, 158 changer transitions 26/981 dead transitions. [2022-12-13 05:06:24,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 981 transitions, 138077 flow [2022-12-13 05:06:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:06:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:06:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-13 05:06:24,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2022-12-13 05:06:24,472 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 269 predicate places. [2022-12-13 05:06:24,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 981 transitions, 138077 flow [2022-12-13 05:06:24,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 955 transitions, 134405 flow [2022-12-13 05:06:24,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:06:24,586 INFO L89 Accepts]: Start accepts. Operand has 297 places, 955 transitions, 134405 flow [2022-12-13 05:06:24,619 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:06:24,619 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:06:24,619 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 955 transitions, 134405 flow [2022-12-13 05:06:24,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 955 transitions, 134405 flow [2022-12-13 05:06:24,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:06:24,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:06:24,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:06:24,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-13 05:06:24,767 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 954 transitions, 134267 flow [2022-12-13 05:06:24,767 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 05:06:24,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:24,768 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 05:06:24,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 05:06:24,768 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 05:06:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash 499689240, now seen corresponding path program 1 times [2022-12-13 05:06:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:24,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084272610] [2022-12-13 05:06:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:06:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:06:29,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:06:29,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084272610] [2022-12-13 05:06:29,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084272610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:06:29,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:06:29,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:06:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553740893] [2022-12-13 05:06:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:06:29,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:06:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:06:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:06:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:06:29,353 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:06:29,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 954 transitions, 134267 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 05:06:29,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:06:29,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:06:29,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:06:31,336 INFO L130 PetriNetUnfolder]: 1423/2298 cut-off events. [2022-12-13 05:06:31,337 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2022-12-13 05:06:31,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163707 conditions, 2298 events. 1423/2298 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11668 event pairs, 15 based on Foata normal form. 1/1894 useless extension candidates. Maximal degree in co-relation 67449. Up to 2299 conditions per place. [2022-12-13 05:06:31,378 INFO L137 encePairwiseOnDemand]: 14/31 looper letters, 790 selfloop transitions, 155 changer transitions 22/967 dead transitions. [2022-12-13 05:06:31,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 967 transitions, 138039 flow [2022-12-13 05:06:31,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:06:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:06:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-13 05:06:31,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2022-12-13 05:06:31,379 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 274 predicate places. [2022-12-13 05:06:31,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 303 places, 967 transitions, 138039 flow [2022-12-13 05:06:31,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 945 transitions, 134890 flow [2022-12-13 05:06:31,485 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:06:31,486 INFO L89 Accepts]: Start accepts. Operand has 301 places, 945 transitions, 134890 flow [2022-12-13 05:06:31,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:06:31,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:06:31,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 945 transitions, 134890 flow [2022-12-13 05:06:31,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 301 places, 945 transitions, 134890 flow [2022-12-13 05:06:31,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:06:31,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [672] L67-5-->L104-3: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_73| 0) (= v_~end~0_402 (+ v_~end~0_403 1)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_105| 4294967296) (mod v_~A~0_177 4294967296))) (= (store |v_#memory_int_419| |v_ULTIMATE.start_main_~#t3~0#1.base_155| (store (select |v_#memory_int_419| |v_ULTIMATE.start_main_~#t3~0#1.base_155|) |v_ULTIMATE.start_main_~#t3~0#1.offset_155| |v_ULTIMATE.start_main_#t~pre18#1_151|)) |v_#memory_int_418|) (= (+ |v_#pthreadsForks_261| 1) |v_#pthreadsForks_260|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= |v_ULTIMATE.start_main_#t~pre18#1_151| |v_#pthreadsForks_261|) (not (= (ite (and (<= 0 v_~end~0_403) (< v_~end~0_403 v_~n~0_227)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83| (ite (= (mod (select (select |v_#memory_int_419| v_~queue~0.base_225) (+ (* v_~end~0_403 4) v_~queue~0.offset_225)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_103| 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_73| 0)) InVars {~queue~0.offset=v_~queue~0.offset_225, ~A~0=v_~A~0_177, #pthreadsForks=|v_#pthreadsForks_261|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_155|, #memory_int=|v_#memory_int_419|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_155|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_105|, ~end~0=v_~end~0_403, ~queue~0.base=v_~queue~0.base_225, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_103|, ~n~0=v_~n~0_227} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_151|, ~queue~0.offset=v_~queue~0.offset_225, ~A~0=v_~A~0_177, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_155|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_73|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_155|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_105|, ~queue~0.base=v_~queue~0.base_225, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_73|, #pthreadsForks=|v_#pthreadsForks_260|, #memory_int=|v_#memory_int_418|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_149|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_83|, ~end~0=v_~end~0_402, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_139|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_103|, ~n~0=v_~n~0_227, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-13 05:06:31,800 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:06:31,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 316 [2022-12-13 05:06:31,801 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 944 transitions, 134750 flow [2022-12-13 05:06:31,801 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 05:06:31,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:31,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:06:31,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 05:06:31,801 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 05:06:31,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1630795761, now seen corresponding path program 1 times [2022-12-13 05:06:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:31,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243174068] [2022-12-13 05:06:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:06:34,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 05:06:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:06:34,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243174068] [2022-12-13 05:06:34,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243174068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:06:34,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:06:34,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:06:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829073211] [2022-12-13 05:06:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:06:34,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:06:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:06:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:06:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:06:34,177 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 05:06:34,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 944 transitions, 134750 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:06:34,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:06:34,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 05:06:34,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:06:35,703 INFO L130 PetriNetUnfolder]: 1417/2277 cut-off events. [2022-12-13 05:06:35,704 INFO L131 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-12-13 05:06:35,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164491 conditions, 2277 events. 1417/2277 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11425 event pairs, 17 based on Foata normal form. 1/1885 useless extension candidates. Maximal degree in co-relation 67605. Up to 2278 conditions per place. [2022-12-13 05:06:35,748 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 793 selfloop transitions, 150 changer transitions 14/957 dead transitions. [2022-12-13 05:06:35,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 957 transitions, 138528 flow [2022-12-13 05:06:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:06:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:06:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 05:06:35,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 05:06:35,749 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 277 predicate places. [2022-12-13 05:06:35,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 306 places, 957 transitions, 138528 flow [2022-12-13 05:06:35,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 304 places, 943 transitions, 136490 flow [2022-12-13 05:06:35,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:06:35,870 INFO L89 Accepts]: Start accepts. Operand has 304 places, 943 transitions, 136490 flow [2022-12-13 05:06:35,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:06:35,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:06:35,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 943 transitions, 136490 flow [2022-12-13 05:06:35,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 943 transitions, 136490 flow [2022-12-13 05:06:35,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:06:35,953 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:06:35,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 05:06:35,953 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 943 transitions, 136490 flow [2022-12-13 05:06:35,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:06:35,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:35,954 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 05:06:35,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 05:06:35,954 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 05:06:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:35,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1301521248, now seen corresponding path program 1 times [2022-12-13 05:06:35,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:35,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570616340] [2022-12-13 05:06:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:06:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:06:42,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:06:42,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570616340] [2022-12-13 05:06:42,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570616340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:06:42,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:06:42,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:06:42,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286517979] [2022-12-13 05:06:42,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:06:42,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:06:42,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:06:42,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:06:42,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:06:42,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 05:06:42,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 943 transitions, 136490 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:06:42,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:06:42,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 05:06:42,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:06:46,191 INFO L130 PetriNetUnfolder]: 1637/2592 cut-off events. [2022-12-13 05:06:46,192 INFO L131 PetriNetUnfolder]: For 289/289 co-relation queries the response was YES. [2022-12-13 05:06:46,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189814 conditions, 2592 events. 1637/2592 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13045 event pairs, 15 based on Foata normal form. 1/2112 useless extension candidates. Maximal degree in co-relation 79867. Up to 2593 conditions per place. [2022-12-13 05:06:46,240 INFO L137 encePairwiseOnDemand]: 12/28 looper letters, 931 selfloop transitions, 126 changer transitions 21/1078 dead transitions. [2022-12-13 05:06:46,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1078 transitions, 158178 flow [2022-12-13 05:06:46,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 05:06:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 05:06:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-12-13 05:06:46,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3244047619047619 [2022-12-13 05:06:46,242 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 286 predicate places. [2022-12-13 05:06:46,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 1078 transitions, 158178 flow [2022-12-13 05:06:46,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 314 places, 1057 transitions, 155086 flow [2022-12-13 05:06:46,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:06:46,367 INFO L89 Accepts]: Start accepts. Operand has 314 places, 1057 transitions, 155086 flow [2022-12-13 05:06:46,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:06:46,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:06:46,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 1057 transitions, 155086 flow [2022-12-13 05:06:46,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 1057 transitions, 155086 flow [2022-12-13 05:06:46,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:06:50,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:06:50,859 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:06:50,860 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4493 [2022-12-13 05:06:50,860 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 1055 transitions, 154796 flow [2022-12-13 05:06:50,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:06:50,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:50,860 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 05:06:50,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-13 05:06:50,860 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 05:06:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1233628897, now seen corresponding path program 3 times [2022-12-13 05:06:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:50,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141491357] [2022-12-13 05:06:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:06:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:06:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:06:54,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141491357] [2022-12-13 05:06:54,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141491357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:06:54,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:06:54,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:06:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143082404] [2022-12-13 05:06:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:06:54,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:06:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:06:54,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:06:54,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:06:54,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 05:06:54,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1055 transitions, 154796 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:06:54,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:06:54,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 05:06:54,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:06:56,824 INFO L130 PetriNetUnfolder]: 1638/2601 cut-off events. [2022-12-13 05:06:56,824 INFO L131 PetriNetUnfolder]: For 285/285 co-relation queries the response was YES. [2022-12-13 05:06:56,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193078 conditions, 2601 events. 1638/2601 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 13322 event pairs, 18 based on Foata normal form. 1/2125 useless extension candidates. Maximal degree in co-relation 81182. Up to 2602 conditions per place. [2022-12-13 05:06:56,877 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 875 selfloop transitions, 192 changer transitions 17/1084 dead transitions. [2022-12-13 05:06:56,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 1084 transitions, 161228 flow [2022-12-13 05:06:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:06:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:06:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-12-13 05:06:56,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30833333333333335 [2022-12-13 05:06:56,878 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 290 predicate places. [2022-12-13 05:06:56,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 319 places, 1084 transitions, 161228 flow [2022-12-13 05:06:56,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 1067 transitions, 158688 flow [2022-12-13 05:06:57,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:06:57,014 INFO L89 Accepts]: Start accepts. Operand has 318 places, 1067 transitions, 158688 flow [2022-12-13 05:06:57,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:06:57,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:06:57,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 318 places, 1067 transitions, 158688 flow [2022-12-13 05:06:57,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 1067 transitions, 158688 flow [2022-12-13 05:06:57,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:06:57,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:06:57,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:06:57,340 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:06:57,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 327 [2022-12-13 05:06:57,341 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 1065 transitions, 158396 flow [2022-12-13 05:06:57,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:06:57,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:06:57,341 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 05:06:57,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 05:06:57,341 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 05:06:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:06:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash 31383192, now seen corresponding path program 1 times [2022-12-13 05:06:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:06:57,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389981197] [2022-12-13 05:06:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:06:57,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:06:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:07:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:07:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:07:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389981197] [2022-12-13 05:07:04,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389981197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:07:04,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:07:04,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:07:04,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538186340] [2022-12-13 05:07:04,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:07:04,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:07:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:07:04,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:07:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:07:04,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 05:07:04,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 1065 transitions, 158396 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 05:07:04,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:07:04,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 05:07:04,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:07:06,511 INFO L130 PetriNetUnfolder]: 1631/2589 cut-off events. [2022-12-13 05:07:06,512 INFO L131 PetriNetUnfolder]: For 277/277 co-relation queries the response was YES. [2022-12-13 05:07:06,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194778 conditions, 2589 events. 1631/2589 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13204 event pairs, 18 based on Foata normal form. 1/2112 useless extension candidates. Maximal degree in co-relation 81980. Up to 2590 conditions per place. [2022-12-13 05:07:06,563 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 997 selfloop transitions, 66 changer transitions 15/1078 dead transitions. [2022-12-13 05:07:06,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 1078 transitions, 162494 flow [2022-12-13 05:07:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:07:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:07:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-12-13 05:07:06,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30859375 [2022-12-13 05:07:06,565 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 294 predicate places. [2022-12-13 05:07:06,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 323 places, 1078 transitions, 162494 flow [2022-12-13 05:07:06,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 1063 transitions, 160224 flow [2022-12-13 05:07:06,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:07:06,708 INFO L89 Accepts]: Start accepts. Operand has 321 places, 1063 transitions, 160224 flow [2022-12-13 05:07:06,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:07:06,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:07:06,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 321 places, 1063 transitions, 160224 flow [2022-12-13 05:07:06,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 321 places, 1063 transitions, 160224 flow [2022-12-13 05:07:06,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:07:06,789 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:07:06,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 05:07:06,790 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 1063 transitions, 160224 flow [2022-12-13 05:07:06,790 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 05:07:06,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:07:06,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:07:06,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 05:07:06,790 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 05:07:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:07:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash 840164501, now seen corresponding path program 1 times [2022-12-13 05:07:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:07:06,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62473321] [2022-12-13 05:07:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:07:06,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:07:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:07:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:07:08,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:07:08,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62473321] [2022-12-13 05:07:08,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62473321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:07:08,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:07:08,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:07:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539632460] [2022-12-13 05:07:08,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:07:08,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:07:08,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:07:08,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:07:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:07:08,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:07:08,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 1063 transitions, 160224 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:07:08,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:07:08,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:07:08,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:07:10,379 INFO L130 PetriNetUnfolder]: 1636/2599 cut-off events. [2022-12-13 05:07:10,379 INFO L131 PetriNetUnfolder]: For 291/291 co-relation queries the response was YES. [2022-12-13 05:07:10,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198133 conditions, 2599 events. 1636/2599 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 13303 event pairs, 15 based on Foata normal form. 1/2126 useless extension candidates. Maximal degree in co-relation 83071. Up to 2600 conditions per place. [2022-12-13 05:07:10,434 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 885 selfloop transitions, 186 changer transitions 14/1085 dead transitions. [2022-12-13 05:07:10,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 1085 transitions, 165721 flow [2022-12-13 05:07:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:07:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:07:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 05:07:10,435 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-13 05:07:10,435 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 298 predicate places. [2022-12-13 05:07:10,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 1085 transitions, 165721 flow [2022-12-13 05:07:10,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 1071 transitions, 163573 flow [2022-12-13 05:07:10,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:07:10,792 INFO L89 Accepts]: Start accepts. Operand has 325 places, 1071 transitions, 163573 flow [2022-12-13 05:07:10,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:07:10,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:07:10,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 325 places, 1071 transitions, 163573 flow [2022-12-13 05:07:10,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 325 places, 1071 transitions, 163573 flow [2022-12-13 05:07:10,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:07:10,871 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:07:10,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 05:07:10,871 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 1071 transitions, 163573 flow [2022-12-13 05:07:10,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:07:10,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:07:10,871 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 05:07:10,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 05:07:10,871 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 05:07:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:07:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash 753925188, now seen corresponding path program 1 times [2022-12-13 05:07:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:07:10,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099636875] [2022-12-13 05:07:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:07:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:07:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:07:13,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 05:07:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:07:13,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099636875] [2022-12-13 05:07:13,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099636875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:07:13,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:07:13,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:07:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884067875] [2022-12-13 05:07:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:07:13,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:07:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:07:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:07:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:07:13,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 05:07:13,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 1071 transitions, 163573 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 05:07:13,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:07:13,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 05:07:13,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:07:15,615 INFO L130 PetriNetUnfolder]: 1635/2598 cut-off events. [2022-12-13 05:07:15,615 INFO L131 PetriNetUnfolder]: For 295/295 co-relation queries the response was YES. [2022-12-13 05:07:15,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200655 conditions, 2598 events. 1635/2598 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 13282 event pairs, 15 based on Foata normal form. 1/2126 useless extension candidates. Maximal degree in co-relation 84085. Up to 2599 conditions per place. [2022-12-13 05:07:15,671 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 878 selfloop transitions, 183 changer transitions 23/1084 dead transitions. [2022-12-13 05:07:15,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1084 transitions, 167735 flow [2022-12-13 05:07:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:07:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:07:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-12-13 05:07:15,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 05:07:15,673 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 303 predicate places. [2022-12-13 05:07:15,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 1084 transitions, 167735 flow [2022-12-13 05:07:15,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 329 places, 1061 transitions, 164167 flow [2022-12-13 05:07:15,816 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:07:15,817 INFO L89 Accepts]: Start accepts. Operand has 329 places, 1061 transitions, 164167 flow [2022-12-13 05:07:15,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:07:15,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:07:15,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 1061 transitions, 164167 flow [2022-12-13 05:07:15,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 1061 transitions, 164167 flow [2022-12-13 05:07:15,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:07:15,905 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:07:15,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 05:07:15,906 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 1061 transitions, 164167 flow [2022-12-13 05:07:15,906 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 05:07:15,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:07:15,906 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 05:07:15,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-13 05:07:15,906 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 05:07:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:07:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1914877016, now seen corresponding path program 1 times [2022-12-13 05:07:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:07:15,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302466924] [2022-12-13 05:07:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:07:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:07:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:07:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:07:18,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:07:18,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302466924] [2022-12-13 05:07:18,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302466924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:07:18,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:07:18,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:07:18,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355087662] [2022-12-13 05:07:18,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:07:18,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:07:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:07:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:07:18,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:07:18,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 05:07:18,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 1061 transitions, 164167 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:07:18,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:07:18,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 05:07:18,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:07:20,847 INFO L130 PetriNetUnfolder]: 1846/2894 cut-off events. [2022-12-13 05:07:20,847 INFO L131 PetriNetUnfolder]: For 310/310 co-relation queries the response was YES. [2022-12-13 05:07:20,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226389 conditions, 2894 events. 1846/2894 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 14784 event pairs, 14 based on Foata normal form. 1/2342 useless extension candidates. Maximal degree in co-relation 96730. Up to 2895 conditions per place. [2022-12-13 05:07:20,969 INFO L137 encePairwiseOnDemand]: 10/29 looper letters, 951 selfloop transitions, 224 changer transitions 21/1196 dead transitions. [2022-12-13 05:07:20,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 1196 transitions, 187441 flow [2022-12-13 05:07:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 05:07:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 05:07:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-12-13 05:07:20,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31800766283524906 [2022-12-13 05:07:20,971 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 308 predicate places. [2022-12-13 05:07:20,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 1196 transitions, 187441 flow [2022-12-13 05:07:21,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 1175 transitions, 184139 flow [2022-12-13 05:07:21,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:07:21,132 INFO L89 Accepts]: Start accepts. Operand has 336 places, 1175 transitions, 184139 flow [2022-12-13 05:07:21,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:07:21,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:07:21,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 336 places, 1175 transitions, 184139 flow [2022-12-13 05:07:21,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 336 places, 1175 transitions, 184139 flow [2022-12-13 05:07:21,257 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:07:21,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:07:36,375 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:07:36,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15244 [2022-12-13 05:07:36,376 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 1173 transitions, 183829 flow [2022-12-13 05:07:36,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:07:36,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:07:36,376 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 05:07:36,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 05:07:36,376 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 05:07:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:07:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash 808626287, now seen corresponding path program 1 times [2022-12-13 05:07:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:07:36,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789650333] [2022-12-13 05:07:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:07:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:07:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:07:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:07:42,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:07:42,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789650333] [2022-12-13 05:07:42,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789650333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:07:42,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:07:42,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:07:42,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90213728] [2022-12-13 05:07:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:07:42,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:07:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:07:42,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:07:42,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:07:42,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:07:42,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 1173 transitions, 183829 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:07:42,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:07:42,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:07:42,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:07:45,460 INFO L130 PetriNetUnfolder]: 1851/2912 cut-off events. [2022-12-13 05:07:45,460 INFO L131 PetriNetUnfolder]: For 315/315 co-relation queries the response was YES. [2022-12-13 05:07:45,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230714 conditions, 2912 events. 1851/2912 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15034 event pairs, 15 based on Foata normal form. 1/2364 useless extension candidates. Maximal degree in co-relation 98287. Up to 2913 conditions per place. [2022-12-13 05:07:45,526 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 1021 selfloop transitions, 165 changer transitions 21/1207 dead transitions. [2022-12-13 05:07:45,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 1207 transitions, 191586 flow [2022-12-13 05:07:45,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:07:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:07:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-12-13 05:07:45,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2022-12-13 05:07:45,527 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 312 predicate places. [2022-12-13 05:07:45,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 1207 transitions, 191586 flow [2022-12-13 05:07:45,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 340 places, 1186 transitions, 188238 flow [2022-12-13 05:07:45,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:07:45,689 INFO L89 Accepts]: Start accepts. Operand has 340 places, 1186 transitions, 188238 flow [2022-12-13 05:07:45,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:07:45,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:07:45,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 340 places, 1186 transitions, 188238 flow [2022-12-13 05:07:45,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 340 places, 1186 transitions, 188238 flow [2022-12-13 05:07:45,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:07:45,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:07:45,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_~x~1#1_113| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_115| 4294967296) (mod v_~A~0_197 4294967296))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91| (ite (= (mod (select (select |v_#memory_int_474| v_~queue~0.base_249) (+ (* v_~end~0_437 4) v_~queue~0.offset_249)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_113| 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_81| 0) (= |v_thread2Thread1of1ForFork0_~i~1#1_115| 0) (= (+ v_~end~0_437 1) v_~end~0_436) (= |v_thread2Thread1of1ForFork0_#res#1.offset_81| 0) (not (= (ite (and (< v_~end~0_437 v_~n~0_247) (<= 0 v_~end~0_437)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| 0))) InVars {~queue~0.offset=v_~queue~0.offset_249, ~A~0=v_~A~0_197, #memory_int=|v_#memory_int_474|, ~end~0=v_~end~0_437, ~queue~0.base=v_~queue~0.base_249, ~n~0=v_~n~0_247} OutVars{~queue~0.offset=v_~queue~0.offset_249, ~A~0=v_~A~0_197, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_81|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_115|, ~queue~0.base=v_~queue~0.base_249, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_91|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_81|, #memory_int=|v_#memory_int_474|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_91|, ~end~0=v_~end~0_436, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_113|, ~n~0=v_~n~0_247, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_91|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:07:46,027 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:07:46,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 339 [2022-12-13 05:07:46,028 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 1184 transitions, 187926 flow [2022-12-13 05:07:46,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:07:46,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:07:46,028 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 05:07:46,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 05:07:46,028 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 05:07:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:07:46,029 INFO L85 PathProgramCache]: Analyzing trace with hash 128562459, now seen corresponding path program 1 times [2022-12-13 05:07:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:07:46,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466857882] [2022-12-13 05:07:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:07:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:07:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:07:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:07:47,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:07:47,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466857882] [2022-12-13 05:07:47,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466857882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:07:47,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:07:47,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:07:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181356826] [2022-12-13 05:07:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:07:47,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:07:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:07:47,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:07:47,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:07:47,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 05:07:47,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 1184 transitions, 187926 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 05:07:47,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:07:47,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 05:07:47,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:07:50,114 INFO L130 PetriNetUnfolder]: 1840/2892 cut-off events. [2022-12-13 05:07:50,114 INFO L131 PetriNetUnfolder]: For 298/298 co-relation queries the response was YES. [2022-12-13 05:07:50,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232023 conditions, 2892 events. 1840/2892 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 14848 event pairs, 17 based on Foata normal form. 1/2343 useless extension candidates. Maximal degree in co-relation 99212. Up to 2893 conditions per place. [2022-12-13 05:07:50,180 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 963 selfloop transitions, 219 changer transitions 15/1197 dead transitions. [2022-12-13 05:07:50,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 1197 transitions, 192392 flow [2022-12-13 05:07:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:07:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:07:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 05:07:50,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2022-12-13 05:07:50,182 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 316 predicate places. [2022-12-13 05:07:50,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 345 places, 1197 transitions, 192392 flow [2022-12-13 05:07:50,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 343 places, 1182 transitions, 189972 flow [2022-12-13 05:07:50,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:07:50,348 INFO L89 Accepts]: Start accepts. Operand has 343 places, 1182 transitions, 189972 flow [2022-12-13 05:07:50,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:07:50,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:07:50,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 1182 transitions, 189972 flow [2022-12-13 05:07:50,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 343 places, 1182 transitions, 189972 flow [2022-12-13 05:07:50,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:07:50,447 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:07:50,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 05:07:50,447 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 1182 transitions, 189972 flow [2022-12-13 05:07:50,447 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 05:07:50,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:07:50,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:07:50,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 05:07:50,447 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 05:07:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:07:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1886003730, now seen corresponding path program 1 times [2022-12-13 05:07:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:07:50,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195442047] [2022-12-13 05:07:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:07:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:07:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:07:53,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 05:07:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:07:53,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195442047] [2022-12-13 05:07:53,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195442047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:07:53,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:07:53,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:07:53,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561133479] [2022-12-13 05:07:53,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:07:53,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:07:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:07:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:07:53,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:07:53,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 05:07:53,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1182 transitions, 189972 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:07:53,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:07:53,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 05:07:53,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:07:56,263 INFO L130 PetriNetUnfolder]: 1854/2922 cut-off events. [2022-12-13 05:07:56,264 INFO L131 PetriNetUnfolder]: For 312/312 co-relation queries the response was YES. [2022-12-13 05:07:56,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237356 conditions, 2922 events. 1854/2922 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15179 event pairs, 14 based on Foata normal form. 1/2377 useless extension candidates. Maximal degree in co-relation 101100. Up to 2923 conditions per place. [2022-12-13 05:07:56,333 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 1010 selfloop transitions, 191 changer transitions 14/1215 dead transitions. [2022-12-13 05:07:56,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1215 transitions, 197721 flow [2022-12-13 05:07:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:07:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:07:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 05:07:56,336 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-13 05:07:56,336 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 320 predicate places. [2022-12-13 05:07:56,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 349 places, 1215 transitions, 197721 flow [2022-12-13 05:07:56,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 347 places, 1201 transitions, 195433 flow [2022-12-13 05:07:56,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:07:56,505 INFO L89 Accepts]: Start accepts. Operand has 347 places, 1201 transitions, 195433 flow [2022-12-13 05:07:56,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:07:56,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:07:56,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 347 places, 1201 transitions, 195433 flow [2022-12-13 05:07:56,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 347 places, 1201 transitions, 195433 flow [2022-12-13 05:07:56,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:07:56,614 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:07:56,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 05:07:56,615 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 1201 transitions, 195433 flow [2022-12-13 05:07:56,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:07:56,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:07:56,615 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 05:07:56,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-13 05:07:56,615 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 05:07:56,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:07:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1389568656, now seen corresponding path program 1 times [2022-12-13 05:07:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:07:56,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760318009] [2022-12-13 05:07:56,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:07:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:07:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:07:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:07:59,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:07:59,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760318009] [2022-12-13 05:07:59,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760318009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:07:59,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:07:59,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:07:59,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468082430] [2022-12-13 05:07:59,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:07:59,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:07:59,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:07:59,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:07:59,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:07:59,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:07:59,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 1201 transitions, 195433 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 05:07:59,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:07:59,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:07:59,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:08:02,299 INFO L130 PetriNetUnfolder]: 1865/2948 cut-off events. [2022-12-13 05:08:02,299 INFO L131 PetriNetUnfolder]: For 319/319 co-relation queries the response was YES. [2022-12-13 05:08:02,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242419 conditions, 2948 events. 1865/2948 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15372 event pairs, 14 based on Foata normal form. 1/2404 useless extension candidates. Maximal degree in co-relation 102510. Up to 2949 conditions per place. [2022-12-13 05:08:02,361 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 1043 selfloop transitions, 159 changer transitions 27/1229 dead transitions. [2022-12-13 05:08:02,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 1229 transitions, 202463 flow [2022-12-13 05:08:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:08:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:08:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 05:08:02,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32661290322580644 [2022-12-13 05:08:02,364 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 325 predicate places. [2022-12-13 05:08:02,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 354 places, 1229 transitions, 202463 flow [2022-12-13 05:08:02,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 351 places, 1202 transitions, 198000 flow [2022-12-13 05:08:02,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:08:02,556 INFO L89 Accepts]: Start accepts. Operand has 351 places, 1202 transitions, 198000 flow [2022-12-13 05:08:02,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:08:02,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:08:02,651 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 1202 transitions, 198000 flow [2022-12-13 05:08:02,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 1202 transitions, 198000 flow [2022-12-13 05:08:02,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:08:02,719 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:08:02,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 05:08:02,719 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 1202 transitions, 198000 flow [2022-12-13 05:08:02,719 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 05:08:02,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:08:02,719 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 05:08:02,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-13 05:08:02,720 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 05:08:02,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:08:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1793298281, now seen corresponding path program 2 times [2022-12-13 05:08:02,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:08:02,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803109070] [2022-12-13 05:08:02,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:08:02,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:08:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:08:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:08:10,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:08:10,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803109070] [2022-12-13 05:08:10,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803109070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:08:10,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:08:10,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:08:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709695175] [2022-12-13 05:08:10,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:08:10,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:08:10,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:08:10,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:08:10,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:08:10,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 05:08:10,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1202 transitions, 198000 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:08:10,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:08:10,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 05:08:10,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:08:13,181 INFO L130 PetriNetUnfolder]: 1849/2923 cut-off events. [2022-12-13 05:08:13,182 INFO L131 PetriNetUnfolder]: For 307/307 co-relation queries the response was YES. [2022-12-13 05:08:13,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243284 conditions, 2923 events. 1849/2923 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15195 event pairs, 17 based on Foata normal form. 1/2384 useless extension candidates. Maximal degree in co-relation 103175. Up to 2924 conditions per place. [2022-12-13 05:08:13,246 INFO L137 encePairwiseOnDemand]: 14/30 looper letters, 1008 selfloop transitions, 191 changer transitions 17/1216 dead transitions. [2022-12-13 05:08:13,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1216 transitions, 202746 flow [2022-12-13 05:08:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:08:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:08:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 05:08:13,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3375 [2022-12-13 05:08:13,249 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 329 predicate places. [2022-12-13 05:08:13,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 358 places, 1216 transitions, 202746 flow [2022-12-13 05:08:13,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 1199 transitions, 199900 flow [2022-12-13 05:08:13,416 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:08:13,417 INFO L89 Accepts]: Start accepts. Operand has 357 places, 1199 transitions, 199900 flow [2022-12-13 05:08:13,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:08:13,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:08:13,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 1199 transitions, 199900 flow [2022-12-13 05:08:13,529 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 1199 transitions, 199900 flow [2022-12-13 05:08:13,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:08:13,532 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:08:13,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:08:13,762 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:08:13,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 347 [2022-12-13 05:08:13,763 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 1198 transitions, 199738 flow [2022-12-13 05:08:13,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:08:13,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:08:13,763 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 05:08:13,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-13 05:08:13,763 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 05:08:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:08:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1832384419, now seen corresponding path program 1 times [2022-12-13 05:08:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:08:13,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005956157] [2022-12-13 05:08:13,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:08:13,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:08:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:08:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:08:15,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:08:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005956157] [2022-12-13 05:08:15,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005956157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:08:15,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:08:15,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:08:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219860935] [2022-12-13 05:08:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:08:15,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:08:15,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:08:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:08:15,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:08:15,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 05:08:15,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1198 transitions, 199738 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 05:08:15,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:08:15,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 05:08:15,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:08:18,272 INFO L130 PetriNetUnfolder]: 1839/2912 cut-off events. [2022-12-13 05:08:18,272 INFO L131 PetriNetUnfolder]: For 308/308 co-relation queries the response was YES. [2022-12-13 05:08:18,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245282 conditions, 2912 events. 1839/2912 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15161 event pairs, 15 based on Foata normal form. 1/2373 useless extension candidates. Maximal degree in co-relation 104167. Up to 2913 conditions per place. [2022-12-13 05:08:18,341 INFO L137 encePairwiseOnDemand]: 15/32 looper letters, 1005 selfloop transitions, 184 changer transitions 22/1211 dead transitions. [2022-12-13 05:08:18,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1211 transitions, 204336 flow [2022-12-13 05:08:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:08:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:08:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-13 05:08:18,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3203125 [2022-12-13 05:08:18,343 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 334 predicate places. [2022-12-13 05:08:18,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 363 places, 1211 transitions, 204336 flow [2022-12-13 05:08:18,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 359 places, 1189 transitions, 200615 flow [2022-12-13 05:08:18,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:08:18,515 INFO L89 Accepts]: Start accepts. Operand has 359 places, 1189 transitions, 200615 flow [2022-12-13 05:08:18,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:08:18,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:08:18,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 1189 transitions, 200615 flow [2022-12-13 05:08:18,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 359 places, 1189 transitions, 200615 flow [2022-12-13 05:08:18,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:08:18,867 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:08:18,867 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 352 [2022-12-13 05:08:18,867 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 1189 transitions, 200615 flow [2022-12-13 05:08:18,867 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 05:08:18,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:08:18,867 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 05:08:18,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 05:08:18,867 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 05:08:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:08:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 818350799, now seen corresponding path program 3 times [2022-12-13 05:08:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:08:18,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283810397] [2022-12-13 05:08:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:08:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:08:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:08:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:08:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:08:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283810397] [2022-12-13 05:08:20,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283810397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:08:20,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:08:20,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:08:20,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498774125] [2022-12-13 05:08:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:08:20,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:08:20,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:08:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:08:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:08:20,683 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 05:08:20,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1189 transitions, 200615 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:08:20,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:08:20,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 05:08:20,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:08:23,331 INFO L130 PetriNetUnfolder]: 1843/2919 cut-off events. [2022-12-13 05:08:23,331 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2022-12-13 05:08:23,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248794 conditions, 2919 events. 1843/2919 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15230 event pairs, 18 based on Foata normal form. 1/2388 useless extension candidates. Maximal degree in co-relation 105321. Up to 2920 conditions per place. [2022-12-13 05:08:23,392 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 1035 selfloop transitions, 158 changer transitions 23/1216 dead transitions. [2022-12-13 05:08:23,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1216 transitions, 207616 flow [2022-12-13 05:08:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:08:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:08:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-13 05:08:23,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2022-12-13 05:08:23,393 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 337 predicate places. [2022-12-13 05:08:23,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 366 places, 1216 transitions, 207616 flow [2022-12-13 05:08:23,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 365 places, 1193 transitions, 203676 flow [2022-12-13 05:08:23,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:08:23,554 INFO L89 Accepts]: Start accepts. Operand has 365 places, 1193 transitions, 203676 flow [2022-12-13 05:08:23,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:08:23,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:08:23,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 1193 transitions, 203676 flow [2022-12-13 05:08:23,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 365 places, 1193 transitions, 203676 flow [2022-12-13 05:08:23,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:08:23,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~end~0_452 (+ v_~end~0_453 1)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_119| 4294967296) (mod v_~A~0_205 4294967296))) (= |v_thread2Thread1of1ForFork0_#res#1.offset_85| 0) (not (= (ite (and (<= 0 v_~end~0_453) (< v_~end~0_453 v_~n~0_255)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| 0)) (= (ite (= (mod (select (select |v_#memory_int_488| v_~queue~0.base_257) (+ (* v_~end~0_453 4) v_~queue~0.offset_257)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_117| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= |v_thread2Thread1of1ForFork0_~i~1#1_119| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_117| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_85| 0)) InVars {~queue~0.offset=v_~queue~0.offset_257, ~A~0=v_~A~0_205, #memory_int=|v_#memory_int_488|, ~end~0=v_~end~0_453, ~queue~0.base=v_~queue~0.base_257, ~n~0=v_~n~0_255} OutVars{~queue~0.offset=v_~queue~0.offset_257, ~A~0=v_~A~0_205, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_85|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_119|, ~queue~0.base=v_~queue~0.base_257, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_85|, #memory_int=|v_#memory_int_488|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_95|, ~end~0=v_~end~0_452, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_117|, ~n~0=v_~n~0_255, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_95|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:08:23,884 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:08:23,884 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 331 [2022-12-13 05:08:23,884 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 1191 transitions, 203338 flow [2022-12-13 05:08:23,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:08:23,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:08:23,884 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 05:08:23,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-13 05:08:23,885 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 05:08:23,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:08:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash -478647561, now seen corresponding path program 4 times [2022-12-13 05:08:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:08:23,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947535185] [2022-12-13 05:08:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:08:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:08:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:08:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:08:28,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:08:28,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947535185] [2022-12-13 05:08:28,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947535185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:08:28,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:08:28,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:08:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685062649] [2022-12-13 05:08:28,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:08:28,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:08:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:08:28,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:08:28,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:08:28,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:08:28,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 1191 transitions, 203338 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:08:28,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:08:28,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:08:28,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:08:31,579 INFO L130 PetriNetUnfolder]: 1833/2898 cut-off events. [2022-12-13 05:08:31,579 INFO L131 PetriNetUnfolder]: For 308/308 co-relation queries the response was YES. [2022-12-13 05:08:31,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249903 conditions, 2898 events. 1833/2898 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 15072 event pairs, 20 based on Foata normal form. 1/2367 useless extension candidates. Maximal degree in co-relation 106130. Up to 2899 conditions per place. [2022-12-13 05:08:31,647 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 1094 selfloop transitions, 88 changer transitions 23/1205 dead transitions. [2022-12-13 05:08:31,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 1205 transitions, 208146 flow [2022-12-13 05:08:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:08:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:08:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:08:31,648 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31451612903225806 [2022-12-13 05:08:31,648 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 341 predicate places. [2022-12-13 05:08:31,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 370 places, 1205 transitions, 208146 flow [2022-12-13 05:08:31,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 369 places, 1182 transitions, 204160 flow [2022-12-13 05:08:31,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:08:31,820 INFO L89 Accepts]: Start accepts. Operand has 369 places, 1182 transitions, 204160 flow [2022-12-13 05:08:31,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:08:31,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:08:31,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 369 places, 1182 transitions, 204160 flow [2022-12-13 05:08:31,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 369 places, 1182 transitions, 204160 flow [2022-12-13 05:08:31,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:08:31,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:08:32,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:08:32,152 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:08:32,153 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 334 [2022-12-13 05:08:32,153 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 1181 transitions, 203992 flow [2022-12-13 05:08:32,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:08:32,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:08:32,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:08:32,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-13 05:08:32,153 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 05:08:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:08:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1427259394, now seen corresponding path program 1 times [2022-12-13 05:08:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:08:32,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211481270] [2022-12-13 05:08:32,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:08:32,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:08:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:08:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:08:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:08:34,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211481270] [2022-12-13 05:08:34,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211481270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:08:34,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:08:34,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:08:34,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904215477] [2022-12-13 05:08:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:08:34,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:08:34,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:08:34,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:08:34,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:08:34,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 05:08:34,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 1181 transitions, 203992 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:08:34,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:08:34,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 05:08:34,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:08:37,308 INFO L130 PetriNetUnfolder]: 1823/2896 cut-off events. [2022-12-13 05:08:37,309 INFO L131 PetriNetUnfolder]: For 311/311 co-relation queries the response was YES. [2022-12-13 05:08:37,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252632 conditions, 2896 events. 1823/2896 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15189 event pairs, 18 based on Foata normal form. 1/2371 useless extension candidates. Maximal degree in co-relation 107541. Up to 2897 conditions per place. [2022-12-13 05:08:37,368 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 1005 selfloop transitions, 183 changer transitions 19/1207 dead transitions. [2022-12-13 05:08:37,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 1207 transitions, 210911 flow [2022-12-13 05:08:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:08:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:08:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-13 05:08:37,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2022-12-13 05:08:37,369 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 345 predicate places. [2022-12-13 05:08:37,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 374 places, 1207 transitions, 210911 flow [2022-12-13 05:08:37,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 372 places, 1188 transitions, 207582 flow [2022-12-13 05:08:37,533 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:08:37,533 INFO L89 Accepts]: Start accepts. Operand has 372 places, 1188 transitions, 207582 flow [2022-12-13 05:08:37,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:08:37,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:08:37,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 1188 transitions, 207582 flow [2022-12-13 05:08:37,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 1188 transitions, 207582 flow [2022-12-13 05:08:37,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:08:37,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:08:37,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [690] L67-5-->L104-3: Formula: (and (= (store |v_#memory_int_495| |v_ULTIMATE.start_main_~#t3~0#1.base_187| (store (select |v_#memory_int_495| |v_ULTIMATE.start_main_~#t3~0#1.base_187|) |v_ULTIMATE.start_main_~#t3~0#1.offset_187| |v_ULTIMATE.start_main_#t~pre18#1_183|)) |v_#memory_int_494|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_89| 0) (not (= (ite (and (<= 0 v_~end~0_461) (< v_~end~0_461 v_~n~0_259)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99| (ite (= (mod (select (select |v_#memory_int_495| v_~queue~0.base_261) (+ (* v_~end~0_461 4) v_~queue~0.offset_261)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_121| 4294967296)) 1 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_ULTIMATE.start_main_#t~pre18#1_183| |v_#pthreadsForks_317|) (= (+ |v_#pthreadsForks_317| 1) |v_#pthreadsForks_316|) (= v_~end~0_460 (+ v_~end~0_461 1)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_123| 4294967296) (mod v_~A~0_209 4294967296))) (= |v_thread2Thread1of1ForFork0_#res#1.base_89| 0)) InVars {~queue~0.offset=v_~queue~0.offset_261, ~A~0=v_~A~0_209, #pthreadsForks=|v_#pthreadsForks_317|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_187|, #memory_int=|v_#memory_int_495|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_187|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_123|, ~end~0=v_~end~0_461, ~queue~0.base=v_~queue~0.base_261, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_121|, ~n~0=v_~n~0_259} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_183|, ~queue~0.offset=v_~queue~0.offset_261, ~A~0=v_~A~0_209, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_187|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_89|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_187|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_123|, ~queue~0.base=v_~queue~0.base_261, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_99|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_89|, #pthreadsForks=|v_#pthreadsForks_316|, #memory_int=|v_#memory_int_494|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_181|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_99|, ~end~0=v_~end~0_460, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_171|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_121|, ~n~0=v_~n~0_259, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_99|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-13 05:08:38,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [691] L67-5-->L104-3: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= (store |v_#memory_int_499| |v_ULTIMATE.start_main_~#t3~0#1.base_189| (store (select |v_#memory_int_499| |v_ULTIMATE.start_main_~#t3~0#1.base_189|) |v_ULTIMATE.start_main_~#t3~0#1.offset_189| |v_ULTIMATE.start_main_#t~pre18#1_185|)) |v_#memory_int_498|) (= v_~end~0_464 (+ v_~end~0_465 1)) (not (= (ite (and (<= 0 v_~end~0_465) (< v_~end~0_465 v_~n~0_261)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101| (ite (= (mod (select (select |v_#memory_int_499| v_~queue~0.base_263) (+ (* v_~end~0_465 4) v_~queue~0.offset_263)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_123| 4294967296)) 1 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_125| 4294967296) (mod v_~A~0_211 4294967296))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_91| 0) (= (+ |v_#pthreadsForks_321| 1) |v_#pthreadsForks_320|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_91| 0) (= |v_ULTIMATE.start_main_#t~pre18#1_185| |v_#pthreadsForks_321|)) InVars {~queue~0.offset=v_~queue~0.offset_263, ~A~0=v_~A~0_211, #pthreadsForks=|v_#pthreadsForks_321|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_189|, #memory_int=|v_#memory_int_499|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_189|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_125|, ~end~0=v_~end~0_465, ~queue~0.base=v_~queue~0.base_263, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_123|, ~n~0=v_~n~0_261} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_185|, ~queue~0.offset=v_~queue~0.offset_263, ~A~0=v_~A~0_211, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_189|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_91|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_189|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_125|, ~queue~0.base=v_~queue~0.base_263, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_91|, #pthreadsForks=|v_#pthreadsForks_320|, #memory_int=|v_#memory_int_498|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_183|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_101|, ~end~0=v_~end~0_464, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_173|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_123|, ~n~0=v_~n~0_261, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-13 05:08:38,255 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:08:38,369 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:08:38,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 836 [2022-12-13 05:08:38,369 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 1186 transitions, 207242 flow [2022-12-13 05:08:38,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:08:38,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:08:38,370 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:08:38,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 05:08:38,370 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 05:08:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:08:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1840683956, now seen corresponding path program 1 times [2022-12-13 05:08:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:08:38,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770192961] [2022-12-13 05:08:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:08:38,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:08:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:08:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:08:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:08:39,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770192961] [2022-12-13 05:08:39,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770192961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:08:39,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:08:39,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:08:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019872219] [2022-12-13 05:08:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:08:39,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:08:39,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:08:39,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:08:39,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:08:39,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 05:08:39,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 1186 transitions, 207242 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:08:39,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:08:39,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 05:08:39,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:08:42,295 INFO L130 PetriNetUnfolder]: 1821/2872 cut-off events. [2022-12-13 05:08:42,295 INFO L131 PetriNetUnfolder]: For 315/315 co-relation queries the response was YES. [2022-12-13 05:08:42,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253418 conditions, 2872 events. 1821/2872 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 14828 event pairs, 15 based on Foata normal form. 1/2367 useless extension candidates. Maximal degree in co-relation 107369. Up to 2873 conditions per place. [2022-12-13 05:08:42,380 INFO L137 encePairwiseOnDemand]: 13/34 looper letters, 953 selfloop transitions, 231 changer transitions 15/1199 dead transitions. [2022-12-13 05:08:42,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1199 transitions, 211920 flow [2022-12-13 05:08:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:08:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:08:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 05:08:42,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31512605042016806 [2022-12-13 05:08:42,381 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 344 predicate places. [2022-12-13 05:08:42,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 373 places, 1199 transitions, 211920 flow [2022-12-13 05:08:42,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 371 places, 1184 transitions, 209254 flow [2022-12-13 05:08:42,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:08:42,554 INFO L89 Accepts]: Start accepts. Operand has 371 places, 1184 transitions, 209254 flow [2022-12-13 05:08:42,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:08:42,615 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:08:42,615 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 371 places, 1184 transitions, 209254 flow [2022-12-13 05:08:42,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 371 places, 1184 transitions, 209254 flow [2022-12-13 05:08:42,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:08:42,674 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:08:42,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 05:08:42,674 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 1184 transitions, 209254 flow [2022-12-13 05:08:42,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:08:42,675 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:08:42,675 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 05:08:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 05:08:42,675 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 05:08:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:08:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2124292283, now seen corresponding path program 1 times [2022-12-13 05:08:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:08:42,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855815855] [2022-12-13 05:08:42,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:08:42,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:08:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:08:45,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 05:08:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:08:45,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855815855] [2022-12-13 05:08:45,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855815855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:08:45,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:08:45,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:08:45,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195548813] [2022-12-13 05:08:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:08:45,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:08:45,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:08:45,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:08:45,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:08:45,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 05:08:45,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 1184 transitions, 209254 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 05:08:45,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:08:45,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 05:08:45,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:08:48,049 INFO L130 PetriNetUnfolder]: 1819/2870 cut-off events. [2022-12-13 05:08:48,049 INFO L131 PetriNetUnfolder]: For 316/316 co-relation queries the response was YES. [2022-12-13 05:08:48,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256109 conditions, 2870 events. 1819/2870 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14826 event pairs, 17 based on Foata normal form. 1/2365 useless extension candidates. Maximal degree in co-relation 108406. Up to 2871 conditions per place. [2022-12-13 05:08:48,115 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 1091 selfloop transitions, 81 changer transitions 25/1197 dead transitions. [2022-12-13 05:08:48,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1197 transitions, 213954 flow [2022-12-13 05:08:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:08:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:08:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 05:08:48,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3046875 [2022-12-13 05:08:48,124 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 349 predicate places. [2022-12-13 05:08:48,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 378 places, 1197 transitions, 213954 flow [2022-12-13 05:08:48,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 370 places, 1172 transitions, 209470 flow [2022-12-13 05:08:48,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:08:48,296 INFO L89 Accepts]: Start accepts. Operand has 370 places, 1172 transitions, 209470 flow [2022-12-13 05:08:48,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:08:48,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:08:48,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 370 places, 1172 transitions, 209470 flow [2022-12-13 05:08:48,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 370 places, 1172 transitions, 209470 flow [2022-12-13 05:08:48,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:08:48,426 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:08:48,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 05:08:48,426 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 1172 transitions, 209470 flow [2022-12-13 05:08:48,426 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 05:08:48,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:08:48,426 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 05:08:48,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-13 05:08:48,426 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 05:08:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:08:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash 437057595, now seen corresponding path program 5 times [2022-12-13 05:08:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:08:48,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394992299] [2022-12-13 05:08:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:08:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:08:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:08:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:08:54,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:08:54,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394992299] [2022-12-13 05:08:54,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394992299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:08:54,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:08:54,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:08:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853579175] [2022-12-13 05:08:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:08:54,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:08:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:08:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:08:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:08:54,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 05:08:54,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 1172 transitions, 209470 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:08:54,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:08:54,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 05:08:54,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:08:57,365 INFO L130 PetriNetUnfolder]: 1809/2851 cut-off events. [2022-12-13 05:08:57,366 INFO L131 PetriNetUnfolder]: For 309/309 co-relation queries the response was YES. [2022-12-13 05:08:57,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257262 conditions, 2851 events. 1809/2851 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14634 event pairs, 17 based on Foata normal form. 1/2346 useless extension candidates. Maximal degree in co-relation 109351. Up to 2852 conditions per place. [2022-12-13 05:08:57,434 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 975 selfloop transitions, 194 changer transitions 17/1186 dead transitions. [2022-12-13 05:08:57,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 1186 transitions, 214352 flow [2022-12-13 05:08:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:08:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:08:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-12-13 05:08:57,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30833333333333335 [2022-12-13 05:08:57,436 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 348 predicate places. [2022-12-13 05:08:57,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 1186 transitions, 214352 flow [2022-12-13 05:08:57,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 376 places, 1169 transitions, 211271 flow [2022-12-13 05:08:57,610 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:08:57,610 INFO L89 Accepts]: Start accepts. Operand has 376 places, 1169 transitions, 211271 flow [2022-12-13 05:08:57,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:08:57,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:08:57,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 376 places, 1169 transitions, 211271 flow [2022-12-13 05:08:57,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 376 places, 1169 transitions, 211271 flow [2022-12-13 05:08:57,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:08:57,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:08:57,855 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:08:57,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-13 05:08:57,856 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 1168 transitions, 211093 flow [2022-12-13 05:08:57,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:08:57,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:08:57,856 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 05:08:57,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 05:08:57,856 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 05:08:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:08:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1018604325, now seen corresponding path program 6 times [2022-12-13 05:08:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:08:57,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135660481] [2022-12-13 05:08:57,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:08:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:08:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:09:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:09:01,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:09:01,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135660481] [2022-12-13 05:09:01,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135660481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:09:01,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:09:01,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:09:01,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917555027] [2022-12-13 05:09:01,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:09:01,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:09:01,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:09:01,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:09:01,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:09:01,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:09:01,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1168 transitions, 211093 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:09:01,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:09:01,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:09:01,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:09:05,112 INFO L130 PetriNetUnfolder]: 1798/2839 cut-off events. [2022-12-13 05:09:05,112 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2022-12-13 05:09:05,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259021 conditions, 2839 events. 1798/2839 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14640 event pairs, 17 based on Foata normal form. 1/2340 useless extension candidates. Maximal degree in co-relation 110202. Up to 2840 conditions per place. [2022-12-13 05:09:05,212 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 972 selfloop transitions, 189 changer transitions 20/1181 dead transitions. [2022-12-13 05:09:05,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1181 transitions, 215813 flow [2022-12-13 05:09:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:09:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:09:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-12-13 05:09:05,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29838709677419356 [2022-12-13 05:09:05,213 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 353 predicate places. [2022-12-13 05:09:05,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 382 places, 1181 transitions, 215813 flow [2022-12-13 05:09:05,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 374 places, 1161 transitions, 212150 flow [2022-12-13 05:09:05,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:09:05,464 INFO L89 Accepts]: Start accepts. Operand has 374 places, 1161 transitions, 212150 flow [2022-12-13 05:09:05,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:09:05,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:09:05,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 374 places, 1161 transitions, 212150 flow [2022-12-13 05:09:05,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 374 places, 1161 transitions, 212150 flow [2022-12-13 05:09:05,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:09:05,600 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:09:05,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 05:09:05,601 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 1161 transitions, 212150 flow [2022-12-13 05:09:05,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:09:05,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:09:05,601 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 05:09:05,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-13 05:09:05,601 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 05:09:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:09:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1667219621, now seen corresponding path program 1 times [2022-12-13 05:09:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:09:05,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2904285] [2022-12-13 05:09:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:09:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:09:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:09:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:09:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:09:11,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2904285] [2022-12-13 05:09:11,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2904285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:09:11,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:09:11,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:09:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480791041] [2022-12-13 05:09:11,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:09:11,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:09:11,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:09:11,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:09:11,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:09:11,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 05:09:11,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1161 transitions, 212150 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:09:11,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:09:11,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 05:09:11,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:09:15,899 INFO L130 PetriNetUnfolder]: 2011/3140 cut-off events. [2022-12-13 05:09:15,899 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-13 05:09:15,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289602 conditions, 3140 events. 2011/3140 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16180 event pairs, 14 based on Foata normal form. 1/2561 useless extension candidates. Maximal degree in co-relation 125130. Up to 3141 conditions per place. [2022-12-13 05:09:15,980 INFO L137 encePairwiseOnDemand]: 14/30 looper letters, 1136 selfloop transitions, 139 changer transitions 21/1296 dead transitions. [2022-12-13 05:09:15,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 1296 transitions, 239404 flow [2022-12-13 05:09:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 05:09:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 05:09:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-12-13 05:09:15,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-13 05:09:15,981 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 356 predicate places. [2022-12-13 05:09:15,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 385 places, 1296 transitions, 239404 flow [2022-12-13 05:09:16,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 384 places, 1275 transitions, 235514 flow [2022-12-13 05:09:16,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:09:16,339 INFO L89 Accepts]: Start accepts. Operand has 384 places, 1275 transitions, 235514 flow [2022-12-13 05:09:16,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:09:16,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:09:16,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 384 places, 1275 transitions, 235514 flow [2022-12-13 05:09:16,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 384 places, 1275 transitions, 235514 flow [2022-12-13 05:09:16,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:09:26,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:09:26,517 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:09:26,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10179 [2022-12-13 05:09:26,518 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 1273 transitions, 235148 flow [2022-12-13 05:09:26,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:09:26,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:09:26,518 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 05:09:26,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-13 05:09:26,518 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 05:09:26,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:09:26,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1875912888, now seen corresponding path program 1 times [2022-12-13 05:09:26,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:09:26,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843578724] [2022-12-13 05:09:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:09:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:09:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:09:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:09:28,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:09:28,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843578724] [2022-12-13 05:09:28,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843578724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:09:28,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:09:28,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:09:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726596762] [2022-12-13 05:09:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:09:28,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:09:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:09:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:09:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:09:28,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 05:09:28,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1273 transitions, 235148 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:09:28,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:09:28,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 05:09:28,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:09:31,946 INFO L130 PetriNetUnfolder]: 2013/3150 cut-off events. [2022-12-13 05:09:31,946 INFO L131 PetriNetUnfolder]: For 338/338 co-relation queries the response was YES. [2022-12-13 05:09:31,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293679 conditions, 3150 events. 2013/3150 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16441 event pairs, 15 based on Foata normal form. 1/2575 useless extension candidates. Maximal degree in co-relation 126117. Up to 3151 conditions per place. [2022-12-13 05:09:32,028 INFO L137 encePairwiseOnDemand]: 16/32 looper letters, 1103 selfloop transitions, 178 changer transitions 21/1302 dead transitions. [2022-12-13 05:09:32,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 1302 transitions, 243124 flow [2022-12-13 05:09:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:09:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:09:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-13 05:09:32,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.328125 [2022-12-13 05:09:32,029 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 360 predicate places. [2022-12-13 05:09:32,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 389 places, 1302 transitions, 243124 flow [2022-12-13 05:09:32,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 388 places, 1281 transitions, 239188 flow [2022-12-13 05:09:32,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:09:32,237 INFO L89 Accepts]: Start accepts. Operand has 388 places, 1281 transitions, 239188 flow [2022-12-13 05:09:32,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:09:32,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:09:32,336 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 388 places, 1281 transitions, 239188 flow [2022-12-13 05:09:32,403 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 388 places, 1281 transitions, 239188 flow [2022-12-13 05:09:32,403 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:09:32,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:09:32,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:09:32,848 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:09:32,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 612 [2022-12-13 05:09:32,849 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 1279 transitions, 238820 flow [2022-12-13 05:09:32,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:09:32,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:09:32,849 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 05:09:32,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-13 05:09:32,849 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 05:09:32,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:09:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash -990193684, now seen corresponding path program 1 times [2022-12-13 05:09:32,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:09:32,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949442267] [2022-12-13 05:09:32,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:09:32,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:09:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:09:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:09:47,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:09:47,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949442267] [2022-12-13 05:09:47,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949442267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:09:47,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:09:47,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:09:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26382126] [2022-12-13 05:09:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:09:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:09:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:09:47,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:09:47,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:09:47,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 05:09:47,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 1279 transitions, 238820 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 05:09:47,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:09:47,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 05:09:47,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:09:50,866 INFO L130 PetriNetUnfolder]: 2002/3130 cut-off events. [2022-12-13 05:09:50,866 INFO L131 PetriNetUnfolder]: For 317/317 co-relation queries the response was YES. [2022-12-13 05:09:50,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294946 conditions, 3130 events. 2002/3130 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 16252 event pairs, 19 based on Foata normal form. 1/2554 useless extension candidates. Maximal degree in co-relation 127098. Up to 3131 conditions per place. [2022-12-13 05:09:50,981 INFO L137 encePairwiseOnDemand]: 17/34 looper letters, 1039 selfloop transitions, 238 changer transitions 15/1292 dead transitions. [2022-12-13 05:09:50,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 1292 transitions, 243840 flow [2022-12-13 05:09:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:09:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:09:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 05:09:50,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2977941176470588 [2022-12-13 05:09:50,983 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 364 predicate places. [2022-12-13 05:09:50,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 393 places, 1292 transitions, 243840 flow [2022-12-13 05:09:51,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 1277 transitions, 241000 flow [2022-12-13 05:09:51,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:09:51,415 INFO L89 Accepts]: Start accepts. Operand has 391 places, 1277 transitions, 241000 flow [2022-12-13 05:09:51,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:09:51,462 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:09:51,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 391 places, 1277 transitions, 241000 flow [2022-12-13 05:09:51,529 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 391 places, 1277 transitions, 241000 flow [2022-12-13 05:09:51,529 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:09:51,531 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:09:51,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 05:09:51,531 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 1277 transitions, 241000 flow [2022-12-13 05:09:51,532 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 05:09:51,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:09:51,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:09:51,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-13 05:09:51,532 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 05:09:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:09:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash -536984293, now seen corresponding path program 1 times [2022-12-13 05:09:51,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:09:51,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522233432] [2022-12-13 05:09:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:09:51,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:09:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:09:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:09:57,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:09:57,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522233432] [2022-12-13 05:09:57,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522233432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:09:57,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:09:57,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:09:57,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314042044] [2022-12-13 05:09:57,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:09:57,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:09:57,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:09:57,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:09:57,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:09:57,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 05:09:57,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 1277 transitions, 241000 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:09:57,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:09:57,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 05:09:57,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:10:00,678 INFO L130 PetriNetUnfolder]: 2001/3125 cut-off events. [2022-12-13 05:10:00,678 INFO L131 PetriNetUnfolder]: For 323/323 co-relation queries the response was YES. [2022-12-13 05:10:00,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297601 conditions, 3125 events. 2001/3125 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16224 event pairs, 14 based on Foata normal form. 1/2553 useless extension candidates. Maximal degree in co-relation 128163. Up to 3126 conditions per place. [2022-12-13 05:10:00,761 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 1102 selfloop transitions, 174 changer transitions 14/1290 dead transitions. [2022-12-13 05:10:00,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1290 transitions, 246042 flow [2022-12-13 05:10:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:10:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:10:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-13 05:10:00,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2022-12-13 05:10:00,762 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 368 predicate places. [2022-12-13 05:10:00,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 1290 transitions, 246042 flow [2022-12-13 05:10:01,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 395 places, 1276 transitions, 243362 flow [2022-12-13 05:10:01,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:10:01,154 INFO L89 Accepts]: Start accepts. Operand has 395 places, 1276 transitions, 243362 flow [2022-12-13 05:10:01,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:10:01,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:10:01,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 395 places, 1276 transitions, 243362 flow [2022-12-13 05:10:01,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 395 places, 1276 transitions, 243362 flow [2022-12-13 05:10:01,297 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:10:01,299 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:10:01,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 05:10:01,299 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 1276 transitions, 243362 flow [2022-12-13 05:10:01,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:10:01,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:10:01,299 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 05:10:01,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-13 05:10:01,300 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 05:10:01,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:10:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash -288672822, now seen corresponding path program 1 times [2022-12-13 05:10:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:10:01,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811805889] [2022-12-13 05:10:01,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:10:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:10:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:10:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:10:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:10:02,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811805889] [2022-12-13 05:10:02,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811805889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:10:02,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:10:02,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:10:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554466797] [2022-12-13 05:10:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:10:02,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:10:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:10:02,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:10:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:10:02,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 05:10:02,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1276 transitions, 243362 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 05:10:02,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:10:02,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 05:10:02,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:10:06,295 INFO L130 PetriNetUnfolder]: 2000/3124 cut-off events. [2022-12-13 05:10:06,296 INFO L131 PetriNetUnfolder]: For 334/334 co-relation queries the response was YES. [2022-12-13 05:10:06,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300630 conditions, 3124 events. 2000/3124 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 16183 event pairs, 14 based on Foata normal form. 1/2553 useless extension candidates. Maximal degree in co-relation 129414. Up to 3125 conditions per place. [2022-12-13 05:10:06,418 INFO L137 encePairwiseOnDemand]: 16/32 looper letters, 1090 selfloop transitions, 172 changer transitions 27/1289 dead transitions. [2022-12-13 05:10:06,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 1289 transitions, 248428 flow [2022-12-13 05:10:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:10:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:10:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-13 05:10:06,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3203125 [2022-12-13 05:10:06,419 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 373 predicate places. [2022-12-13 05:10:06,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 402 places, 1289 transitions, 248428 flow [2022-12-13 05:10:06,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 399 places, 1262 transitions, 243209 flow [2022-12-13 05:10:06,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:10:06,699 INFO L89 Accepts]: Start accepts. Operand has 399 places, 1262 transitions, 243209 flow [2022-12-13 05:10:06,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:10:06,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:10:06,795 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 399 places, 1262 transitions, 243209 flow [2022-12-13 05:10:06,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 399 places, 1262 transitions, 243209 flow [2022-12-13 05:10:06,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:10:06,867 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:10:06,867 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-13 05:10:06,867 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 1262 transitions, 243209 flow [2022-12-13 05:10:06,867 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 05:10:06,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:10:06,867 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 05:10:06,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-13 05:10:06,867 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 05:10:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:10:06,868 INFO L85 PathProgramCache]: Analyzing trace with hash -891240894, now seen corresponding path program 2 times [2022-12-13 05:10:06,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:10:06,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603543479] [2022-12-13 05:10:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:10:06,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:10:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:10:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:10:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:10:09,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603543479] [2022-12-13 05:10:09,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603543479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:10:09,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:10:09,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:10:09,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142359275] [2022-12-13 05:10:09,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:10:09,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:10:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:10:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:10:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:10:09,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:10:09,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 1262 transitions, 243209 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:10:09,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:10:09,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:10:09,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:10:13,081 INFO L130 PetriNetUnfolder]: 1986/3104 cut-off events. [2022-12-13 05:10:13,082 INFO L131 PetriNetUnfolder]: For 320/320 co-relation queries the response was YES. [2022-12-13 05:10:13,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301808 conditions, 3104 events. 1986/3104 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 16054 event pairs, 16 based on Foata normal form. 1/2538 useless extension candidates. Maximal degree in co-relation 130176. Up to 3105 conditions per place. [2022-12-13 05:10:13,167 INFO L137 encePairwiseOnDemand]: 14/31 looper letters, 1054 selfloop transitions, 208 changer transitions 17/1279 dead transitions. [2022-12-13 05:10:13,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 1279 transitions, 249052 flow [2022-12-13 05:10:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:10:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:10:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-13 05:10:13,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2022-12-13 05:10:13,168 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 377 predicate places. [2022-12-13 05:10:13,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 406 places, 1279 transitions, 249052 flow [2022-12-13 05:10:13,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 405 places, 1262 transitions, 245730 flow [2022-12-13 05:10:13,392 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:10:13,393 INFO L89 Accepts]: Start accepts. Operand has 405 places, 1262 transitions, 245730 flow [2022-12-13 05:10:13,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:10:13,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:10:13,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 405 places, 1262 transitions, 245730 flow [2022-12-13 05:10:13,548 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 405 places, 1262 transitions, 245730 flow [2022-12-13 05:10:13,548 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:10:13,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:10:13,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:10:13,986 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:10:13,987 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 595 [2022-12-13 05:10:13,987 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 1261 transitions, 245540 flow [2022-12-13 05:10:13,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:10:13,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:10:13,987 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 05:10:13,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-13 05:10:13,987 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 05:10:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:10:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash -657011696, now seen corresponding path program 3 times [2022-12-13 05:10:13,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:10:13,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056128194] [2022-12-13 05:10:13,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:10:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:10:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:10:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:10:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:10:16,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056128194] [2022-12-13 05:10:16,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056128194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:10:16,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:10:16,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:10:16,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482285681] [2022-12-13 05:10:16,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:10:16,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:10:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:10:16,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:10:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:10:16,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 05:10:16,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1261 transitions, 245540 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:10:16,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:10:16,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 05:10:16,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:10:20,584 INFO L130 PetriNetUnfolder]: 1976/3093 cut-off events. [2022-12-13 05:10:20,584 INFO L131 PetriNetUnfolder]: For 317/317 co-relation queries the response was YES. [2022-12-13 05:10:20,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303833 conditions, 3093 events. 1976/3093 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 16016 event pairs, 17 based on Foata normal form. 1/2527 useless extension candidates. Maximal degree in co-relation 131225. Up to 3094 conditions per place. [2022-12-13 05:10:20,660 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 1219 selfloop transitions, 33 changer transitions 22/1274 dead transitions. [2022-12-13 05:10:20,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1274 transitions, 250628 flow [2022-12-13 05:10:20,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:10:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:10:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-12-13 05:10:20,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3143939393939394 [2022-12-13 05:10:20,661 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 382 predicate places. [2022-12-13 05:10:20,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 411 places, 1274 transitions, 250628 flow [2022-12-13 05:10:20,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 407 places, 1252 transitions, 246291 flow [2022-12-13 05:10:20,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:10:20,928 INFO L89 Accepts]: Start accepts. Operand has 407 places, 1252 transitions, 246291 flow [2022-12-13 05:10:21,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:10:21,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:10:21,004 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 407 places, 1252 transitions, 246291 flow [2022-12-13 05:10:21,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 407 places, 1252 transitions, 246291 flow [2022-12-13 05:10:21,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:10:21,076 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:10:21,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 05:10:21,077 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 1252 transitions, 246291 flow [2022-12-13 05:10:21,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:10:21,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:10:21,077 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 05:10:21,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-13 05:10:21,077 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 05:10:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:10:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2047485716, now seen corresponding path program 4 times [2022-12-13 05:10:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:10:21,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337307449] [2022-12-13 05:10:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:10:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:10:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:10:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:10:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:10:23,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337307449] [2022-12-13 05:10:23,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337307449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:10:23,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:10:23,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:10:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128255036] [2022-12-13 05:10:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:10:23,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:10:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:10:23,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:10:23,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:10:23,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:10:23,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 1252 transitions, 246291 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:10:23,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:10:23,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:10:23,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:10:26,762 INFO L130 PetriNetUnfolder]: 1973/3084 cut-off events. [2022-12-13 05:10:26,762 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-12-13 05:10:26,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306034 conditions, 3084 events. 1973/3084 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 15878 event pairs, 15 based on Foata normal form. 1/2526 useless extension candidates. Maximal degree in co-relation 132066. Up to 3085 conditions per place. [2022-12-13 05:10:26,842 INFO L137 encePairwiseOnDemand]: 15/31 looper letters, 1030 selfloop transitions, 224 changer transitions 16/1270 dead transitions. [2022-12-13 05:10:26,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 1270 transitions, 252380 flow [2022-12-13 05:10:26,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:10:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:10:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 05:10:26,843 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-13 05:10:26,843 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 385 predicate places. [2022-12-13 05:10:26,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 414 places, 1270 transitions, 252380 flow [2022-12-13 05:10:27,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 413 places, 1254 transitions, 249191 flow [2022-12-13 05:10:27,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:10:27,174 INFO L89 Accepts]: Start accepts. Operand has 413 places, 1254 transitions, 249191 flow [2022-12-13 05:10:27,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:10:27,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:10:27,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 413 places, 1254 transitions, 249191 flow [2022-12-13 05:10:27,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 413 places, 1254 transitions, 249191 flow [2022-12-13 05:10:27,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:10:27,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:10:27,449 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:10:27,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-13 05:10:27,450 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 1253 transitions, 248995 flow [2022-12-13 05:10:27,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:10:27,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:10:27,450 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 05:10:27,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-13 05:10:27,450 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 05:10:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:10:27,450 INFO L85 PathProgramCache]: Analyzing trace with hash 990154992, now seen corresponding path program 5 times [2022-12-13 05:10:27,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:10:27,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565836997] [2022-12-13 05:10:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:10:27,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:10:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:10:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:10:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:10:29,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565836997] [2022-12-13 05:10:29,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565836997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:10:29,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:10:29,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:10:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848560304] [2022-12-13 05:10:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:10:29,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:10:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:10:29,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:10:29,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:10:29,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 05:10:29,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 1253 transitions, 248995 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:10:29,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:10:29,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 05:10:29,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:10:33,285 INFO L130 PetriNetUnfolder]: 2229/3463 cut-off events. [2022-12-13 05:10:33,285 INFO L131 PetriNetUnfolder]: For 340/340 co-relation queries the response was YES. [2022-12-13 05:10:33,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347096 conditions, 3463 events. 2229/3463 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 18226 event pairs, 18 based on Foata normal form. 1/2827 useless extension candidates. Maximal degree in co-relation 143900. Up to 3464 conditions per place. [2022-12-13 05:10:33,372 INFO L137 encePairwiseOnDemand]: 13/32 looper letters, 1132 selfloop transitions, 299 changer transitions 18/1449 dead transitions. [2022-12-13 05:10:33,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 1449 transitions, 290836 flow [2022-12-13 05:10:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:10:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:10:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-13 05:10:33,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.296875 [2022-12-13 05:10:33,373 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 390 predicate places. [2022-12-13 05:10:33,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 419 places, 1449 transitions, 290836 flow [2022-12-13 05:10:33,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 418 places, 1431 transitions, 287212 flow [2022-12-13 05:10:33,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:10:33,735 INFO L89 Accepts]: Start accepts. Operand has 418 places, 1431 transitions, 287212 flow [2022-12-13 05:10:33,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:10:33,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:10:33,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 418 places, 1431 transitions, 287212 flow [2022-12-13 05:10:33,894 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 418 places, 1431 transitions, 287212 flow [2022-12-13 05:10:33,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:10:33,897 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:10:34,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:10:34,156 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:10:34,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 421 [2022-12-13 05:10:34,156 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 1429 transitions, 286816 flow [2022-12-13 05:10:34,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:10:34,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:10:34,157 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 05:10:34,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-13 05:10:34,157 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 05:10:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:10:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1501133354, now seen corresponding path program 1 times [2022-12-13 05:10:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:10:34,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374889006] [2022-12-13 05:10:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:10:34,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:10:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:10:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:10:35,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:10:35,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374889006] [2022-12-13 05:10:35,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374889006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:10:35,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:10:35,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:10:35,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483177756] [2022-12-13 05:10:35,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:10:35,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:10:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:10:35,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:10:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:10:35,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 05:10:35,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 1429 transitions, 286816 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 05:10:35,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:10:35,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 05:10:35,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:10:40,200 INFO L130 PetriNetUnfolder]: 2229/3465 cut-off events. [2022-12-13 05:10:40,200 INFO L131 PetriNetUnfolder]: For 340/340 co-relation queries the response was YES. [2022-12-13 05:10:40,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350765 conditions, 3465 events. 2229/3465 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 18296 event pairs, 16 based on Foata normal form. 1/2831 useless extension candidates. Maximal degree in co-relation 145340. Up to 3466 conditions per place. [2022-12-13 05:10:40,289 INFO L137 encePairwiseOnDemand]: 14/34 looper letters, 1100 selfloop transitions, 328 changer transitions 24/1452 dead transitions. [2022-12-13 05:10:40,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 1452 transitions, 294347 flow [2022-12-13 05:10:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:10:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:10:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-12-13 05:10:40,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30514705882352944 [2022-12-13 05:10:40,290 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 394 predicate places. [2022-12-13 05:10:40,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 423 places, 1452 transitions, 294347 flow [2022-12-13 05:10:40,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 422 places, 1428 transitions, 289473 flow [2022-12-13 05:10:40,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:10:40,618 INFO L89 Accepts]: Start accepts. Operand has 422 places, 1428 transitions, 289473 flow [2022-12-13 05:10:40,706 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:10:40,706 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:10:40,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 422 places, 1428 transitions, 289473 flow [2022-12-13 05:10:40,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 422 places, 1428 transitions, 289473 flow [2022-12-13 05:10:40,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:10:40,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:10:40,924 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:10:40,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 306 [2022-12-13 05:10:40,924 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 1427 transitions, 289273 flow [2022-12-13 05:10:40,924 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 05:10:40,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:10:40,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:10:40,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-13 05:10:40,925 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 05:10:40,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:10:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash 157468209, now seen corresponding path program 1 times [2022-12-13 05:10:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:10:40,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767104456] [2022-12-13 05:10:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:10:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:10:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:10:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:10:42,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:10:42,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767104456] [2022-12-13 05:10:42,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767104456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:10:42,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:10:42,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:10:42,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972990608] [2022-12-13 05:10:42,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:10:42,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 05:10:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:10:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 05:10:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 05:10:42,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 05:10:42,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 1427 transitions, 289273 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:10:42,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:10:42,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 05:10:42,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:10:47,136 INFO L130 PetriNetUnfolder]: 2216/3454 cut-off events. [2022-12-13 05:10:47,136 INFO L131 PetriNetUnfolder]: For 326/326 co-relation queries the response was YES. [2022-12-13 05:10:47,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353111 conditions, 3454 events. 2216/3454 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 18273 event pairs, 19 based on Foata normal form. 1/2829 useless extension candidates. Maximal degree in co-relation 146270. Up to 3455 conditions per place. [2022-12-13 05:10:47,446 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 1197 selfloop transitions, 238 changer transitions 14/1449 dead transitions. [2022-12-13 05:10:47,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 1449 transitions, 296643 flow [2022-12-13 05:10:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:10:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:10:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 05:10:47,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31512605042016806 [2022-12-13 05:10:47,447 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 398 predicate places. [2022-12-13 05:10:47,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 427 places, 1449 transitions, 296643 flow [2022-12-13 05:10:47,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 1435 transitions, 293767 flow [2022-12-13 05:10:47,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:10:47,689 INFO L89 Accepts]: Start accepts. Operand has 425 places, 1435 transitions, 293767 flow [2022-12-13 05:10:47,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:10:47,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:10:47,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 425 places, 1435 transitions, 293767 flow [2022-12-13 05:10:47,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 425 places, 1435 transitions, 293767 flow [2022-12-13 05:10:47,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:10:47,857 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:10:47,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-13 05:10:47,857 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 1435 transitions, 293767 flow [2022-12-13 05:10:47,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:10:47,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:10:47,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:10:47,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-13 05:10:47,858 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 05:10:47,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:10:47,858 INFO L85 PathProgramCache]: Analyzing trace with hash 578855969, now seen corresponding path program 1 times [2022-12-13 05:10:47,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:10:47,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823484921] [2022-12-13 05:10:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:10:47,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:10:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:10:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:10:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:10:49,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823484921] [2022-12-13 05:10:49,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823484921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:10:49,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:10:49,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:10:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427836952] [2022-12-13 05:10:49,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:10:49,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:10:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:10:49,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:10:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:10:49,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 05:10:49,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 1435 transitions, 293767 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:10:49,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:10:49,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 05:10:49,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:10:54,005 INFO L130 PetriNetUnfolder]: 2219/3463 cut-off events. [2022-12-13 05:10:54,005 INFO L131 PetriNetUnfolder]: For 338/338 co-relation queries the response was YES. [2022-12-13 05:10:54,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357496 conditions, 3463 events. 2219/3463 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18446 event pairs, 18 based on Foata normal form. 1/2839 useless extension candidates. Maximal degree in co-relation 147805. Up to 3464 conditions per place. [2022-12-13 05:10:54,102 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 1153 selfloop transitions, 287 changer transitions 14/1454 dead transitions. [2022-12-13 05:10:54,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1454 transitions, 300575 flow [2022-12-13 05:10:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:10:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:10:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-13 05:10:54,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3067226890756303 [2022-12-13 05:10:54,103 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 402 predicate places. [2022-12-13 05:10:54,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 431 places, 1454 transitions, 300575 flow [2022-12-13 05:10:54,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 429 places, 1440 transitions, 297671 flow [2022-12-13 05:10:54,506 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:10:54,506 INFO L89 Accepts]: Start accepts. Operand has 429 places, 1440 transitions, 297671 flow [2022-12-13 05:10:54,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:10:54,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:10:54,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 429 places, 1440 transitions, 297671 flow [2022-12-13 05:10:54,687 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 429 places, 1440 transitions, 297671 flow [2022-12-13 05:10:54,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:10:54,690 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:10:54,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-13 05:10:54,690 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 1440 transitions, 297671 flow [2022-12-13 05:10:54,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:10:54,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:10:54,690 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 05:10:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-13 05:10:54,690 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 05:10:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:10:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1065176616, now seen corresponding path program 1 times [2022-12-13 05:10:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:10:54,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264941947] [2022-12-13 05:10:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:10:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:10:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:10:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:10:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:10:56,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264941947] [2022-12-13 05:10:56,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264941947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:10:56,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:10:56,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:10:56,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469764832] [2022-12-13 05:10:56,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:10:56,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:10:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:10:56,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:10:56,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:10:56,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 05:10:56,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 1440 transitions, 297671 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 05:10:56,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:10:56,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 05:10:56,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:11:01,206 INFO L130 PetriNetUnfolder]: 2218/3462 cut-off events. [2022-12-13 05:11:01,206 INFO L131 PetriNetUnfolder]: For 332/332 co-relation queries the response was YES. [2022-12-13 05:11:01,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360855 conditions, 3462 events. 2218/3462 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18336 event pairs, 18 based on Foata normal form. 1/2839 useless extension candidates. Maximal degree in co-relation 149134. Up to 3463 conditions per place. [2022-12-13 05:11:01,499 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 1195 selfloop transitions, 235 changer transitions 23/1453 dead transitions. [2022-12-13 05:11:01,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 1453 transitions, 303273 flow [2022-12-13 05:11:01,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:11:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:11:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-13 05:11:01,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2840909090909091 [2022-12-13 05:11:01,500 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 407 predicate places. [2022-12-13 05:11:01,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 436 places, 1453 transitions, 303273 flow [2022-12-13 05:11:01,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 431 places, 1430 transitions, 298463 flow [2022-12-13 05:11:01,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:11:01,769 INFO L89 Accepts]: Start accepts. Operand has 431 places, 1430 transitions, 298463 flow [2022-12-13 05:11:01,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:11:01,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:11:01,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 431 places, 1430 transitions, 298463 flow [2022-12-13 05:11:01,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 431 places, 1430 transitions, 298463 flow [2022-12-13 05:11:01,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:11:01,966 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:11:01,966 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-13 05:11:01,966 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 1430 transitions, 298463 flow [2022-12-13 05:11:01,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 05:11:01,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:11:01,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 05:11:01,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-13 05:11:01,967 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 05:11:01,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:11:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1243295288, now seen corresponding path program 1 times [2022-12-13 05:11:01,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:11:01,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348490536] [2022-12-13 05:11:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:11:01,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:11:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:11:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:11:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:11:09,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348490536] [2022-12-13 05:11:09,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348490536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:11:09,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:11:09,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:11:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373411537] [2022-12-13 05:11:09,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:11:09,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:11:09,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:11:09,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:11:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:11:09,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 05:11:09,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 1430 transitions, 298463 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 05:11:09,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:11:09,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 05:11:09,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:11:14,636 INFO L130 PetriNetUnfolder]: 2209/3443 cut-off events. [2022-12-13 05:11:14,636 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2022-12-13 05:11:14,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362318 conditions, 3443 events. 2209/3443 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 18173 event pairs, 18 based on Foata normal form. 1/2827 useless extension candidates. Maximal degree in co-relation 149831. Up to 3444 conditions per place. [2022-12-13 05:11:14,852 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 1337 selfloop transitions, 83 changer transitions 23/1443 dead transitions. [2022-12-13 05:11:14,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 1443 transitions, 304071 flow [2022-12-13 05:11:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:11:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:11:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-13 05:11:14,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2840909090909091 [2022-12-13 05:11:14,853 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 409 predicate places. [2022-12-13 05:11:14,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 438 places, 1443 transitions, 304071 flow [2022-12-13 05:11:15,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 435 places, 1420 transitions, 299215 flow [2022-12-13 05:11:15,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:11:15,161 INFO L89 Accepts]: Start accepts. Operand has 435 places, 1420 transitions, 299215 flow [2022-12-13 05:11:15,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:11:15,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:11:15,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 1420 transitions, 299215 flow [2022-12-13 05:11:15,324 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 435 places, 1420 transitions, 299215 flow [2022-12-13 05:11:15,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:11:15,326 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:11:15,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 05:11:15,327 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 1420 transitions, 299215 flow [2022-12-13 05:11:15,327 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 05:11:15,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:11:15,327 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 05:11:15,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-13 05:11:15,327 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 05:11:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:11:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash 893198006, now seen corresponding path program 1 times [2022-12-13 05:11:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:11:15,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927252431] [2022-12-13 05:11:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:11:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:11:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:11:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:11:18,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:11:18,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927252431] [2022-12-13 05:11:18,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927252431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:11:18,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:11:18,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:11:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330173280] [2022-12-13 05:11:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:11:18,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:11:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:11:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:11:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:11:18,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 05:11:18,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 1420 transitions, 299215 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 05:11:18,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:11:18,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 05:11:18,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:11:23,776 INFO L130 PetriNetUnfolder]: 2200/3424 cut-off events. [2022-12-13 05:11:23,776 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2022-12-13 05:11:23,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363743 conditions, 3424 events. 2200/3424 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 18009 event pairs, 15 based on Foata normal form. 1/2815 useless extension candidates. Maximal degree in co-relation 150514. Up to 3425 conditions per place. [2022-12-13 05:11:23,870 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 1251 selfloop transitions, 167 changer transitions 15/1433 dead transitions. [2022-12-13 05:11:23,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 1433 transitions, 304829 flow [2022-12-13 05:11:23,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:11:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:11:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-12-13 05:11:23,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30859375 [2022-12-13 05:11:23,871 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 413 predicate places. [2022-12-13 05:11:23,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 442 places, 1433 transitions, 304829 flow [2022-12-13 05:11:24,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 440 places, 1418 transitions, 301629 flow [2022-12-13 05:11:24,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:11:24,237 INFO L89 Accepts]: Start accepts. Operand has 440 places, 1418 transitions, 301629 flow [2022-12-13 05:11:24,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:11:24,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:11:24,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 440 places, 1418 transitions, 301629 flow [2022-12-13 05:11:24,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 440 places, 1418 transitions, 301629 flow [2022-12-13 05:11:24,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:11:24,449 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:11:24,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-13 05:11:24,449 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 1418 transitions, 301629 flow [2022-12-13 05:11:24,449 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 05:11:24,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:11:24,449 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 05:11:24,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-13 05:11:24,450 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 05:11:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:11:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1131780560, now seen corresponding path program 6 times [2022-12-13 05:11:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:11:24,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075417601] [2022-12-13 05:11:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:11:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:11:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:11:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:11:26,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:11:26,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075417601] [2022-12-13 05:11:26,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075417601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:11:26,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:11:26,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:11:26,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515338513] [2022-12-13 05:11:26,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:11:26,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:11:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:11:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:11:26,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:11:26,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:11:26,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 1418 transitions, 301629 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:11:26,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:11:26,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:11:26,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:11:31,604 INFO L130 PetriNetUnfolder]: 2199/3420 cut-off events. [2022-12-13 05:11:31,604 INFO L131 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2022-12-13 05:11:31,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366739 conditions, 3420 events. 2199/3420 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17971 event pairs, 15 based on Foata normal form. 1/2815 useless extension candidates. Maximal degree in co-relation 151718. Up to 3421 conditions per place. [2022-12-13 05:11:31,698 INFO L137 encePairwiseOnDemand]: 15/31 looper letters, 1142 selfloop transitions, 271 changer transitions 19/1432 dead transitions. [2022-12-13 05:11:31,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 1432 transitions, 307479 flow [2022-12-13 05:11:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:11:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:11:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 05:11:31,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31048387096774194 [2022-12-13 05:11:31,699 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 418 predicate places. [2022-12-13 05:11:31,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 447 places, 1432 transitions, 307479 flow [2022-12-13 05:11:31,875 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 446 places, 1413 transitions, 303389 flow [2022-12-13 05:11:32,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:11:32,075 INFO L89 Accepts]: Start accepts. Operand has 446 places, 1413 transitions, 303389 flow [2022-12-13 05:11:32,143 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:11:32,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:11:32,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 446 places, 1413 transitions, 303389 flow [2022-12-13 05:11:32,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 446 places, 1413 transitions, 303389 flow [2022-12-13 05:11:32,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:11:32,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-13 05:11:32,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:11:32,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_1| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (mod (select (select |v_#memory_int_In_5| v_~queue~0.base_In_1) (+ (* v_~end~0_In_1 4) v_~queue~0.offset_In_1)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_1| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_In_1) (< v_~end~0_In_1 v_~n~0_In_1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= v_~end~0_Out_6 (+ v_~end~0_In_1 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|)) InVars {~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_5|, ~end~0=v_~end~0_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_1|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_1, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_2|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, ~end~0=v_~end~0_Out_6, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-13 05:11:32,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L51-5-->thread2EXIT: Formula: (let ((.cse2 (select |v_#memory_int_578| v_~queue~0.base_299)) (.cse3 (* v_~end~0_534 4)) (.cse1 (mod v_~A~0_245 4294967296))) (and (not (= (ite (let ((.cse0 (+ v_~end~0_534 1))) (and (< .cse0 v_~n~0_295) (<= 0 .cse0))) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_113| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_99| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_99| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_97| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_139| 4294967296) .cse1)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_103| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_97| 0) (not (= (ite (and (<= 0 v_~end~0_534) (< v_~end~0_534 v_~n~0_295)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_103| 0) (= (ite (= (mod (select .cse2 (+ v_~queue~0.offset_299 .cse3)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_123| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_137| 4294967296) (mod (select .cse2 (+ v_~queue~0.offset_299 .cse3 4)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|) (= (+ v_~end~0_534 2) v_~end~0_532) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_113| 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_119| 4294967296) .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_299, ~A~0=v_~A~0_245, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_123|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_119|, #memory_int=|v_#memory_int_578|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_139|, ~end~0=v_~end~0_534, ~queue~0.base=v_~queue~0.base_299, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_137|, ~n~0=v_~n~0_295} OutVars{~queue~0.offset=v_~queue~0.offset_299, ~A~0=v_~A~0_245, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_123|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_103|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_99|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_139|, ~queue~0.base=v_~queue~0.base_299, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_113|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_103|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_99|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_119|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|, #memory_int=|v_#memory_int_578|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_113|, ~end~0=v_~end~0_532, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_97|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_137|, ~n~0=v_~n~0_295, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_97|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_113|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:11:32,862 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 05:11:32,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 787 [2022-12-13 05:11:32,862 INFO L495 AbstractCegarLoop]: Abstraction has has 441 places, 1410 transitions, 302755 flow [2022-12-13 05:11:32,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:11:32,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:11:32,863 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 05:11:32,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-13 05:11:32,863 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 05:11:32,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:11:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash -317644243, now seen corresponding path program 1 times [2022-12-13 05:11:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:11:32,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138545670] [2022-12-13 05:11:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:11:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:11:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:11:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:11:34,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:11:34,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138545670] [2022-12-13 05:11:34,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138545670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:11:34,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:11:34,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 05:11:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985817789] [2022-12-13 05:11:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:11:34,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 05:11:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:11:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 05:11:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:11:34,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 05:11:34,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 1410 transitions, 302755 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 05:11:34,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:11:34,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 05:11:34,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:11:39,639 INFO L130 PetriNetUnfolder]: 2186/3395 cut-off events. [2022-12-13 05:11:39,639 INFO L131 PetriNetUnfolder]: For 330/330 co-relation queries the response was YES. [2022-12-13 05:11:39,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367461 conditions, 3395 events. 2186/3395 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17833 event pairs, 21 based on Foata normal form. 1/2806 useless extension candidates. Maximal degree in co-relation 152167. Up to 3396 conditions per place. [2022-12-13 05:11:39,733 INFO L137 encePairwiseOnDemand]: 16/34 looper letters, 1205 selfloop transitions, 196 changer transitions 23/1424 dead transitions. [2022-12-13 05:11:39,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 1424 transitions, 308617 flow [2022-12-13 05:11:39,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:11:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:11:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-13 05:11:39,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3088235294117647 [2022-12-13 05:11:39,734 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 419 predicate places. [2022-12-13 05:11:39,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 448 places, 1424 transitions, 308617 flow [2022-12-13 05:11:40,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 447 places, 1401 transitions, 303619 flow [2022-12-13 05:11:40,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:11:40,116 INFO L89 Accepts]: Start accepts. Operand has 447 places, 1401 transitions, 303619 flow [2022-12-13 05:11:40,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:11:40,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:11:40,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 447 places, 1401 transitions, 303619 flow [2022-12-13 05:11:40,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 447 places, 1401 transitions, 303619 flow [2022-12-13 05:11:40,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:11:40,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [714] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_107| 0) (not (= (ite (and (< v_~end~0_551 v_~n~0_303) (<= 0 v_~end~0_551)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_143| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117| 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_141| 0) (= (ite (= (mod (select (select |v_#memory_int_592| v_~queue~0.base_307) (+ v_~queue~0.offset_307 (* v_~end~0_551 4))) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_141| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (= |v_thread2Thread1of1ForFork0_#res#1.base_107| 0) (= v_~end~0_550 (+ v_~end~0_551 1)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_143| 4294967296) (mod v_~A~0_253 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_307, ~A~0=v_~A~0_253, #memory_int=|v_#memory_int_592|, ~end~0=v_~end~0_551, ~queue~0.base=v_~queue~0.base_307, ~n~0=v_~n~0_303} OutVars{~queue~0.offset=v_~queue~0.offset_307, ~A~0=v_~A~0_253, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_107|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_143|, ~queue~0.base=v_~queue~0.base_307, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_107|, #memory_int=|v_#memory_int_592|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_117|, ~end~0=v_~end~0_550, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_141|, ~n~0=v_~n~0_303, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_117|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:11:40,525 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:11:40,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 410 [2022-12-13 05:11:40,526 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 1399 transitions, 303189 flow [2022-12-13 05:11:40,526 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 05:11:40,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:11:40,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:11:40,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-13 05:11:40,526 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 05:11:40,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:11:40,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1171844582, now seen corresponding path program 1 times [2022-12-13 05:11:40,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:11:40,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574213289] [2022-12-13 05:11:40,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:11:40,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:11:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:11:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:11:43,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:11:43,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574213289] [2022-12-13 05:11:43,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574213289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:11:43,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:11:43,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:11:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224281403] [2022-12-13 05:11:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:11:43,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:11:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:11:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:11:43,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:11:43,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 05:11:43,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 1399 transitions, 303189 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:11:43,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:11:43,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 05:11:43,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:11:48,636 INFO L130 PetriNetUnfolder]: 2176/3373 cut-off events. [2022-12-13 05:11:48,636 INFO L131 PetriNetUnfolder]: For 327/327 co-relation queries the response was YES. [2022-12-13 05:11:48,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368454 conditions, 3373 events. 2176/3373 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 17579 event pairs, 18 based on Foata normal form. 1/2784 useless extension candidates. Maximal degree in co-relation 152922. Up to 3374 conditions per place. [2022-12-13 05:11:48,730 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 1236 selfloop transitions, 162 changer transitions 14/1412 dead transitions. [2022-12-13 05:11:48,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 1412 transitions, 308839 flow [2022-12-13 05:11:48,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:11:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:11:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 05:11:48,731 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30612244897959184 [2022-12-13 05:11:48,731 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 422 predicate places. [2022-12-13 05:11:48,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 451 places, 1412 transitions, 308839 flow [2022-12-13 05:11:48,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 1398 transitions, 305765 flow [2022-12-13 05:11:49,043 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:11:49,043 INFO L89 Accepts]: Start accepts. Operand has 449 places, 1398 transitions, 305765 flow [2022-12-13 05:11:49,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:11:49,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:11:49,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 449 places, 1398 transitions, 305765 flow [2022-12-13 05:11:49,199 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 449 places, 1398 transitions, 305765 flow [2022-12-13 05:11:49,199 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:11:49,201 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:11:49,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 05:11:49,202 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 1398 transitions, 305765 flow [2022-12-13 05:11:49,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:11:49,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:11:49,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:11:49,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-13 05:11:49,202 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 05:11:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:11:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash -796126202, now seen corresponding path program 1 times [2022-12-13 05:11:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:11:49,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630807206] [2022-12-13 05:11:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:11:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:11:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:11:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:11:50,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:11:50,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630807206] [2022-12-13 05:11:50,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630807206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:11:50,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:11:50,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:11:50,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43945606] [2022-12-13 05:11:50,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:11:50,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 05:11:50,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:11:50,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 05:11:50,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 05:11:50,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 05:11:50,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 1398 transitions, 305765 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:11:50,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:11:50,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 05:11:50,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:11:55,702 INFO L130 PetriNetUnfolder]: 2175/3372 cut-off events. [2022-12-13 05:11:55,702 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-13 05:11:55,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371716 conditions, 3372 events. 2175/3372 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 17601 event pairs, 15 based on Foata normal form. 1/2783 useless extension candidates. Maximal degree in co-relation 154212. Up to 3373 conditions per place. [2022-12-13 05:11:55,864 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 1204 selfloop transitions, 191 changer transitions 16/1411 dead transitions. [2022-12-13 05:11:55,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1411 transitions, 311439 flow [2022-12-13 05:11:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:11:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:11:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 05:11:55,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31512605042016806 [2022-12-13 05:11:55,865 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 426 predicate places. [2022-12-13 05:11:55,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 455 places, 1411 transitions, 311439 flow [2022-12-13 05:11:56,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 453 places, 1395 transitions, 307894 flow [2022-12-13 05:11:56,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:11:56,283 INFO L89 Accepts]: Start accepts. Operand has 453 places, 1395 transitions, 307894 flow [2022-12-13 05:11:56,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:11:56,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:11:56,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 453 places, 1395 transitions, 307894 flow [2022-12-13 05:11:56,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 453 places, 1395 transitions, 307894 flow [2022-12-13 05:11:56,519 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:11:56,521 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:11:56,521 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-13 05:11:56,521 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 1395 transitions, 307894 flow [2022-12-13 05:11:56,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:11:56,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:11:56,521 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 05:11:56,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-13 05:11:56,521 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 05:11:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:11:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash 72490332, now seen corresponding path program 1 times [2022-12-13 05:11:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:11:56,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742337257] [2022-12-13 05:11:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:11:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:11:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:11:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:11:58,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:11:58,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742337257] [2022-12-13 05:11:58,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742337257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:11:58,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:11:58,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 05:11:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445813664] [2022-12-13 05:11:58,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:11:58,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 05:11:58,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:11:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 05:11:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:11:58,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 05:11:58,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 1395 transitions, 307894 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 05:11:58,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:11:58,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 05:11:58,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:12:02,589 INFO L130 PetriNetUnfolder]: 2174/3369 cut-off events. [2022-12-13 05:12:02,589 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2022-12-13 05:12:02,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374752 conditions, 3369 events. 2174/3369 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 17518 event pairs, 15 based on Foata normal form. 1/2780 useless extension candidates. Maximal degree in co-relation 155276. Up to 3370 conditions per place. [2022-12-13 05:12:02,798 INFO L137 encePairwiseOnDemand]: 16/32 looper letters, 1123 selfloop transitions, 266 changer transitions 19/1408 dead transitions. [2022-12-13 05:12:02,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1408 transitions, 313588 flow [2022-12-13 05:12:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:12:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:12:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-13 05:12:02,799 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29296875 [2022-12-13 05:12:02,799 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 431 predicate places. [2022-12-13 05:12:02,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 460 places, 1408 transitions, 313588 flow [2022-12-13 05:12:02,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 450 places, 1389 transitions, 309344 flow [2022-12-13 05:12:03,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:12:03,051 INFO L89 Accepts]: Start accepts. Operand has 450 places, 1389 transitions, 309344 flow [2022-12-13 05:12:03,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:12:03,147 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:12:03,147 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 450 places, 1389 transitions, 309344 flow [2022-12-13 05:12:03,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 450 places, 1389 transitions, 309344 flow [2022-12-13 05:12:03,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:12:03,294 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:12:03,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-13 05:12:03,294 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 1389 transitions, 309344 flow [2022-12-13 05:12:03,294 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 05:12:03,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:12:03,294 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 05:12:03,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-13 05:12:03,295 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 05:12:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:12:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1401036139, now seen corresponding path program 1 times [2022-12-13 05:12:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:12:03,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631023580] [2022-12-13 05:12:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:12:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:12:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:12:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:12:07,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:12:07,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631023580] [2022-12-13 05:12:07,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631023580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:12:07,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:12:07,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 05:12:07,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365777707] [2022-12-13 05:12:07,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:12:07,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 05:12:07,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:12:07,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 05:12:07,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:12:07,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 05:12:07,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1389 transitions, 309344 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:12:07,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:12:07,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 05:12:07,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:12:14,785 INFO L130 PetriNetUnfolder]: 2390/3675 cut-off events. [2022-12-13 05:12:14,785 INFO L131 PetriNetUnfolder]: For 348/348 co-relation queries the response was YES. [2022-12-13 05:12:14,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412442 conditions, 3675 events. 2390/3675 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 19132 event pairs, 14 based on Foata normal form. 1/2998 useless extension candidates. Maximal degree in co-relation 173932. Up to 3676 conditions per place. [2022-12-13 05:12:14,892 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 1388 selfloop transitions, 115 changer transitions 21/1524 dead transitions. [2022-12-13 05:12:14,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 1524 transitions, 342454 flow [2022-12-13 05:12:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 05:12:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 05:12:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 111 transitions. [2022-12-13 05:12:14,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29838709677419356 [2022-12-13 05:12:14,894 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 432 predicate places. [2022-12-13 05:12:14,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 461 places, 1524 transitions, 342454 flow [2022-12-13 05:12:15,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 460 places, 1503 transitions, 337724 flow [2022-12-13 05:12:15,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:12:15,368 INFO L89 Accepts]: Start accepts. Operand has 460 places, 1503 transitions, 337724 flow [2022-12-13 05:12:15,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:12:15,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:12:15,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 460 places, 1503 transitions, 337724 flow [2022-12-13 05:12:15,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 460 places, 1503 transitions, 337724 flow [2022-12-13 05:12:15,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:12:15,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_1| 4294967296) (mod v_~A~0_In_3 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_1| 4294967296) (mod (select (select |v_#memory_int_In_7| v_~queue~0.base_In_3) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_3)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_2| 0) (not (= (ite (and (<= 0 v_~end~0_In_3) (< v_~end~0_In_3 v_~n~0_In_3)) 1 0) 0)) (= v_~end~0_Out_10 (+ v_~end~0_In_3 1))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_7|, ~end~0=v_~end~0_In_3, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_2|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_2|, #memory_int=|v_#memory_int_In_7|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_2|, ~end~0=v_~end~0_Out_10, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_1|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-13 05:12:28,716 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 05:12:28,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13348 [2022-12-13 05:12:28,716 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 1501 transitions, 337278 flow [2022-12-13 05:12:28,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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 05:12:28,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:12:28,717 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 05:12:28,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-13 05:12:28,717 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 05:12:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:12:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash -649201352, now seen corresponding path program 1 times [2022-12-13 05:12:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:12:28,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254289048] [2022-12-13 05:12:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:12:28,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:12:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-13 05:14:57,771 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:14:57,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 05:14:57,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-13 05:14:57,777 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 19 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-5-2-3-6-3-3-5-9-5-8-5-6-7-9-7-9-7-9-7-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-4-9-4-9-4-9-4-9-4-9-4-9-3-8-3-7-3-7-3-7-2-4-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-6-2-6-2-4-2-3-2-2-1 context. [2022-12-13 05:14:57,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 05:14:57,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 05:14:57,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 05:14:57,783 INFO L445 BasicCegarLoop]: Path program histogram: [8, 7, 7, 6, 6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:57,786 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 05:14:57,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 05:14:57,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:14:57 BasicIcfg [2022-12-13 05:14:57,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 05:14:57,789 INFO L158 Benchmark]: Toolchain (without parser) took 770226.14ms. Allocated memory was 201.3MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 177.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-12-13 05:14:57,789 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 05:14:57,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.60ms. Allocated memory is still 201.3MB. Free memory was 177.6MB in the beginning and 164.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 05:14:57,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.05ms. Allocated memory is still 201.3MB. Free memory was 164.7MB in the beginning and 162.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 05:14:57,789 INFO L158 Benchmark]: Boogie Preprocessor took 50.15ms. Allocated memory is still 201.3MB. Free memory was 162.6MB in the beginning and 161.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 05:14:57,789 INFO L158 Benchmark]: RCFGBuilder took 590.01ms. Allocated memory is still 201.3MB. Free memory was 161.0MB in the beginning and 134.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 05:14:57,790 INFO L158 Benchmark]: TraceAbstraction took 769246.19ms. Allocated memory was 201.3MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 133.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-12-13 05:14:57,790 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.12ms. Allocated memory is still 201.3MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.60ms. Allocated memory is still 201.3MB. Free memory was 177.6MB in the beginning and 164.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.05ms. Allocated memory is still 201.3MB. Free memory was 164.7MB in the beginning and 162.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.15ms. Allocated memory is still 201.3MB. Free memory was 162.6MB in the beginning and 161.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 590.01ms. Allocated memory is still 201.3MB. Free memory was 161.0MB in the beginning and 134.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 769246.19ms. Allocated memory was 201.3MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 133.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 132 PlacesBefore, 29 PlacesAfterwards, 131 TransitionsBefore, 22 TransitionsAfterwards, 1464 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 68 TrivialYvCompositions, 35 ConcurrentYvCompositions, 6 ChoiceCompositions, 109 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 743, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 748, independent: 741, independent conditional: 0, independent unconditional: 741, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 748, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 748, unknown conditional: 0, unknown unconditional: 748] , Statistics on independence cache: Total cache size (in pairs): 1213, Positive cache size: 1208, Positive conditional cache size: 0, Positive unconditional cache size: 1208, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 31 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 32 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 38 PlacesBefore, 37 PlacesAfterwards, 85 TransitionsBefore, 84 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 45 PlacesAfterwards, 205 TransitionsBefore, 204 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 52 PlacesAfterwards, 338 TransitionsBefore, 337 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 427 TransitionsBefore, 427 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 418 TransitionsBefore, 418 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 75 PlacesBefore, 73 PlacesAfterwards, 464 TransitionsBefore, 462 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 79 PlacesBefore, 78 PlacesAfterwards, 491 TransitionsBefore, 490 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 500 TransitionsBefore, 500 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 509 TransitionsBefore, 509 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 94 PlacesBefore, 93 PlacesAfterwards, 530 TransitionsBefore, 529 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 542 TransitionsBefore, 542 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 104 PlacesBefore, 103 PlacesAfterwards, 658 TransitionsBefore, 657 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 109 PlacesBefore, 108 PlacesAfterwards, 663 TransitionsBefore, 662 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 663 TransitionsBefore, 663 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 119 PlacesBefore, 118 PlacesAfterwards, 742 TransitionsBefore, 741 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 124 PlacesBefore, 123 PlacesAfterwards, 779 TransitionsBefore, 778 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 128 PlacesBefore, 128 PlacesAfterwards, 786 TransitionsBefore, 786 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 800 TransitionsBefore, 800 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 139 PlacesBefore, 138 PlacesAfterwards, 817 TransitionsBefore, 816 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 143 PlacesBefore, 143 PlacesAfterwards, 815 TransitionsBefore, 815 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 148 PlacesBefore, 148 PlacesAfterwards, 986 TransitionsBefore, 986 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 141 PlacesBefore, 141 PlacesAfterwards, 668 TransitionsBefore, 668 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 635 TransitionsBefore, 635 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 143 PlacesBefore, 143 PlacesAfterwards, 675 TransitionsBefore, 675 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 141 PlacesBefore, 141 PlacesAfterwards, 641 TransitionsBefore, 641 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 140 PlacesBefore, 140 PlacesAfterwards, 582 TransitionsBefore, 582 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 149 PlacesBefore, 146 PlacesAfterwards, 680 TransitionsBefore, 677 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 150 PlacesBefore, 150 PlacesAfterwards, 683 TransitionsBefore, 683 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 156 PlacesBefore, 155 PlacesAfterwards, 684 TransitionsBefore, 683 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 161 PlacesBefore, 160 PlacesAfterwards, 682 TransitionsBefore, 681 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 165 PlacesBefore, 164 PlacesAfterwards, 676 TransitionsBefore, 675 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 168 PlacesBefore, 168 PlacesAfterwards, 674 TransitionsBefore, 674 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 172 PlacesBefore, 172 PlacesAfterwards, 670 TransitionsBefore, 670 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 178 PlacesBefore, 176 PlacesAfterwards, 679 TransitionsBefore, 677 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 182 PlacesBefore, 180 PlacesAfterwards, 681 TransitionsBefore, 679 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 184 PlacesBefore, 184 PlacesAfterwards, 687 TransitionsBefore, 687 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 188 PlacesBefore, 188 PlacesAfterwards, 683 TransitionsBefore, 683 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 192 PlacesBefore, 192 PlacesAfterwards, 674 TransitionsBefore, 674 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 198 PlacesBefore, 196 PlacesAfterwards, 710 TransitionsBefore, 708 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 202 PlacesBefore, 197 PlacesAfterwards, 704 TransitionsBefore, 702 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 201 PlacesBefore, 201 PlacesAfterwards, 701 TransitionsBefore, 701 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 205 PlacesBefore, 205 PlacesAfterwards, 700 TransitionsBefore, 700 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 207 PlacesBefore, 207 PlacesAfterwards, 692 TransitionsBefore, 692 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 207 PlacesBefore, 207 PlacesAfterwards, 686 TransitionsBefore, 686 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 216 PlacesBefore, 213 PlacesAfterwards, 784 TransitionsBefore, 781 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 217 PlacesBefore, 217 PlacesAfterwards, 787 TransitionsBefore, 787 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 223 PlacesBefore, 222 PlacesAfterwards, 788 TransitionsBefore, 787 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 228 PlacesBefore, 227 PlacesAfterwards, 786 TransitionsBefore, 785 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 232 PlacesBefore, 231 PlacesAfterwards, 780 TransitionsBefore, 779 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 235 PlacesBefore, 235 PlacesAfterwards, 778 TransitionsBefore, 778 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 239 PlacesBefore, 239 PlacesAfterwards, 774 TransitionsBefore, 774 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 245 PlacesBefore, 243 PlacesAfterwards, 783 TransitionsBefore, 781 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 247 PlacesBefore, 247 PlacesAfterwards, 779 TransitionsBefore, 779 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 251 PlacesBefore, 251 PlacesAfterwards, 787 TransitionsBefore, 787 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 255 PlacesBefore, 255 PlacesAfterwards, 778 TransitionsBefore, 778 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 261 PlacesBefore, 257 PlacesAfterwards, 775 TransitionsBefore, 773 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 263 PlacesBefore, 260 PlacesAfterwards, 772 TransitionsBefore, 770 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 264 PlacesBefore, 264 PlacesAfterwards, 768 TransitionsBefore, 768 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 267 PlacesBefore, 267 PlacesAfterwards, 764 TransitionsBefore, 764 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 267 PlacesBefore, 267 PlacesAfterwards, 758 TransitionsBefore, 758 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 276 PlacesBefore, 273 PlacesAfterwards, 856 TransitionsBefore, 853 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 277 PlacesBefore, 277 PlacesAfterwards, 872 TransitionsBefore, 872 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 281 PlacesBefore, 281 PlacesAfterwards, 859 TransitionsBefore, 859 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 287 PlacesBefore, 286 PlacesAfterwards, 961 TransitionsBefore, 960 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 292 PlacesBefore, 291 PlacesAfterwards, 965 TransitionsBefore, 964 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 297 PlacesBefore, 296 PlacesAfterwards, 955 TransitionsBefore, 954 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 301 PlacesBefore, 300 PlacesAfterwards, 945 TransitionsBefore, 944 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 304 PlacesBefore, 304 PlacesAfterwards, 943 TransitionsBefore, 943 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 314 PlacesBefore, 312 PlacesAfterwards, 1057 TransitionsBefore, 1055 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 318 PlacesBefore, 316 PlacesAfterwards, 1067 TransitionsBefore, 1065 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 321 PlacesBefore, 321 PlacesAfterwards, 1063 TransitionsBefore, 1063 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 325 PlacesBefore, 325 PlacesAfterwards, 1071 TransitionsBefore, 1071 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 329 PlacesBefore, 329 PlacesAfterwards, 1061 TransitionsBefore, 1061 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.1s, 336 PlacesBefore, 334 PlacesAfterwards, 1175 TransitionsBefore, 1173 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 340 PlacesBefore, 338 PlacesAfterwards, 1186 TransitionsBefore, 1184 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 343 PlacesBefore, 343 PlacesAfterwards, 1182 TransitionsBefore, 1182 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 347 PlacesBefore, 347 PlacesAfterwards, 1201 TransitionsBefore, 1201 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 351 PlacesBefore, 351 PlacesAfterwards, 1202 TransitionsBefore, 1202 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 357 PlacesBefore, 356 PlacesAfterwards, 1199 TransitionsBefore, 1198 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 359 PlacesBefore, 359 PlacesAfterwards, 1189 TransitionsBefore, 1189 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 365 PlacesBefore, 363 PlacesAfterwards, 1193 TransitionsBefore, 1191 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 369 PlacesBefore, 368 PlacesAfterwards, 1182 TransitionsBefore, 1181 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 372 PlacesBefore, 367 PlacesAfterwards, 1188 TransitionsBefore, 1186 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 371 PlacesBefore, 371 PlacesAfterwards, 1184 TransitionsBefore, 1184 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 370 PlacesBefore, 370 PlacesAfterwards, 1172 TransitionsBefore, 1172 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 376 PlacesBefore, 375 PlacesAfterwards, 1169 TransitionsBefore, 1168 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 374 PlacesBefore, 374 PlacesAfterwards, 1161 TransitionsBefore, 1161 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 384 PlacesBefore, 382 PlacesAfterwards, 1275 TransitionsBefore, 1273 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 388 PlacesBefore, 386 PlacesAfterwards, 1281 TransitionsBefore, 1279 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 391 PlacesBefore, 391 PlacesAfterwards, 1277 TransitionsBefore, 1277 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 395 PlacesBefore, 395 PlacesAfterwards, 1276 TransitionsBefore, 1276 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 399 PlacesBefore, 399 PlacesAfterwards, 1262 TransitionsBefore, 1262 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 405 PlacesBefore, 404 PlacesAfterwards, 1262 TransitionsBefore, 1261 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 407 PlacesBefore, 407 PlacesAfterwards, 1252 TransitionsBefore, 1252 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 413 PlacesBefore, 412 PlacesAfterwards, 1254 TransitionsBefore, 1253 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 418 PlacesBefore, 416 PlacesAfterwards, 1431 TransitionsBefore, 1429 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 422 PlacesBefore, 421 PlacesAfterwards, 1428 TransitionsBefore, 1427 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 425 PlacesBefore, 425 PlacesAfterwards, 1435 TransitionsBefore, 1435 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 429 PlacesBefore, 429 PlacesAfterwards, 1440 TransitionsBefore, 1440 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 431 PlacesBefore, 431 PlacesAfterwards, 1430 TransitionsBefore, 1430 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 435 PlacesBefore, 435 PlacesAfterwards, 1420 TransitionsBefore, 1420 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 440 PlacesBefore, 440 PlacesAfterwards, 1418 TransitionsBefore, 1418 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 446 PlacesBefore, 441 PlacesAfterwards, 1413 TransitionsBefore, 1410 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 447 PlacesBefore, 445 PlacesAfterwards, 1401 TransitionsBefore, 1399 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 449 PlacesBefore, 449 PlacesAfterwards, 1398 TransitionsBefore, 1398 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 453 PlacesBefore, 453 PlacesAfterwards, 1395 TransitionsBefore, 1395 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 450 PlacesBefore, 450 PlacesAfterwards, 1389 TransitionsBefore, 1389 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.1s, 460 PlacesBefore, 458 PlacesAfterwards, 1503 TransitionsBefore, 1501 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 19 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-5-2-3-6-3-3-5-9-5-8-5-6-7-9-7-9-7-9-7-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-4-9-4-9-4-9-4-9-4-9-4-9-3-8-3-7-3-7-3-7-2-4-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-6-2-6-2-4-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 19 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-5-2-3-6-3-3-5-9-5-8-5-6-7-9-7-9-7-9-7-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-4-9-4-9-4-9-4-9-4-9-4-9-3-8-3-7-3-7-3-7-2-4-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-6-2-6-2-4-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 19 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-5-2-3-6-3-3-5-9-5-8-5-6-7-9-7-9-7-9-7-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-4-9-4-9-4-9-4-9-4-9-4-9-3-8-3-7-3-7-3-7-2-4-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-6-2-6-2-4-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 19 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-5-2-3-6-3-3-5-9-5-8-5-6-7-9-7-9-7-9-7-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-5-9-4-9-4-9-4-9-4-9-4-9-4-9-3-8-3-7-3-7-3-7-2-4-2-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-3-2-6-2-6-2-4-2-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 170 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: 769.1s, OverallIterations: 112, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 230.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3976 SdHoareTripleChecker+Valid, 38.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3976 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 34.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38568 IncrementalHoareTripleChecker+Invalid, 39768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1200 mSolverCounterUnsat, 0 mSDtfsCounter, 38568 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1103 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1076 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 62.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=337724occurred in iteration=111, InterpolantAutomatonStates: 874, 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.2s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 278.4s InterpolantComputationTime, 1937 NumberOfCodeBlocks, 1937 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 1826 ConstructedInterpolants, 0 QuantifiedInterpolants, 196840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 111 InterpolantComputations, 111 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown