/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:51:12,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:51:12,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:51:12,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:51:12,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:51:12,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:51:12,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:51:12,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:51:12,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:51:12,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:51:12,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:51:12,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:51:12,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:51:12,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:51:12,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:51:12,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:51:12,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:51:12,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:51:12,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:51:12,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:51:12,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:51:12,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:51:12,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:51:12,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:51:12,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:51:12,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:51:12,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:51:12,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:51:12,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:51:12,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:51:12,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:51:12,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:51:12,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:51:12,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:51:12,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:51:12,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:51:12,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:51:12,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:51:12,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:51:12,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:51:12,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:51:12,180 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 07:51:12,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:51:12,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:51:12,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:51:12,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:51:12,215 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:51:12,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:51:12,215 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:51:12,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:51:12,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:51:12,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:51:12,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:51:12,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:51:12,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:51:12,217 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:51:12,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:51:12,217 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:51:12,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:51:12,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:51:12,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:51:12,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:51:12,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:51:12,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:51:12,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:51:12,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:51:12,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:51:12,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:51:12,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:51:12,219 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:51:12,219 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:51:12,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:51:12,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:51:12,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:51:12,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:51:12,507 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:51:12,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-13 07:51:13,489 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:51:13,713 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:51:13,714 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-13 07:51:13,720 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42b3fff2/82c938fc7303424babb16f46e2574016/FLAGb86f3f2ff [2022-12-13 07:51:13,737 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a42b3fff2/82c938fc7303424babb16f46e2574016 [2022-12-13 07:51:13,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:51:13,739 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:51:13,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:51:13,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:51:13,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:51:13,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:13,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad4d8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13, skipping insertion in model container [2022-12-13 07:51:13,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:13,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:51:13,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:51:13,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,917 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-horseshoe.wvr.c[3424,3437] [2022-12-13 07:51:13,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:51:13,934 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:51:13,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:13,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:13,966 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-horseshoe.wvr.c[3424,3437] [2022-12-13 07:51:13,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:51:13,979 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:51:13,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13 WrapperNode [2022-12-13 07:51:13,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:51:13,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:51:13,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:51:13,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:51:13,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,026 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-12-13 07:51:14,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:51:14,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:51:14,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:51:14,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:51:14,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,059 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:51:14,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:51:14,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:51:14,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:51:14,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (1/1) ... [2022-12-13 07:51:14,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:51:14,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:14,125 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 07:51:14,147 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 07:51:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:51:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:51:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:51:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:51:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:51:14,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:51:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:51:14,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:51:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:51:14,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:51:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:51:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:51:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:51:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:51:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:51:14,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:51:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:51:14,173 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 07:51:14,241 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:51:14,242 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:51:14,531 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:51:14,631 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:51:14,631 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 07:51:14,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:51:14 BoogieIcfgContainer [2022-12-13 07:51:14,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:51:14,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:51:14,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:51:14,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:51:14,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:51:13" (1/3) ... [2022-12-13 07:51:14,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555354e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:51:14, skipping insertion in model container [2022-12-13 07:51:14,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:13" (2/3) ... [2022-12-13 07:51:14,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555354e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:51:14, skipping insertion in model container [2022-12-13 07:51:14,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:51:14" (3/3) ... [2022-12-13 07:51:14,642 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2022-12-13 07:51:14,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:51:14,653 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:51:14,654 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:51:14,719 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 07:51:14,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 412 flow [2022-12-13 07:51:14,833 INFO L130 PetriNetUnfolder]: 18/191 cut-off events. [2022-12-13 07:51:14,833 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:51:14,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 18/191 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-13 07:51:14,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 412 flow [2022-12-13 07:51:14,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 380 flow [2022-12-13 07:51:14,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:14,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-13 07:51:14,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 380 flow [2022-12-13 07:51:14,918 INFO L130 PetriNetUnfolder]: 18/181 cut-off events. [2022-12-13 07:51:14,918 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:51:14,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 18/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 112 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-13 07:51:14,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-13 07:51:14,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-13 07:51:20,616 INFO L241 LiptonReduction]: Total number of compositions: 152 [2022-12-13 07:51:20,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:51:20,649 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;@15480850, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:51:20,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 07:51:20,693 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-13 07:51:20,694 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:51:20,694 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:20,694 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:20,695 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 07:51:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:20,698 INFO L85 PathProgramCache]: Analyzing trace with hash 717820976, now seen corresponding path program 1 times [2022-12-13 07:51:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:20,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025765519] [2022-12-13 07:51:20,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:20,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025765519] [2022-12-13 07:51:20,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025765519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:20,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:20,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:51:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527616868] [2022-12-13 07:51:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:20,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 07:51:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:20,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 07:51:20,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 07:51:20,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-13 07:51:20,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:20,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:20,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-13 07:51:20,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:21,068 INFO L130 PetriNetUnfolder]: 321/458 cut-off events. [2022-12-13 07:51:21,068 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 07:51:21,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 458 events. 321/458 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1460 event pairs, 166 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 732. Up to 449 conditions per place. [2022-12-13 07:51:21,076 INFO L137 encePairwiseOnDemand]: 27/28 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-12-13 07:51:21,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 120 flow [2022-12-13 07:51:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:51:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 07:51:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2022-12-13 07:51:21,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2022-12-13 07:51:21,089 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-13 07:51:21,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 27 transitions, 120 flow [2022-12-13 07:51:21,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 27 transitions, 120 flow [2022-12-13 07:51:21,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:21,095 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 120 flow [2022-12-13 07:51:21,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:21,098 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:21,098 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 120 flow [2022-12-13 07:51:21,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 120 flow [2022-12-13 07:51:21,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 07:51:21,107 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:21,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 07:51:21,109 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 120 flow [2022-12-13 07:51:21,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:21,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:21,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:21,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:51:21,115 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 07:51:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash 749797966, now seen corresponding path program 1 times [2022-12-13 07:51:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:21,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458667565] [2022-12-13 07:51:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:21,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458667565] [2022-12-13 07:51:21,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458667565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:21,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:21,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:51:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068092539] [2022-12-13 07:51:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:21,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:51:21,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:51:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:51:21,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 07:51:21,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:21,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:21,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 07:51:21,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:21,434 INFO L130 PetriNetUnfolder]: 326/478 cut-off events. [2022-12-13 07:51:21,434 INFO L131 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2022-12-13 07:51:21,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 478 events. 326/478 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1530 event pairs, 167 based on Foata normal form. 15/336 useless extension candidates. Maximal degree in co-relation 1078. Up to 466 conditions per place. [2022-12-13 07:51:21,437 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 23 selfloop transitions, 2 changer transitions 11/39 dead transitions. [2022-12-13 07:51:21,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 249 flow [2022-12-13 07:51:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:51:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:51:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-13 07:51:21,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 07:51:21,441 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2022-12-13 07:51:21,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 39 transitions, 249 flow [2022-12-13 07:51:21,444 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 174 flow [2022-12-13 07:51:21,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:21,447 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 174 flow [2022-12-13 07:51:21,448 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:21,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:21,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 174 flow [2022-12-13 07:51:21,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 174 flow [2022-12-13 07:51:21,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 07:51:22,540 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:51:22,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1095 [2022-12-13 07:51:22,542 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 168 flow [2022-12-13 07:51:22,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:22,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:22,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:22,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:51:22,542 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 07:51:22,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1069403605, now seen corresponding path program 1 times [2022-12-13 07:51:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:22,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458973021] [2022-12-13 07:51:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:22,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 07:51:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:22,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458973021] [2022-12-13 07:51:22,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458973021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:22,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:22,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:51:22,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154296964] [2022-12-13 07:51:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:22,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:51:22,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:22,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:51:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:51:22,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 07:51:22,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:22,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:22,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 07:51:22,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:22,750 INFO L130 PetriNetUnfolder]: 368/550 cut-off events. [2022-12-13 07:51:22,750 INFO L131 PetriNetUnfolder]: For 112/136 co-relation queries the response was YES. [2022-12-13 07:51:22,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 550 events. 368/550 cut-off events. For 112/136 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1931 event pairs, 194 based on Foata normal form. 24/402 useless extension candidates. Maximal degree in co-relation 1424. Up to 531 conditions per place. [2022-12-13 07:51:22,754 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 22 selfloop transitions, 3 changer transitions 12/40 dead transitions. [2022-12-13 07:51:22,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 332 flow [2022-12-13 07:51:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:51:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:51:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-13 07:51:22,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2022-12-13 07:51:22,757 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-12-13 07:51:22,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 40 transitions, 332 flow [2022-12-13 07:51:22,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 224 flow [2022-12-13 07:51:22,763 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:22,763 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 224 flow [2022-12-13 07:51:22,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:22,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:22,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 224 flow [2022-12-13 07:51:22,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 224 flow [2022-12-13 07:51:22,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 07:51:23,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:51:23,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-13 07:51:23,047 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 216 flow [2022-12-13 07:51:23,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:23,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:23,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:23,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:51:23,047 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 07:51:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash -646701779, now seen corresponding path program 1 times [2022-12-13 07:51:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:23,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756450304] [2022-12-13 07:51:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:23,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:23,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756450304] [2022-12-13 07:51:23,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756450304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:23,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:23,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:51:23,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825501035] [2022-12-13 07:51:23,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:23,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:51:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:51:23,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:51:23,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 07:51:23,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:23,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:23,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 07:51:23,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:23,207 INFO L130 PetriNetUnfolder]: 340/484 cut-off events. [2022-12-13 07:51:23,208 INFO L131 PetriNetUnfolder]: For 143/197 co-relation queries the response was YES. [2022-12-13 07:51:23,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 484 events. 340/484 cut-off events. For 143/197 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1490 event pairs, 48 based on Foata normal form. 16/332 useless extension candidates. Maximal degree in co-relation 1956. Up to 475 conditions per place. [2022-12-13 07:51:23,211 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 31 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-13 07:51:23,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 370 flow [2022-12-13 07:51:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:51:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:51:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-13 07:51:23,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 07:51:23,212 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-12-13 07:51:23,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 37 transitions, 370 flow [2022-12-13 07:51:23,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 37 transitions, 370 flow [2022-12-13 07:51:23,217 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:23,217 INFO L89 Accepts]: Start accepts. Operand has 38 places, 37 transitions, 370 flow [2022-12-13 07:51:23,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:23,218 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:23,218 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 37 transitions, 370 flow [2022-12-13 07:51:23,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 37 transitions, 370 flow [2022-12-13 07:51:23,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 07:51:23,219 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:23,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:51:23,220 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 370 flow [2022-12-13 07:51:23,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:23,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:23,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:23,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:51:23,220 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 07:51:23,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1384177257, now seen corresponding path program 2 times [2022-12-13 07:51:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:23,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909871006] [2022-12-13 07:51:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:24,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909871006] [2022-12-13 07:51:24,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909871006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:24,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:24,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 07:51:24,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361270685] [2022-12-13 07:51:24,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:24,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:51:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:24,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:51:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:51:24,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 07:51:24,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 370 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:24,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:24,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 07:51:24,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:24,837 INFO L130 PetriNetUnfolder]: 457/680 cut-off events. [2022-12-13 07:51:24,837 INFO L131 PetriNetUnfolder]: For 190/214 co-relation queries the response was YES. [2022-12-13 07:51:24,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4031 conditions, 680 events. 457/680 cut-off events. For 190/214 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2327 event pairs, 36 based on Foata normal form. 2/470 useless extension candidates. Maximal degree in co-relation 3308. Up to 646 conditions per place. [2022-12-13 07:51:24,842 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 65 selfloop transitions, 18 changer transitions 2/87 dead transitions. [2022-12-13 07:51:24,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 87 transitions, 1066 flow [2022-12-13 07:51:24,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:51:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:51:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-12-13 07:51:24,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39094650205761317 [2022-12-13 07:51:24,846 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-13 07:51:24,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 87 transitions, 1066 flow [2022-12-13 07:51:24,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 85 transitions, 1039 flow [2022-12-13 07:51:24,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:24,855 INFO L89 Accepts]: Start accepts. Operand has 46 places, 85 transitions, 1039 flow [2022-12-13 07:51:24,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:24,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:24,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 85 transitions, 1039 flow [2022-12-13 07:51:24,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 85 transitions, 1039 flow [2022-12-13 07:51:24,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 07:51:32,727 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:51:32,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7873 [2022-12-13 07:51:32,728 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 83 transitions, 1015 flow [2022-12-13 07:51:32,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:32,728 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:32,728 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:32,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:51:32,729 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 07:51:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash -863161890, now seen corresponding path program 1 times [2022-12-13 07:51:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:32,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272239918] [2022-12-13 07:51:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:32,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:32,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272239918] [2022-12-13 07:51:32,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272239918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:32,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:32,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:51:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524473469] [2022-12-13 07:51:32,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:32,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:51:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:51:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:51:32,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 07:51:32,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 83 transitions, 1015 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:32,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:32,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 07:51:32,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:32,886 INFO L130 PetriNetUnfolder]: 318/492 cut-off events. [2022-12-13 07:51:32,886 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-13 07:51:32,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 492 events. 318/492 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1548 event pairs, 27 based on Foata normal form. 8/360 useless extension candidates. Maximal degree in co-relation 2765. Up to 461 conditions per place. [2022-12-13 07:51:32,890 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 73 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2022-12-13 07:51:32,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 85 transitions, 1205 flow [2022-12-13 07:51:32,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:51:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:51:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 07:51:32,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4942528735632184 [2022-12-13 07:51:32,892 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-13 07:51:32,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 85 transitions, 1205 flow [2022-12-13 07:51:32,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 85 transitions, 1205 flow [2022-12-13 07:51:32,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:32,900 INFO L89 Accepts]: Start accepts. Operand has 46 places, 85 transitions, 1205 flow [2022-12-13 07:51:32,902 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:32,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:32,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 85 transitions, 1205 flow [2022-12-13 07:51:32,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 85 transitions, 1205 flow [2022-12-13 07:51:32,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-13 07:51:32,905 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:32,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:51:32,905 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 85 transitions, 1205 flow [2022-12-13 07:51:32,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:32,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:32,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:32,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:51:32,908 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 07:51:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash -579218860, now seen corresponding path program 2 times [2022-12-13 07:51:32,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:32,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257868299] [2022-12-13 07:51:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:33,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:33,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257868299] [2022-12-13 07:51:33,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257868299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:33,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:33,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:51:33,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939371716] [2022-12-13 07:51:33,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:33,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:33,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:33,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:33,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:33,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 85 transitions, 1205 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:33,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:33,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:33,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:34,028 INFO L130 PetriNetUnfolder]: 372/608 cut-off events. [2022-12-13 07:51:34,028 INFO L131 PetriNetUnfolder]: For 312/312 co-relation queries the response was YES. [2022-12-13 07:51:34,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 608 events. 372/608 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2267 event pairs, 36 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 2904. Up to 566 conditions per place. [2022-12-13 07:51:34,033 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 118 selfloop transitions, 15 changer transitions 2/137 dead transitions. [2022-12-13 07:51:34,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 137 transitions, 2237 flow [2022-12-13 07:51:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 07:51:34,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2022-12-13 07:51:34,035 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-13 07:51:34,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 137 transitions, 2237 flow [2022-12-13 07:51:34,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 135 transitions, 2202 flow [2022-12-13 07:51:34,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:34,044 INFO L89 Accepts]: Start accepts. Operand has 52 places, 135 transitions, 2202 flow [2022-12-13 07:51:34,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:34,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:34,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 135 transitions, 2202 flow [2022-12-13 07:51:34,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 135 transitions, 2202 flow [2022-12-13 07:51:34,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 07:51:34,052 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:34,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:51:34,054 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 135 transitions, 2202 flow [2022-12-13 07:51:34,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:34,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:34,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:34,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:51:34,055 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 07:51:34,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -802874120, now seen corresponding path program 3 times [2022-12-13 07:51:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:34,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788240473] [2022-12-13 07:51:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:35,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:35,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788240473] [2022-12-13 07:51:35,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788240473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:35,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:35,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:51:35,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633754631] [2022-12-13 07:51:35,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:35,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:51:35,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:35,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:51:35,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:51:35,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:35,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 135 transitions, 2202 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:35,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:35,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:35,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:35,473 INFO L130 PetriNetUnfolder]: 390/640 cut-off events. [2022-12-13 07:51:35,473 INFO L131 PetriNetUnfolder]: For 350/350 co-relation queries the response was YES. [2022-12-13 07:51:35,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5630 conditions, 640 events. 390/640 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2412 event pairs, 31 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 3381. Up to 598 conditions per place. [2022-12-13 07:51:35,478 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 134 selfloop transitions, 13 changer transitions 2/151 dead transitions. [2022-12-13 07:51:35,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 151 transitions, 2774 flow [2022-12-13 07:51:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-13 07:51:35,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4088669950738916 [2022-12-13 07:51:35,481 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2022-12-13 07:51:35,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 151 transitions, 2774 flow [2022-12-13 07:51:35,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 149 transitions, 2735 flow [2022-12-13 07:51:35,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:35,492 INFO L89 Accepts]: Start accepts. Operand has 58 places, 149 transitions, 2735 flow [2022-12-13 07:51:35,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:35,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:35,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 149 transitions, 2735 flow [2022-12-13 07:51:35,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 149 transitions, 2735 flow [2022-12-13 07:51:35,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 07:51:35,499 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:35,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:51:35,500 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 149 transitions, 2735 flow [2022-12-13 07:51:35,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:35,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:35,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:35,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 07:51:35,501 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 07:51:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1279495332, now seen corresponding path program 4 times [2022-12-13 07:51:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:35,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511820862] [2022-12-13 07:51:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:36,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 07:51:36,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:36,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511820862] [2022-12-13 07:51:36,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511820862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:36,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:36,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:51:36,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897373205] [2022-12-13 07:51:36,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:36,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:36,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:36,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:36,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:36,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:36,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 149 transitions, 2735 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:36,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:36,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:36,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:36,693 INFO L130 PetriNetUnfolder]: 416/693 cut-off events. [2022-12-13 07:51:36,693 INFO L131 PetriNetUnfolder]: For 355/355 co-relation queries the response was YES. [2022-12-13 07:51:36,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6778 conditions, 693 events. 416/693 cut-off events. For 355/355 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2781 event pairs, 33 based on Foata normal form. 1/525 useless extension candidates. Maximal degree in co-relation 4346. Up to 646 conditions per place. [2022-12-13 07:51:36,702 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 147 selfloop transitions, 25 changer transitions 2/176 dead transitions. [2022-12-13 07:51:36,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 176 transitions, 3589 flow [2022-12-13 07:51:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 07:51:36,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2022-12-13 07:51:36,703 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2022-12-13 07:51:36,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 176 transitions, 3589 flow [2022-12-13 07:51:36,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 174 transitions, 3546 flow [2022-12-13 07:51:36,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:36,713 INFO L89 Accepts]: Start accepts. Operand has 64 places, 174 transitions, 3546 flow [2022-12-13 07:51:36,716 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:36,716 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:36,716 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 174 transitions, 3546 flow [2022-12-13 07:51:36,719 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 174 transitions, 3546 flow [2022-12-13 07:51:36,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-13 07:51:36,720 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:36,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:51:36,720 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 174 transitions, 3546 flow [2022-12-13 07:51:36,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:36,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:36,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:36,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 07:51:36,721 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 07:51:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash -14057360, now seen corresponding path program 5 times [2022-12-13 07:51:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:36,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949553017] [2022-12-13 07:51:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:37,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:37,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949553017] [2022-12-13 07:51:37,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949553017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:37,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:37,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:51:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431048689] [2022-12-13 07:51:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:37,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:37,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:37,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:37,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:37,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 174 transitions, 3546 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:37,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:37,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:37,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:37,836 INFO L130 PetriNetUnfolder]: 434/725 cut-off events. [2022-12-13 07:51:37,836 INFO L131 PetriNetUnfolder]: For 444/444 co-relation queries the response was YES. [2022-12-13 07:51:37,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7817 conditions, 725 events. 434/725 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2962 event pairs, 24 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 5077. Up to 678 conditions per place. [2022-12-13 07:51:37,841 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 165 selfloop transitions, 21 changer transitions 2/190 dead transitions. [2022-12-13 07:51:37,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 190 transitions, 4260 flow [2022-12-13 07:51:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-13 07:51:37,843 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4088669950738916 [2022-12-13 07:51:37,843 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2022-12-13 07:51:37,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 190 transitions, 4260 flow [2022-12-13 07:51:37,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 188 transitions, 4213 flow [2022-12-13 07:51:37,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:37,855 INFO L89 Accepts]: Start accepts. Operand has 70 places, 188 transitions, 4213 flow [2022-12-13 07:51:37,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:37,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:37,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 188 transitions, 4213 flow [2022-12-13 07:51:37,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 188 transitions, 4213 flow [2022-12-13 07:51:37,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-13 07:51:37,864 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:37,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:51:37,864 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 188 transitions, 4213 flow [2022-12-13 07:51:37,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:37,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:37,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:37,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 07:51:37,865 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 07:51:37,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:37,865 INFO L85 PathProgramCache]: Analyzing trace with hash 979269212, now seen corresponding path program 1 times [2022-12-13 07:51:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:37,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015202695] [2022-12-13 07:51:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:37,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:37,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:37,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015202695] [2022-12-13 07:51:37,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015202695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:37,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495773769] [2022-12-13 07:51:37,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:37,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:37,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:37,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:37,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 07:51:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:38,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 07:51:38,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:38,240 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 07:51:38,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:51:38,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495773769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:38,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:51:38,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 07:51:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101389320] [2022-12-13 07:51:38,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:38,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:51:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:38,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:51:38,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:38,242 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 07:51:38,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 188 transitions, 4213 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:38,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:38,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 07:51:38,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:38,488 INFO L130 PetriNetUnfolder]: 603/1037 cut-off events. [2022-12-13 07:51:38,489 INFO L131 PetriNetUnfolder]: For 644/644 co-relation queries the response was YES. [2022-12-13 07:51:38,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12229 conditions, 1037 events. 603/1037 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4736 event pairs, 40 based on Foata normal form. 76/865 useless extension candidates. Maximal degree in co-relation 5812. Up to 980 conditions per place. [2022-12-13 07:51:38,527 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 91 selfloop transitions, 8 changer transitions 123/226 dead transitions. [2022-12-13 07:51:38,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 226 transitions, 5521 flow [2022-12-13 07:51:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:51:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:51:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-13 07:51:38,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2022-12-13 07:51:38,529 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2022-12-13 07:51:38,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 226 transitions, 5521 flow [2022-12-13 07:51:38,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 103 transitions, 2479 flow [2022-12-13 07:51:38,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:38,543 INFO L89 Accepts]: Start accepts. Operand has 55 places, 103 transitions, 2479 flow [2022-12-13 07:51:38,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:38,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:38,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 103 transitions, 2479 flow [2022-12-13 07:51:38,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 103 transitions, 2479 flow [2022-12-13 07:51:38,546 INFO L226 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-13 07:51:38,547 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:38,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:51:38,547 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 103 transitions, 2479 flow [2022-12-13 07:51:38,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:38,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:38,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:38,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:38,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 07:51:38,754 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 07:51:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash 164762401, now seen corresponding path program 1 times [2022-12-13 07:51:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:38,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775106074] [2022-12-13 07:51:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:38,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775106074] [2022-12-13 07:51:38,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775106074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153198909] [2022-12-13 07:51:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:38,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:38,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:38,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:38,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 07:51:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:38,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:51:38,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:38,946 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 07:51:38,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:51:38,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153198909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:38,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:51:38,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 07:51:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231541290] [2022-12-13 07:51:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:38,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:51:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:51:38,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:51:38,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 07:51:38,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 103 transitions, 2479 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:38,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:38,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 07:51:38,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:39,088 INFO L130 PetriNetUnfolder]: 496/795 cut-off events. [2022-12-13 07:51:39,088 INFO L131 PetriNetUnfolder]: For 937/937 co-relation queries the response was YES. [2022-12-13 07:51:39,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10117 conditions, 795 events. 496/795 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3053 event pairs, 65 based on Foata normal form. 76/652 useless extension candidates. Maximal degree in co-relation 4469. Up to 773 conditions per place. [2022-12-13 07:51:39,093 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 73 selfloop transitions, 2 changer transitions 33/111 dead transitions. [2022-12-13 07:51:39,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 2888 flow [2022-12-13 07:51:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:51:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:51:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 07:51:39,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2022-12-13 07:51:39,095 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2022-12-13 07:51:39,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 111 transitions, 2888 flow [2022-12-13 07:51:39,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 78 transitions, 2026 flow [2022-12-13 07:51:39,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:39,106 INFO L89 Accepts]: Start accepts. Operand has 50 places, 78 transitions, 2026 flow [2022-12-13 07:51:39,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:39,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:39,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 78 transitions, 2026 flow [2022-12-13 07:51:39,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 78 transitions, 2026 flow [2022-12-13 07:51:39,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-13 07:51:39,110 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:39,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:51:39,110 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 78 transitions, 2026 flow [2022-12-13 07:51:39,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:39,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:39,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:39,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:39,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 07:51:39,316 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 07:51:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash 78136178, now seen corresponding path program 1 times [2022-12-13 07:51:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:39,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496525106] [2022-12-13 07:51:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:40,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:40,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496525106] [2022-12-13 07:51:40,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496525106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:40,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:40,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:51:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764899475] [2022-12-13 07:51:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:40,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:51:40,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:40,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:51:40,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:51:40,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 07:51:40,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 78 transitions, 2026 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:40,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:40,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 07:51:40,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:40,897 INFO L130 PetriNetUnfolder]: 436/703 cut-off events. [2022-12-13 07:51:40,898 INFO L131 PetriNetUnfolder]: For 700/700 co-relation queries the response was YES. [2022-12-13 07:51:40,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9596 conditions, 703 events. 436/703 cut-off events. For 700/700 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2620 event pairs, 53 based on Foata normal form. 1/519 useless extension candidates. Maximal degree in co-relation 4817. Up to 693 conditions per place. [2022-12-13 07:51:40,905 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 104 selfloop transitions, 12 changer transitions 2/120 dead transitions. [2022-12-13 07:51:40,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 120 transitions, 3368 flow [2022-12-13 07:51:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:51:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:51:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-12-13 07:51:40,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2022-12-13 07:51:40,907 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2022-12-13 07:51:40,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 120 transitions, 3368 flow [2022-12-13 07:51:40,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 118 transitions, 3309 flow [2022-12-13 07:51:40,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:40,927 INFO L89 Accepts]: Start accepts. Operand has 57 places, 118 transitions, 3309 flow [2022-12-13 07:51:40,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:40,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:40,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 118 transitions, 3309 flow [2022-12-13 07:51:40,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 118 transitions, 3309 flow [2022-12-13 07:51:40,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-13 07:51:45,691 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:51:45,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4764 [2022-12-13 07:51:45,692 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 117 transitions, 3281 flow [2022-12-13 07:51:45,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:45,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:45,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:45,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 07:51:45,692 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 07:51:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 865161272, now seen corresponding path program 1 times [2022-12-13 07:51:45,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:45,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965341308] [2022-12-13 07:51:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:46,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965341308] [2022-12-13 07:51:46,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965341308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:46,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:46,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:51:46,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451685098] [2022-12-13 07:51:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:46,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:46,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:46,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:46,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:46,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:46,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 117 transitions, 3281 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:46,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:46,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:46,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:46,739 INFO L130 PetriNetUnfolder]: 465/767 cut-off events. [2022-12-13 07:51:46,739 INFO L131 PetriNetUnfolder]: For 1043/1043 co-relation queries the response was YES. [2022-12-13 07:51:46,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11168 conditions, 767 events. 465/767 cut-off events. For 1043/1043 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3061 event pairs, 64 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 5165. Up to 753 conditions per place. [2022-12-13 07:51:46,745 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 125 selfloop transitions, 20 changer transitions 2/149 dead transitions. [2022-12-13 07:51:46,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 149 transitions, 4476 flow [2022-12-13 07:51:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-13 07:51:46,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4187192118226601 [2022-12-13 07:51:46,747 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2022-12-13 07:51:46,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 149 transitions, 4476 flow [2022-12-13 07:51:46,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 147 transitions, 4413 flow [2022-12-13 07:51:46,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:46,760 INFO L89 Accepts]: Start accepts. Operand has 62 places, 147 transitions, 4413 flow [2022-12-13 07:51:46,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:46,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:46,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 147 transitions, 4413 flow [2022-12-13 07:51:46,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 147 transitions, 4413 flow [2022-12-13 07:51:46,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-13 07:51:46,766 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:46,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:51:46,767 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 147 transitions, 4413 flow [2022-12-13 07:51:46,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:46,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:46,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:46,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 07:51:46,767 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 07:51:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1620522570, now seen corresponding path program 2 times [2022-12-13 07:51:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:46,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627342437] [2022-12-13 07:51:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:46,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:48,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627342437] [2022-12-13 07:51:48,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627342437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:48,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:48,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:51:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031518729] [2022-12-13 07:51:48,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:48,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:51:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:51:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:51:48,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:48,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 147 transitions, 4413 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:48,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:48,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:48,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:48,567 INFO L130 PetriNetUnfolder]: 510/855 cut-off events. [2022-12-13 07:51:48,567 INFO L131 PetriNetUnfolder]: For 1031/1031 co-relation queries the response was YES. [2022-12-13 07:51:48,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13327 conditions, 855 events. 510/855 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3606 event pairs, 54 based on Foata normal form. 1/653 useless extension candidates. Maximal degree in co-relation 5513. Up to 840 conditions per place. [2022-12-13 07:51:48,573 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 178 selfloop transitions, 15 changer transitions 2/197 dead transitions. [2022-12-13 07:51:48,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 197 transitions, 6309 flow [2022-12-13 07:51:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 07:51:48,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3793103448275862 [2022-12-13 07:51:48,575 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2022-12-13 07:51:48,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 197 transitions, 6309 flow [2022-12-13 07:51:48,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 195 transitions, 6242 flow [2022-12-13 07:51:48,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:48,588 INFO L89 Accepts]: Start accepts. Operand has 68 places, 195 transitions, 6242 flow [2022-12-13 07:51:48,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:48,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:48,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 195 transitions, 6242 flow [2022-12-13 07:51:48,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 195 transitions, 6242 flow [2022-12-13 07:51:48,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-13 07:51:48,596 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:48,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:51:48,597 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 195 transitions, 6242 flow [2022-12-13 07:51:48,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:48,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:48,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:48,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 07:51:48,597 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 07:51:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1152380816, now seen corresponding path program 3 times [2022-12-13 07:51:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:48,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651148711] [2022-12-13 07:51:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:49,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:49,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651148711] [2022-12-13 07:51:49,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651148711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:49,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:49,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:51:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401368429] [2022-12-13 07:51:49,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:49,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:49,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:49,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:49,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:49,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:49,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 195 transitions, 6242 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:49,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:49,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:49,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:49,580 INFO L130 PetriNetUnfolder]: 580/997 cut-off events. [2022-12-13 07:51:49,580 INFO L131 PetriNetUnfolder]: For 1262/1262 co-relation queries the response was YES. [2022-12-13 07:51:49,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16483 conditions, 997 events. 580/997 cut-off events. For 1262/1262 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4592 event pairs, 52 based on Foata normal form. 1/778 useless extension candidates. Maximal degree in co-relation 5861. Up to 978 conditions per place. [2022-12-13 07:51:49,587 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 227 selfloop transitions, 30 changer transitions 2/261 dead transitions. [2022-12-13 07:51:49,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 261 transitions, 8916 flow [2022-12-13 07:51:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-13 07:51:49,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4088669950738916 [2022-12-13 07:51:49,589 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2022-12-13 07:51:49,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 261 transitions, 8916 flow [2022-12-13 07:51:49,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 259 transitions, 8845 flow [2022-12-13 07:51:49,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:49,606 INFO L89 Accepts]: Start accepts. Operand has 74 places, 259 transitions, 8845 flow [2022-12-13 07:51:49,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:49,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:49,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 259 transitions, 8845 flow [2022-12-13 07:51:49,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 259 transitions, 8845 flow [2022-12-13 07:51:49,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 07:51:49,616 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:49,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 07:51:49,617 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 259 transitions, 8845 flow [2022-12-13 07:51:49,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:49,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:49,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:49,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 07:51:49,618 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 07:51:49,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash -313236576, now seen corresponding path program 1 times [2022-12-13 07:51:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:49,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578360151] [2022-12-13 07:51:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:49,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:49,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578360151] [2022-12-13 07:51:49,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578360151] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:49,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967898655] [2022-12-13 07:51:49,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:49,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:49,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:49,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:49,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 07:51:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:49,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:51:49,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:49,838 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 07:51:49,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:51:49,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967898655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:49,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:51:49,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 07:51:49,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703592315] [2022-12-13 07:51:49,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:49,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:51:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:49,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:51:49,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:51:49,840 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 07:51:49,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 259 transitions, 8845 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:49,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:49,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 07:51:49,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:50,230 INFO L130 PetriNetUnfolder]: 822/1428 cut-off events. [2022-12-13 07:51:50,230 INFO L131 PetriNetUnfolder]: For 1850/1850 co-relation queries the response was YES. [2022-12-13 07:51:50,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25227 conditions, 1428 events. 822/1428 cut-off events. For 1850/1850 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7048 event pairs, 56 based on Foata normal form. 76/1172 useless extension candidates. Maximal degree in co-relation 11946. Up to 1409 conditions per place. [2022-12-13 07:51:50,239 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 109 selfloop transitions, 19 changer transitions 164/297 dead transitions. [2022-12-13 07:51:50,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 297 transitions, 10749 flow [2022-12-13 07:51:50,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:51:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:51:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-13 07:51:50,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2022-12-13 07:51:50,240 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2022-12-13 07:51:50,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 297 transitions, 10749 flow [2022-12-13 07:51:50,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 133 transitions, 4774 flow [2022-12-13 07:51:50,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:50,259 INFO L89 Accepts]: Start accepts. Operand has 61 places, 133 transitions, 4774 flow [2022-12-13 07:51:50,261 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:50,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:50,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 133 transitions, 4774 flow [2022-12-13 07:51:50,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 133 transitions, 4774 flow [2022-12-13 07:51:50,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 07:51:50,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [883] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_25| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork0_#res#1.base_25| 0) (not (= (ite (and (<= 0 v_~q2_back~0_157) (< v_~q2_back~0_157 v_~n2~0_110)) 1 0) 0)) (= (+ v_~s~0_92 |v_thread2Thread1of1ForFork0_~j~0#1_53|) v_~s~0_91) (not (= (ite (and (< v_~q1_front~0_117 v_~q1_back~0_193) (< v_~q1_front~0_117 v_~n1~0_129) (<= 0 v_~q1_front~0_117)) 1 0) 0)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_53| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~q2_back~0_157 1) v_~q2_back~0_156) (= (+ v_~q1_front~0_117 1) v_~q1_front~0_116) (= (select (select |v_#memory_int_285| v_~q1~0.base_108) (+ v_~q1~0.offset_108 (* v_~q1_front~0_117 4))) |v_thread2Thread1of1ForFork0_~j~0#1_53|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (= (+ (select (select |v_#memory_int_285| v_~q2~0.base_115) (+ v_~q2~0.offset_115 (* 4 v_~q2_back~0_157))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_53|) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_108, ~n2~0=v_~n2~0_110, ~q1_front~0=v_~q1_front~0_117, ~q1_back~0=v_~q1_back~0_193, ~q2~0.offset=v_~q2~0.offset_115, ~n1~0=v_~n1~0_129, ~q1~0.base=v_~q1~0.base_108, #memory_int=|v_#memory_int_285|, ~q2~0.base=v_~q2~0.base_115, ~q2_back~0=v_~q2_back~0_157, ~s~0=v_~s~0_92} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_53|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_27|, ~q1~0.offset=v_~q1~0.offset_108, ~n2~0=v_~n2~0_110, ~q1_front~0=v_~q1_front~0_116, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_25|, ~q2~0.offset=v_~q2~0.offset_115, ~n1~0=v_~n1~0_129, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_17|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_17|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_27|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_25|, ~q1_back~0=v_~q1_back~0_193, ~q1~0.base=v_~q1~0.base_108, #memory_int=|v_#memory_int_285|, ~q2~0.base=v_~q2~0.base_115, ~q2_back~0=v_~q2_back~0_156, ~s~0=v_~s~0_91} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:51:50,504 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:51:50,505 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-13 07:51:50,505 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 131 transitions, 4704 flow [2022-12-13 07:51:50,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:50,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:50,505 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:50,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:50,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:50,710 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 07:51:50,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1819828417, now seen corresponding path program 1 times [2022-12-13 07:51:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:50,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415984204] [2022-12-13 07:51:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:51,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 07:51:51,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:51,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415984204] [2022-12-13 07:51:51,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415984204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:51,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:51,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:51:51,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64147582] [2022-12-13 07:51:51,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:51,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:51:51,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:51,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:51:51,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:51:51,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 07:51:51,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 131 transitions, 4704 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:51,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:51,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 07:51:51,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:51,891 INFO L130 PetriNetUnfolder]: 720/1155 cut-off events. [2022-12-13 07:51:51,891 INFO L131 PetriNetUnfolder]: For 1619/1653 co-relation queries the response was YES. [2022-12-13 07:51:51,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21738 conditions, 1155 events. 720/1155 cut-off events. For 1619/1653 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4846 event pairs, 53 based on Foata normal form. 1/817 useless extension candidates. Maximal degree in co-relation 12598. Up to 1146 conditions per place. [2022-12-13 07:51:51,899 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 126 selfloop transitions, 5 changer transitions 18/154 dead transitions. [2022-12-13 07:51:51,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 154 transitions, 5859 flow [2022-12-13 07:51:51,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-13 07:51:51,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35960591133004927 [2022-12-13 07:51:51,900 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2022-12-13 07:51:51,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 154 transitions, 5859 flow [2022-12-13 07:51:51,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 136 transitions, 5149 flow [2022-12-13 07:51:51,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:51,917 INFO L89 Accepts]: Start accepts. Operand has 63 places, 136 transitions, 5149 flow [2022-12-13 07:51:51,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:51,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:51,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 136 transitions, 5149 flow [2022-12-13 07:51:51,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 136 transitions, 5149 flow [2022-12-13 07:51:51,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:51:51,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_In_1) (< v_~q1_back~0_In_1 v_~n1~0_In_1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= (+ v_~q1_back~0_In_1 1) v_~q1_back~0_Out_2) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_1| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (select (select |v_#memory_int_In_3| v_~q1~0.base_In_1) (+ v_~q1~0.offset_In_1 (* v_~q1_back~0_In_1 4))) 0) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_In_1, ~q1_back~0=v_~q1_back~0_In_1, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, ~n1~0=v_~n1~0_In_1, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, ~N~0=v_~N~0_In_1} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_2|, ~q1~0.offset=v_~q1~0.offset_In_1, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_2|, ~n1~0=v_~n1~0_In_1, ~N~0=v_~N~0_In_1, ~q1_back~0=v_~q1_back~0_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|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, 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~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-13 07:51:52,024 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:51:52,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 07:51:52,024 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 135 transitions, 5113 flow [2022-12-13 07:51:52,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:52,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:52,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:52,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 07:51:52,025 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 07:51:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1490682921, now seen corresponding path program 1 times [2022-12-13 07:51:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:52,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925256016] [2022-12-13 07:51:52,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:52,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:52,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925256016] [2022-12-13 07:51:52,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925256016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:52,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891844836] [2022-12-13 07:51:52,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:52,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:52,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:52,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:52,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 07:51:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:53,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 07:51:53,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:53,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 07:51:53,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:51:53,083 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:51:53,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 290 [2022-12-13 07:51:53,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:51:53,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:51:53,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:51:53,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2022-12-13 07:51:53,555 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 07:51:53,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 18 [2022-12-13 07:51:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:51:53,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:51:53,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891844836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:53,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:51:53,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2022-12-13 07:51:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646935463] [2022-12-13 07:51:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:53,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:53,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:53,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:53,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:51:53,581 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 07:51:53,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 135 transitions, 5113 flow. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:53,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:53,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 07:51:53,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:53,993 INFO L130 PetriNetUnfolder]: 714/1135 cut-off events. [2022-12-13 07:51:53,994 INFO L131 PetriNetUnfolder]: For 1453/1453 co-relation queries the response was YES. [2022-12-13 07:51:53,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22512 conditions, 1135 events. 714/1135 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4708 event pairs, 48 based on Foata normal form. 1/803 useless extension candidates. Maximal degree in co-relation 13250. Up to 1128 conditions per place. [2022-12-13 07:51:54,006 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 125 selfloop transitions, 6 changer transitions 19/153 dead transitions. [2022-12-13 07:51:54,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 153 transitions, 6117 flow [2022-12-13 07:51:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:51:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:51:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-13 07:51:54,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 07:51:54,007 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2022-12-13 07:51:54,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 153 transitions, 6117 flow [2022-12-13 07:51:54,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 134 transitions, 5371 flow [2022-12-13 07:51:54,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:54,031 INFO L89 Accepts]: Start accepts. Operand has 65 places, 134 transitions, 5371 flow [2022-12-13 07:51:54,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:54,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:54,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 134 transitions, 5371 flow [2022-12-13 07:51:54,037 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 134 transitions, 5371 flow [2022-12-13 07:51:54,037 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:51:54,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_In_1) (< v_~q1_back~0_In_1 v_~n1~0_In_1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= (+ v_~q1_back~0_In_1 1) v_~q1_back~0_Out_2) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_1| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (select (select |v_#memory_int_In_3| v_~q1~0.base_In_1) (+ v_~q1~0.offset_In_1 (* v_~q1_back~0_In_1 4))) 0) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_In_1, ~q1_back~0=v_~q1_back~0_In_1, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, ~n1~0=v_~n1~0_In_1, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, ~N~0=v_~N~0_In_1} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_2|, ~q1~0.offset=v_~q1~0.offset_In_1, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_2|, ~n1~0=v_~n1~0_In_1, ~N~0=v_~N~0_In_1, ~q1_back~0=v_~q1_back~0_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|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, 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~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-13 07:51:54,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:51:54,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 07:51:54,177 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 133 transitions, 5333 flow [2022-12-13 07:51:54,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:54,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:54,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:54,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 07:51:54,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:54,383 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 07:51:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash -583426440, now seen corresponding path program 1 times [2022-12-13 07:51:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:54,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001558649] [2022-12-13 07:51:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:55,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:55,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001558649] [2022-12-13 07:51:55,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001558649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:55,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:55,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:51:55,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549824958] [2022-12-13 07:51:55,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:55,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:51:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:55,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:51:55,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:51:55,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 07:51:55,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 133 transitions, 5333 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:55,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:55,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 07:51:55,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:56,338 INFO L130 PetriNetUnfolder]: 732/1168 cut-off events. [2022-12-13 07:51:56,338 INFO L131 PetriNetUnfolder]: For 1409/1409 co-relation queries the response was YES. [2022-12-13 07:51:56,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24260 conditions, 1168 events. 732/1168 cut-off events. For 1409/1409 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4892 event pairs, 53 based on Foata normal form. 1/830 useless extension candidates. Maximal degree in co-relation 13916. Up to 1159 conditions per place. [2022-12-13 07:51:56,349 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 130 selfloop transitions, 7 changer transitions 23/162 dead transitions. [2022-12-13 07:51:56,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 162 transitions, 6826 flow [2022-12-13 07:51:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 07:51:56,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3619047619047619 [2022-12-13 07:51:56,351 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2022-12-13 07:51:56,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 162 transitions, 6826 flow [2022-12-13 07:51:56,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 139 transitions, 5830 flow [2022-12-13 07:51:56,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:56,370 INFO L89 Accepts]: Start accepts. Operand has 69 places, 139 transitions, 5830 flow [2022-12-13 07:51:56,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:56,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:56,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 139 transitions, 5830 flow [2022-12-13 07:51:56,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 139 transitions, 5830 flow [2022-12-13 07:51:56,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:51:56,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:51:56,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:51:56,676 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:51:56,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308 [2022-12-13 07:51:56,677 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 137 transitions, 5750 flow [2022-12-13 07:51:56,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:56,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51: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, 1] [2022-12-13 07:51:56,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 07:51:56,678 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 07:51:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1206261753, now seen corresponding path program 1 times [2022-12-13 07:51:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:56,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198344826] [2022-12-13 07:51:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:57,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:57,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198344826] [2022-12-13 07:51:57,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198344826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:57,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:57,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:51:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325004651] [2022-12-13 07:51:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:57,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:57,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 07:51:57,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 137 transitions, 5750 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:57,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:57,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 07:51:57,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:58,103 INFO L130 PetriNetUnfolder]: 712/1139 cut-off events. [2022-12-13 07:51:58,103 INFO L131 PetriNetUnfolder]: For 2241/2241 co-relation queries the response was YES. [2022-12-13 07:51:58,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24829 conditions, 1139 events. 712/1139 cut-off events. For 2241/2241 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4741 event pairs, 67 based on Foata normal form. 1/804 useless extension candidates. Maximal degree in co-relation 14582. Up to 1130 conditions per place. [2022-12-13 07:51:58,111 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 129 selfloop transitions, 5 changer transitions 20/156 dead transitions. [2022-12-13 07:51:58,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 156 transitions, 6880 flow [2022-12-13 07:51:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:51:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:51:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-12-13 07:51:58,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2890625 [2022-12-13 07:51:58,128 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2022-12-13 07:51:58,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 156 transitions, 6880 flow [2022-12-13 07:51:58,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 136 transitions, 5974 flow [2022-12-13 07:51:58,144 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:58,144 INFO L89 Accepts]: Start accepts. Operand has 71 places, 136 transitions, 5974 flow [2022-12-13 07:51:58,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:58,147 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:58,147 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 136 transitions, 5974 flow [2022-12-13 07:51:58,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 136 transitions, 5974 flow [2022-12-13 07:51:58,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:51:58,150 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:58,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:51:58,151 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 136 transitions, 5974 flow [2022-12-13 07:51:58,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:58,152 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:58,152 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 07:51:58,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 07:51:58,153 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 07:51:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1905861092, now seen corresponding path program 1 times [2022-12-13 07:51:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:58,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506371288] [2022-12-13 07:51:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:58,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:58,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506371288] [2022-12-13 07:51:58,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506371288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:58,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:58,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:51:58,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826189803] [2022-12-13 07:51:58,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:58,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:51:58,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:58,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:51:58,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:51:58,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 07:51:58,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 136 transitions, 5974 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:58,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:58,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 07:51:58,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:59,334 INFO L130 PetriNetUnfolder]: 716/1139 cut-off events. [2022-12-13 07:51:59,335 INFO L131 PetriNetUnfolder]: For 1829/1829 co-relation queries the response was YES. [2022-12-13 07:51:59,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25978 conditions, 1139 events. 716/1139 cut-off events. For 1829/1829 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4736 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 15234. Up to 1132 conditions per place. [2022-12-13 07:51:59,343 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 124 selfloop transitions, 3 changer transitions 20/150 dead transitions. [2022-12-13 07:51:59,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 150 transitions, 6900 flow [2022-12-13 07:51:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 07:51:59,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-13 07:51:59,345 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2022-12-13 07:51:59,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 150 transitions, 6900 flow [2022-12-13 07:51:59,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 130 transitions, 5974 flow [2022-12-13 07:51:59,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:59,361 INFO L89 Accepts]: Start accepts. Operand has 72 places, 130 transitions, 5974 flow [2022-12-13 07:51:59,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:59,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:59,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 130 transitions, 5974 flow [2022-12-13 07:51:59,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 130 transitions, 5974 flow [2022-12-13 07:51:59,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:52:01,648 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:52:01,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2287 [2022-12-13 07:52:01,648 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 129 transitions, 5928 flow [2022-12-13 07:52:01,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:01,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:01,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:01,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 07:52:01,649 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 07:52:01,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:01,649 INFO L85 PathProgramCache]: Analyzing trace with hash -69587121, now seen corresponding path program 1 times [2022-12-13 07:52:01,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:01,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833400444] [2022-12-13 07:52:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:02,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 07:52:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:02,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833400444] [2022-12-13 07:52:02,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833400444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:52:02,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:52:02,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:52:02,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506423118] [2022-12-13 07:52:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:02,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:52:02,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:02,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:52:02,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:52:02,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:52:02,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 129 transitions, 5928 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:02,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:02,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:52:02,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:03,162 INFO L130 PetriNetUnfolder]: 729/1170 cut-off events. [2022-12-13 07:52:03,163 INFO L131 PetriNetUnfolder]: For 2113/2113 co-relation queries the response was YES. [2022-12-13 07:52:03,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27761 conditions, 1170 events. 729/1170 cut-off events. For 2113/2113 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4959 event pairs, 53 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 15900. Up to 1161 conditions per place. [2022-12-13 07:52:03,173 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 127 selfloop transitions, 9 changer transitions 24/162 dead transitions. [2022-12-13 07:52:03,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 162 transitions, 7782 flow [2022-12-13 07:52:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:52:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:52:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 07:52:03,174 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 07:52:03,175 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2022-12-13 07:52:03,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 162 transitions, 7782 flow [2022-12-13 07:52:03,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 138 transitions, 6600 flow [2022-12-13 07:52:03,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:03,193 INFO L89 Accepts]: Start accepts. Operand has 74 places, 138 transitions, 6600 flow [2022-12-13 07:52:03,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:03,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:03,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 138 transitions, 6600 flow [2022-12-13 07:52:03,199 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 138 transitions, 6600 flow [2022-12-13 07:52:03,199 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:52:03,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:52:03,400 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:52:03,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-13 07:52:03,401 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 136 transitions, 6506 flow [2022-12-13 07:52:03,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:03,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:03,401 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 07:52:03,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 07:52:03,401 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 07:52:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1401016566, now seen corresponding path program 1 times [2022-12-13 07:52:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:03,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517787120] [2022-12-13 07:52:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:03,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:04,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:04,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517787120] [2022-12-13 07:52:04,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517787120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:52:04,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:52:04,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:52:04,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28719993] [2022-12-13 07:52:04,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:04,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:52:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:52:04,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:52:04,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 07:52:04,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 136 transitions, 6506 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:04,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:04,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 07:52:04,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:05,070 INFO L130 PetriNetUnfolder]: 717/1134 cut-off events. [2022-12-13 07:52:05,070 INFO L131 PetriNetUnfolder]: For 2683/2683 co-relation queries the response was YES. [2022-12-13 07:52:05,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28094 conditions, 1134 events. 717/1134 cut-off events. For 2683/2683 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4662 event pairs, 48 based on Foata normal form. 1/796 useless extension candidates. Maximal degree in co-relation 16552. Up to 1127 conditions per place. [2022-12-13 07:52:05,080 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 122 selfloop transitions, 5 changer transitions 20/150 dead transitions. [2022-12-13 07:52:05,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 150 transitions, 7488 flow [2022-12-13 07:52:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:52:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:52:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 07:52:05,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 07:52:05,081 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 07:52:05,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 150 transitions, 7488 flow [2022-12-13 07:52:05,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 130 transitions, 6484 flow [2022-12-13 07:52:05,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:05,098 INFO L89 Accepts]: Start accepts. Operand has 74 places, 130 transitions, 6484 flow [2022-12-13 07:52:05,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:05,101 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:05,101 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 130 transitions, 6484 flow [2022-12-13 07:52:05,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 130 transitions, 6484 flow [2022-12-13 07:52:05,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:52:08,361 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:52:08,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3264 [2022-12-13 07:52:08,362 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 129 transitions, 6434 flow [2022-12-13 07:52:08,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:08,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:08,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:08,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 07:52:08,362 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 07:52:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1677077076, now seen corresponding path program 1 times [2022-12-13 07:52:08,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:08,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077481256] [2022-12-13 07:52:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:08,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:10,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:10,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077481256] [2022-12-13 07:52:10,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077481256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:52:10,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:52:10,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:52:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007751046] [2022-12-13 07:52:10,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:10,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:52:10,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:10,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:52:10,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:52:10,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:52:10,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 129 transitions, 6434 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:10,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:10,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:52:10,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:11,130 INFO L130 PetriNetUnfolder]: 731/1173 cut-off events. [2022-12-13 07:52:11,130 INFO L131 PetriNetUnfolder]: For 2000/2000 co-relation queries the response was YES. [2022-12-13 07:52:11,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30135 conditions, 1173 events. 731/1173 cut-off events. For 2000/2000 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4999 event pairs, 53 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 17218. Up to 1164 conditions per place. [2022-12-13 07:52:11,142 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 130 selfloop transitions, 7 changer transitions 23/162 dead transitions. [2022-12-13 07:52:11,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 8418 flow [2022-12-13 07:52:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:52:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:52:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 07:52:11,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37438423645320196 [2022-12-13 07:52:11,143 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 07:52:11,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 162 transitions, 8418 flow [2022-12-13 07:52:11,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 139 transitions, 7192 flow [2022-12-13 07:52:11,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:11,168 INFO L89 Accepts]: Start accepts. Operand has 77 places, 139 transitions, 7192 flow [2022-12-13 07:52:11,172 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:11,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:11,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 139 transitions, 7192 flow [2022-12-13 07:52:11,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 139 transitions, 7192 flow [2022-12-13 07:52:11,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:52:11,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:52:11,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:52:11,415 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:52:11,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-13 07:52:11,416 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 137 transitions, 7092 flow [2022-12-13 07:52:11,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:11,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:11,416 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 07:52:11,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 07:52:11,417 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 07:52:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1376830690, now seen corresponding path program 1 times [2022-12-13 07:52:11,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:11,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490204061] [2022-12-13 07:52:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:12,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490204061] [2022-12-13 07:52:12,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490204061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:52:12,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:52:12,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:52:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415559795] [2022-12-13 07:52:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:12,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:52:12,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:12,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:52:12,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:52:12,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 07:52:12,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 137 transitions, 7092 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:12,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:12,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 07:52:12,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:13,088 INFO L130 PetriNetUnfolder]: 721/1150 cut-off events. [2022-12-13 07:52:13,088 INFO L131 PetriNetUnfolder]: For 2331/2331 co-relation queries the response was YES. [2022-12-13 07:52:13,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30760 conditions, 1150 events. 721/1150 cut-off events. For 2331/2331 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4817 event pairs, 48 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 17884. Up to 1142 conditions per place. [2022-12-13 07:52:13,098 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 126 selfloop transitions, 2 changer transitions 26/156 dead transitions. [2022-12-13 07:52:13,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 156 transitions, 8412 flow [2022-12-13 07:52:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:52:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:52:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 07:52:13,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-13 07:52:13,100 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2022-12-13 07:52:13,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 156 transitions, 8412 flow [2022-12-13 07:52:13,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 130 transitions, 6996 flow [2022-12-13 07:52:13,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:13,122 INFO L89 Accepts]: Start accepts. Operand has 76 places, 130 transitions, 6996 flow [2022-12-13 07:52:13,126 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:13,126 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:13,126 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 130 transitions, 6996 flow [2022-12-13 07:52:13,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 130 transitions, 6996 flow [2022-12-13 07:52:13,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:52:16,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:52:16,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3517 [2022-12-13 07:52:16,639 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 129 transitions, 6942 flow [2022-12-13 07:52:16,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:16,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:16,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:16,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 07:52:16,640 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 07:52:16,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:16,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1363610600, now seen corresponding path program 1 times [2022-12-13 07:52:16,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:16,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157539089] [2022-12-13 07:52:16,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:16,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:18,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157539089] [2022-12-13 07:52:18,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157539089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:52:18,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:52:18,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:52:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440618423] [2022-12-13 07:52:18,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:18,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:52:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:18,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:52:18,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:52:18,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:52:18,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 129 transitions, 6942 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:18,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:18,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:52:18,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:19,368 INFO L130 PetriNetUnfolder]: 731/1173 cut-off events. [2022-12-13 07:52:19,368 INFO L131 PetriNetUnfolder]: For 2716/2716 co-relation queries the response was YES. [2022-12-13 07:52:19,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32463 conditions, 1173 events. 731/1173 cut-off events. For 2716/2716 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4968 event pairs, 53 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 18550. Up to 1164 conditions per place. [2022-12-13 07:52:19,378 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 129 selfloop transitions, 8 changer transitions 23/162 dead transitions. [2022-12-13 07:52:19,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 162 transitions, 9058 flow [2022-12-13 07:52:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:52:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:52:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 07:52:19,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 07:52:19,379 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2022-12-13 07:52:19,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 162 transitions, 9058 flow [2022-12-13 07:52:19,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 139 transitions, 7740 flow [2022-12-13 07:52:19,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:19,399 INFO L89 Accepts]: Start accepts. Operand has 80 places, 139 transitions, 7740 flow [2022-12-13 07:52:19,402 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:19,402 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:19,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 139 transitions, 7740 flow [2022-12-13 07:52:19,405 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 139 transitions, 7740 flow [2022-12-13 07:52:19,405 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:52:19,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:52:19,486 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:52:19,629 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:52:19,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-13 07:52:19,629 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 137 transitions, 7632 flow [2022-12-13 07:52:19,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:19,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:19,630 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 07:52:19,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 07:52:19,631 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 07:52:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 56579998, now seen corresponding path program 1 times [2022-12-13 07:52:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:19,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561231822] [2022-12-13 07:52:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:20,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 07:52:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:20,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561231822] [2022-12-13 07:52:20,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561231822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:52:20,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:52:20,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:52:20,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744646437] [2022-12-13 07:52:20,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:20,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:52:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:52:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:52:20,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 07:52:20,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 137 transitions, 7632 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:20,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:20,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 07:52:20,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:21,296 INFO L130 PetriNetUnfolder]: 767/1221 cut-off events. [2022-12-13 07:52:21,297 INFO L131 PetriNetUnfolder]: For 2943/2943 co-relation queries the response was YES. [2022-12-13 07:52:21,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35085 conditions, 1221 events. 767/1221 cut-off events. For 2943/2943 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5252 event pairs, 52 based on Foata normal form. 1/859 useless extension candidates. Maximal degree in co-relation 19216. Up to 1212 conditions per place. [2022-12-13 07:52:21,311 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 143 selfloop transitions, 14 changer transitions 6/165 dead transitions. [2022-12-13 07:52:21,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 165 transitions, 9550 flow [2022-12-13 07:52:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:52:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:52:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 07:52:21,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-13 07:52:21,315 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 53 predicate places. [2022-12-13 07:52:21,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 165 transitions, 9550 flow [2022-12-13 07:52:21,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 159 transitions, 9193 flow [2022-12-13 07:52:21,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:21,340 INFO L89 Accepts]: Start accepts. Operand has 85 places, 159 transitions, 9193 flow [2022-12-13 07:52:21,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:21,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:21,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 159 transitions, 9193 flow [2022-12-13 07:52:21,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 159 transitions, 9193 flow [2022-12-13 07:52:21,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 07:52:21,549 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:52:21,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-13 07:52:21,550 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 158 transitions, 9135 flow [2022-12-13 07:52:21,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:21,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:21,550 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 07:52:21,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 07:52:21,550 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 07:52:21,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:21,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1520735703, now seen corresponding path program 1 times [2022-12-13 07:52:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:21,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039259885] [2022-12-13 07:52:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:21,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:22,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039259885] [2022-12-13 07:52:22,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039259885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:52:22,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:52:22,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:52:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353425506] [2022-12-13 07:52:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:22,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:52:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:52:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:52:22,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-13 07:52:22,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 158 transitions, 9135 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:22,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:22,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-13 07:52:22,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:23,058 INFO L130 PetriNetUnfolder]: 774/1236 cut-off events. [2022-12-13 07:52:23,058 INFO L131 PetriNetUnfolder]: For 3412/3412 co-relation queries the response was YES. [2022-12-13 07:52:23,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36718 conditions, 1236 events. 774/1236 cut-off events. For 3412/3412 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5301 event pairs, 48 based on Foata normal form. 1/874 useless extension candidates. Maximal degree in co-relation 19868. Up to 1227 conditions per place. [2022-12-13 07:52:23,070 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 150 selfloop transitions, 10 changer transitions 15/179 dead transitions. [2022-12-13 07:52:23,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 179 transitions, 10729 flow [2022-12-13 07:52:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:52:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:52:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 07:52:23,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.329004329004329 [2022-12-13 07:52:23,072 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2022-12-13 07:52:23,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 179 transitions, 10729 flow [2022-12-13 07:52:23,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 164 transitions, 9809 flow [2022-12-13 07:52:23,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:23,098 INFO L89 Accepts]: Start accepts. Operand has 88 places, 164 transitions, 9809 flow [2022-12-13 07:52:23,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:23,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:23,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 164 transitions, 9809 flow [2022-12-13 07:52:23,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 164 transitions, 9809 flow [2022-12-13 07:52:23,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 07:52:23,107 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:23,107 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:52:23,107 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 164 transitions, 9809 flow [2022-12-13 07:52:23,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:23,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:23,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:23,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 07:52:23,108 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 07:52:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash -806765308, now seen corresponding path program 1 times [2022-12-13 07:52:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:23,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300614501] [2022-12-13 07:52:23,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:23,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:24,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:24,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300614501] [2022-12-13 07:52:24,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300614501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:52:24,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:52:24,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:52:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271925414] [2022-12-13 07:52:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:24,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:52:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:24,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:52:24,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:52:24,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 07:52:24,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 164 transitions, 9809 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:24,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:24,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 07:52:24,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:24,872 INFO L130 PetriNetUnfolder]: 730/1184 cut-off events. [2022-12-13 07:52:24,872 INFO L131 PetriNetUnfolder]: For 4197/4197 co-relation queries the response was YES. [2022-12-13 07:52:24,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36206 conditions, 1184 events. 730/1184 cut-off events. For 4197/4197 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5080 event pairs, 53 based on Foata normal form. 6/850 useless extension candidates. Maximal degree in co-relation 20534. Up to 1173 conditions per place. [2022-12-13 07:52:24,883 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 129 selfloop transitions, 9 changer transitions 35/175 dead transitions. [2022-12-13 07:52:24,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 175 transitions, 10810 flow [2022-12-13 07:52:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:52:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:52:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-13 07:52:24,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.328125 [2022-12-13 07:52:24,885 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2022-12-13 07:52:24,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 175 transitions, 10810 flow [2022-12-13 07:52:24,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 140 transitions, 8620 flow [2022-12-13 07:52:24,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:24,910 INFO L89 Accepts]: Start accepts. Operand has 89 places, 140 transitions, 8620 flow [2022-12-13 07:52:24,914 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:24,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:24,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 140 transitions, 8620 flow [2022-12-13 07:52:24,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 140 transitions, 8620 flow [2022-12-13 07:52:24,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-13 07:52:38,482 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [905] L65-2-->thread2EXIT: Formula: (and (= (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_79| (+ (select (select |v_#memory_int_390| v_~q2~0.base_149) (+ v_~q2~0.offset_149 (* 4 v_~q2_back~0_208))) 1)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (= (+ v_~q2_back~0_208 1) v_~q2_back~0_207) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_45| 0) (= v_~q1_front~0_163 (+ v_~q1_front~0_164 1)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (= (select (select |v_#memory_int_390| v_~q1~0.base_140) (+ v_~q1~0.offset_140 (* v_~q1_front~0_164 4))) |v_thread2Thread1of1ForFork0_~j~0#1_79|) (not (= (ite (and (<= 0 v_~q2_back~0_208) (< v_~q2_back~0_208 v_~n2~0_140)) 1 0) 0)) (not (= (ite (and (< v_~q1_front~0_164 v_~q1_back~0_230) (< v_~q1_front~0_164 v_~n1~0_161) (<= 0 v_~q1_front~0_164)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_45| 0) (<= |v_thread2Thread1of1ForFork0_~j~0#1_79| 0) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_79| v_~s~0_143) v_~s~0_142)) InVars {~q1~0.offset=v_~q1~0.offset_140, ~n2~0=v_~n2~0_140, ~q1_front~0=v_~q1_front~0_164, ~q1_back~0=v_~q1_back~0_230, ~q2~0.offset=v_~q2~0.offset_149, ~n1~0=v_~n1~0_161, ~q1~0.base=v_~q1~0.base_140, #memory_int=|v_#memory_int_390|, ~q2~0.base=v_~q2~0.base_149, ~q2_back~0=v_~q2_back~0_208, ~s~0=v_~s~0_143} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_79|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_47|, ~q1~0.offset=v_~q1~0.offset_140, ~n2~0=v_~n2~0_140, ~q1_front~0=v_~q1_front~0_163, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_45|, ~q2~0.offset=v_~q2~0.offset_149, ~n1~0=v_~n1~0_161, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_35|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_35|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_47|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_45|, ~q1_back~0=v_~q1_back~0_230, ~q1~0.base=v_~q1~0.base_140, #memory_int=|v_#memory_int_390|, ~q2~0.base=v_~q2~0.base_149, ~q2_back~0=v_~q2_back~0_207, ~s~0=v_~s~0_142} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:52:38,597 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 07:52:38,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13687 [2022-12-13 07:52:38,597 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 137 transitions, 8436 flow [2022-12-13 07:52:38,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:38,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:38,598 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 07:52:38,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 07:52:38,598 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 07:52:38,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:38,598 INFO L85 PathProgramCache]: Analyzing trace with hash -800007621, now seen corresponding path program 1 times [2022-12-13 07:52:38,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:38,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277132240] [2022-12-13 07:52:38,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:38,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:39,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277132240] [2022-12-13 07:52:39,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277132240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:52:39,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:52:39,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:52:39,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606267113] [2022-12-13 07:52:39,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:39,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:52:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:39,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:52:39,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:52:39,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 07:52:39,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 137 transitions, 8436 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:39,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:39,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 07:52:39,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:40,239 INFO L130 PetriNetUnfolder]: 717/1140 cut-off events. [2022-12-13 07:52:40,239 INFO L131 PetriNetUnfolder]: For 3164/3164 co-relation queries the response was YES. [2022-12-13 07:52:40,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36135 conditions, 1140 events. 717/1140 cut-off events. For 3164/3164 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4740 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 21186. Up to 1133 conditions per place. [2022-12-13 07:52:40,251 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 125 selfloop transitions, 3 changer transitions 20/151 dead transitions. [2022-12-13 07:52:40,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 151 transitions, 9616 flow [2022-12-13 07:52:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:52:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:52:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 07:52:40,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 07:52:40,253 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2022-12-13 07:52:40,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 151 transitions, 9616 flow [2022-12-13 07:52:40,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 131 transitions, 8336 flow [2022-12-13 07:52:40,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:40,278 INFO L89 Accepts]: Start accepts. Operand has 83 places, 131 transitions, 8336 flow [2022-12-13 07:52:40,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:40,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:40,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 131 transitions, 8336 flow [2022-12-13 07:52:40,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 131 transitions, 8336 flow [2022-12-13 07:52:40,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:52:45,932 WARN L233 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 229 DAG size of output: 226 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:52:55,255 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 211 DAG size of output: 209 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:53:01,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:53:01,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21301 [2022-12-13 07:53:01,579 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 130 transitions, 8272 flow [2022-12-13 07:53:01,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:01,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:01,579 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 07:53:01,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 07:53:01,580 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 07:53:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash -555694711, now seen corresponding path program 1 times [2022-12-13 07:53:01,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:01,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461818162] [2022-12-13 07:53:01,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:01,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:02,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461818162] [2022-12-13 07:53:02,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461818162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:53:02,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:53:02,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:53:02,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046809213] [2022-12-13 07:53:02,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:53:02,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:53:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:02,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:53:02,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:53:02,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 07:53:02,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 130 transitions, 8272 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:02,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:02,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 07:53:02,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:03,084 INFO L130 PetriNetUnfolder]: 729/1169 cut-off events. [2022-12-13 07:53:03,085 INFO L131 PetriNetUnfolder]: For 3387/3387 co-relation queries the response was YES. [2022-12-13 07:53:03,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38099 conditions, 1169 events. 729/1169 cut-off events. For 3387/3387 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4942 event pairs, 53 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 21852. Up to 1160 conditions per place. [2022-12-13 07:53:03,097 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 128 selfloop transitions, 7 changer transitions 24/161 dead transitions. [2022-12-13 07:53:03,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 161 transitions, 10584 flow [2022-12-13 07:53:03,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:53:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:53:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 07:53:03,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 07:53:03,098 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2022-12-13 07:53:03,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 161 transitions, 10584 flow [2022-12-13 07:53:03,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 137 transitions, 8970 flow [2022-12-13 07:53:03,124 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:03,124 INFO L89 Accepts]: Start accepts. Operand has 87 places, 137 transitions, 8970 flow [2022-12-13 07:53:03,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:03,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:03,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 137 transitions, 8970 flow [2022-12-13 07:53:03,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 137 transitions, 8970 flow [2022-12-13 07:53:03,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:53:03,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [909] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_49| 0) (= v_~s~0_154 (+ |v_thread2Thread1of1ForFork0_~j~0#1_83| v_~s~0_155)) (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_thread2Thread1of1ForFork0_#res#1.offset_49| 0) (not (= (ite (and (<= 0 v_~q2_back~0_220) (< v_~q2_back~0_220 v_~n2~0_148)) 1 0) 0)) (= (+ v_~q2_back~0_220 1) v_~q2_back~0_219) (<= |v_thread2Thread1of1ForFork0_~j~0#1_83| 0) (= (+ v_~q1_front~0_176 1) v_~q1_front~0_175) (not (= (ite (and (<= 0 v_~q1_front~0_176) (< v_~q1_front~0_176 v_~q1_back~0_238) (< v_~q1_front~0_176 v_~n1~0_169)) 1 0) 0)) (= (select (select |v_#memory_int_408| v_~q1~0.base_148) (+ v_~q1~0.offset_148 (* v_~q1_front~0_176 4))) |v_thread2Thread1of1ForFork0_~j~0#1_83|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83| (ite (= (+ (select (select |v_#memory_int_408| v_~q2~0.base_159) (+ v_~q2~0.offset_159 (* 4 v_~q2_back~0_220))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_83|) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_148, ~n2~0=v_~n2~0_148, ~q1_front~0=v_~q1_front~0_176, ~q1_back~0=v_~q1_back~0_238, ~q2~0.offset=v_~q2~0.offset_159, ~n1~0=v_~n1~0_169, ~q1~0.base=v_~q1~0.base_148, #memory_int=|v_#memory_int_408|, ~q2~0.base=v_~q2~0.base_159, ~q2_back~0=v_~q2_back~0_220, ~s~0=v_~s~0_155} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_83|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_51|, ~q1~0.offset=v_~q1~0.offset_148, ~n2~0=v_~n2~0_148, ~q1_front~0=v_~q1_front~0_175, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_49|, ~q2~0.offset=v_~q2~0.offset_159, ~n1~0=v_~n1~0_169, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_39|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_39|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_51|, 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_49|, ~q1_back~0=v_~q1_back~0_238, ~q1~0.base=v_~q1~0.base_148, #memory_int=|v_#memory_int_408|, ~q2~0.base=v_~q2~0.base_159, ~q2_back~0=v_~q2_back~0_219, ~s~0=v_~s~0_154} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:53:03,340 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:53:03,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-13 07:53:03,341 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 135 transitions, 8840 flow [2022-12-13 07:53:03,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:03,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:03,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 07:53:03,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 07:53:03,341 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 07:53:03,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash 367083330, now seen corresponding path program 1 times [2022-12-13 07:53:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:03,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988439631] [2022-12-13 07:53:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:04,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:04,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988439631] [2022-12-13 07:53:04,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988439631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:53:04,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:53:04,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:53:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781841934] [2022-12-13 07:53:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:53:04,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:53:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:53:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:53:04,257 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 07:53:04,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 135 transitions, 8840 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:04,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:04,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 07:53:04,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:04,543 INFO L130 PetriNetUnfolder]: 716/1138 cut-off events. [2022-12-13 07:53:04,543 INFO L131 PetriNetUnfolder]: For 4423/4423 co-relation queries the response was YES. [2022-12-13 07:53:04,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38312 conditions, 1138 events. 716/1138 cut-off events. For 4423/4423 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4731 event pairs, 48 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 22504. Up to 1131 conditions per place. [2022-12-13 07:53:04,555 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 124 selfloop transitions, 2 changer transitions 20/149 dead transitions. [2022-12-13 07:53:04,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 149 transitions, 10072 flow [2022-12-13 07:53:04,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:53:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:53:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 07:53:04,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 07:53:04,557 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2022-12-13 07:53:04,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 149 transitions, 10072 flow [2022-12-13 07:53:04,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 129 transitions, 8714 flow [2022-12-13 07:53:04,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:04,583 INFO L89 Accepts]: Start accepts. Operand has 86 places, 129 transitions, 8714 flow [2022-12-13 07:53:04,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:04,587 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:04,587 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 129 transitions, 8714 flow [2022-12-13 07:53:04,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 129 transitions, 8714 flow [2022-12-13 07:53:04,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:53:04,590 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:53:04,591 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:53:04,591 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 129 transitions, 8714 flow [2022-12-13 07:53:04,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:04,591 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:04,591 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:53:04,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 07:53:04,591 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 07:53:04,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1987590599, now seen corresponding path program 1 times [2022-12-13 07:53:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:04,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514062645] [2022-12-13 07:53:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:04,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:06,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:06,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514062645] [2022-12-13 07:53:06,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514062645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:53:06,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:53:06,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:53:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266801924] [2022-12-13 07:53:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:53:06,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:53:06,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:06,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:53:06,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:53:06,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:53:06,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 129 transitions, 8714 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:06,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:06,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:53:06,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:07,395 INFO L130 PetriNetUnfolder]: 733/1170 cut-off events. [2022-12-13 07:53:07,395 INFO L131 PetriNetUnfolder]: For 3245/3245 co-relation queries the response was YES. [2022-12-13 07:53:07,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40426 conditions, 1170 events. 733/1170 cut-off events. For 3245/3245 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4935 event pairs, 53 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 23170. Up to 1161 conditions per place. [2022-12-13 07:53:07,410 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 130 selfloop transitions, 9 changer transitions 23/164 dead transitions. [2022-12-13 07:53:07,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 11426 flow [2022-12-13 07:53:07,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:53:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:53:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 07:53:07,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 07:53:07,412 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2022-12-13 07:53:07,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 164 transitions, 11426 flow [2022-12-13 07:53:07,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 141 transitions, 9786 flow [2022-12-13 07:53:07,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:07,440 INFO L89 Accepts]: Start accepts. Operand has 92 places, 141 transitions, 9786 flow [2022-12-13 07:53:07,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:07,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:07,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 141 transitions, 9786 flow [2022-12-13 07:53:07,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 141 transitions, 9786 flow [2022-12-13 07:53:07,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:53:07,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:53:07,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [912] L65-2-->thread2EXIT: Formula: (and (= (+ v_~q2_back~0_228 1) v_~q2_back~0_227) (= |v_thread2Thread1of1ForFork0_#res#1.base_53| 0) (= (select (select |v_#memory_int_418| v_~q1~0.base_154) (+ v_~q1~0.offset_154 (* v_~q1_front~0_188 4))) |v_thread2Thread1of1ForFork0_~j~0#1_89|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91| (ite (= (+ (select (select |v_#memory_int_418| v_~q2~0.base_163) (+ (* 4 v_~q2_back~0_228) v_~q2~0.offset_163)) 1) |v_thread2Thread1of1ForFork0_~j~0#1_89|) 1 0)) (= v_~q1_front~0_187 (+ v_~q1_front~0_188 1)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_53| 0) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_89| v_~s~0_163) v_~s~0_162) (<= |v_thread2Thread1of1ForFork0_~j~0#1_89| 0) (not (= (ite (and (< v_~q1_front~0_188 v_~n1~0_175) (<= 0 v_~q1_front~0_188) (< v_~q1_front~0_188 v_~q1_back~0_244)) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_228 v_~n2~0_152) (<= 0 v_~q2_back~0_228)) 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 {~q1~0.offset=v_~q1~0.offset_154, ~n2~0=v_~n2~0_152, ~q1_front~0=v_~q1_front~0_188, ~q1_back~0=v_~q1_back~0_244, ~q2~0.offset=v_~q2~0.offset_163, ~n1~0=v_~n1~0_175, ~q1~0.base=v_~q1~0.base_154, #memory_int=|v_#memory_int_418|, ~q2~0.base=v_~q2~0.base_163, ~q2_back~0=v_~q2_back~0_228, ~s~0=v_~s~0_163} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_89|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_55|, ~q1~0.offset=v_~q1~0.offset_154, ~n2~0=v_~n2~0_152, ~q1_front~0=v_~q1_front~0_187, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_53|, ~q2~0.offset=v_~q2~0.offset_163, ~n1~0=v_~n1~0_175, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_45|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_45|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_55|, 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_53|, ~q1_back~0=v_~q1_back~0_244, ~q1~0.base=v_~q1~0.base_154, #memory_int=|v_#memory_int_418|, ~q2~0.base=v_~q2~0.base_163, ~q2_back~0=v_~q2_back~0_227, ~s~0=v_~s~0_162} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:53:07,949 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 07:53:07,950 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 510 [2022-12-13 07:53:07,950 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 138 transitions, 9580 flow [2022-12-13 07:53:07,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:07,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:07,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:53:07,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 07:53:07,951 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 07:53:07,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:07,951 INFO L85 PathProgramCache]: Analyzing trace with hash 906316637, now seen corresponding path program 1 times [2022-12-13 07:53:07,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:07,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892916816] [2022-12-13 07:53:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:09,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:09,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892916816] [2022-12-13 07:53:09,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892916816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:53:09,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:53:09,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:53:09,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131352312] [2022-12-13 07:53:09,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:53:09,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:53:09,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:09,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:53:09,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:53:09,372 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-13 07:53:09,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 138 transitions, 9580 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:09,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:09,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-13 07:53:09,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:09,905 INFO L130 PetriNetUnfolder]: 723/1159 cut-off events. [2022-12-13 07:53:09,905 INFO L131 PetriNetUnfolder]: For 5792/5792 co-relation queries the response was YES. [2022-12-13 07:53:09,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41254 conditions, 1159 events. 723/1159 cut-off events. For 5792/5792 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4875 event pairs, 47 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 23836. Up to 1150 conditions per place. [2022-12-13 07:53:09,919 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 132 selfloop transitions, 11 changer transitions 20/165 dead transitions. [2022-12-13 07:53:09,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 165 transitions, 11798 flow [2022-12-13 07:53:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:53:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:53:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 07:53:09,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2022-12-13 07:53:09,920 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2022-12-13 07:53:09,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 165 transitions, 11798 flow [2022-12-13 07:53:09,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 145 transitions, 10332 flow [2022-12-13 07:53:09,948 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:09,948 INFO L89 Accepts]: Start accepts. Operand has 95 places, 145 transitions, 10332 flow [2022-12-13 07:53:09,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:09,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:09,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 145 transitions, 10332 flow [2022-12-13 07:53:09,956 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 145 transitions, 10332 flow [2022-12-13 07:53:09,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 07:53:10,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [916] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_57| 0) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_93| v_~s~0_171) v_~s~0_170) (= (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_93| (+ (select (select |v_#memory_int_436| v_~q2~0.base_169) (+ v_~q2~0.offset_169 (* 4 v_~q2_back~0_236))) 1)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| 0)) (= (+ v_~q2_back~0_236 1) v_~q2_back~0_235) (= (select (select |v_#memory_int_436| v_~q1~0.base_158) (+ (* v_~q1_front~0_196 4) v_~q1~0.offset_158)) |v_thread2Thread1of1ForFork0_~j~0#1_93|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_57| 0) (= (+ v_~q1_front~0_196 1) v_~q1_front~0_195) (<= |v_thread2Thread1of1ForFork0_~j~0#1_93| 0) (not (= (ite (and (<= 0 v_~q2_back~0_236) (< v_~q2_back~0_236 v_~n2~0_156)) 1 0) 0)) (not (= (ite (and (< v_~q1_front~0_196 v_~n1~0_179) (< v_~q1_front~0_196 v_~q1_back~0_248) (<= 0 v_~q1_front~0_196)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|)) InVars {~q1~0.offset=v_~q1~0.offset_158, ~n2~0=v_~n2~0_156, ~q1_front~0=v_~q1_front~0_196, ~q1_back~0=v_~q1_back~0_248, ~q2~0.offset=v_~q2~0.offset_169, ~n1~0=v_~n1~0_179, ~q1~0.base=v_~q1~0.base_158, #memory_int=|v_#memory_int_436|, ~q2~0.base=v_~q2~0.base_169, ~q2_back~0=v_~q2_back~0_236, ~s~0=v_~s~0_171} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_93|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_59|, ~q1~0.offset=v_~q1~0.offset_158, ~n2~0=v_~n2~0_156, ~q1_front~0=v_~q1_front~0_195, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_57|, ~q2~0.offset=v_~q2~0.offset_169, ~n1~0=v_~n1~0_179, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_49|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_49|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_57|, ~q1_back~0=v_~q1_back~0_248, ~q1~0.base=v_~q1~0.base_158, #memory_int=|v_#memory_int_436|, ~q2~0.base=v_~q2~0.base_169, ~q2_back~0=v_~q2_back~0_235, ~s~0=v_~s~0_170} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:53:10,166 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:53:10,167 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-13 07:53:10,167 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 143 transitions, 10190 flow [2022-12-13 07:53:10,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:10,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:10,167 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 07:53:10,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 07:53:10,167 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 07:53:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2041592197, now seen corresponding path program 1 times [2022-12-13 07:53:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:10,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762219883] [2022-12-13 07:53:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:10,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:11,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 07:53:11,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:11,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762219883] [2022-12-13 07:53:11,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762219883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:53:11,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:53:11,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:53:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968837781] [2022-12-13 07:53:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:53:11,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:53:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:11,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:53:11,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:53:11,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-13 07:53:11,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 143 transitions, 10190 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:11,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:11,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-13 07:53:11,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:11,974 INFO L130 PetriNetUnfolder]: 719/1148 cut-off events. [2022-12-13 07:53:11,974 INFO L131 PetriNetUnfolder]: For 6318/6318 co-relation queries the response was YES. [2022-12-13 07:53:11,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42008 conditions, 1148 events. 719/1148 cut-off events. For 6318/6318 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4779 event pairs, 47 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 24488. Up to 1140 conditions per place. [2022-12-13 07:53:11,988 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 126 selfloop transitions, 6 changer transitions 21/157 dead transitions. [2022-12-13 07:53:11,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 157 transitions, 11520 flow [2022-12-13 07:53:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:53:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:53:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 07:53:12,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3246753246753247 [2022-12-13 07:53:12,008 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2022-12-13 07:53:12,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 157 transitions, 11520 flow [2022-12-13 07:53:12,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 136 transitions, 9968 flow [2022-12-13 07:53:12,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:12,036 INFO L89 Accepts]: Start accepts. Operand has 96 places, 136 transitions, 9968 flow [2022-12-13 07:53:12,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:12,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:12,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 136 transitions, 9968 flow [2022-12-13 07:53:12,044 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 136 transitions, 9968 flow [2022-12-13 07:53:12,044 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:53:21,751 WARN L233 SmtUtils]: Spent 6.96s on a formula simplification. DAG size of input: 271 DAG size of output: 266 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:53:33,511 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:53:39,795 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:53:39,796 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27760 [2022-12-13 07:53:39,796 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 135 transitions, 9894 flow [2022-12-13 07:53:39,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:39,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:39,796 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 07:53:39,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 07:53:39,796 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 07:53:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1229590032, now seen corresponding path program 1 times [2022-12-13 07:53:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:39,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455618996] [2022-12-13 07:53:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:41,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:41,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455618996] [2022-12-13 07:53:41,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455618996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:53:41,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:53:41,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:53:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249425340] [2022-12-13 07:53:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:53:41,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:53:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:41,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:53:41,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:53:41,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 07:53:41,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 135 transitions, 9894 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:41,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:41,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 07:53:41,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:41,679 INFO L130 PetriNetUnfolder]: 784/1249 cut-off events. [2022-12-13 07:53:41,679 INFO L131 PetriNetUnfolder]: For 4616/4616 co-relation queries the response was YES. [2022-12-13 07:53:41,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46934 conditions, 1249 events. 784/1249 cut-off events. For 4616/4616 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5340 event pairs, 48 based on Foata normal form. 1/884 useless extension candidates. Maximal degree in co-relation 25154. Up to 1241 conditions per place. [2022-12-13 07:53:41,695 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 148 selfloop transitions, 13 changer transitions 6/169 dead transitions. [2022-12-13 07:53:41,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 169 transitions, 12742 flow [2022-12-13 07:53:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:53:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:53:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-13 07:53:41,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-13 07:53:41,697 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2022-12-13 07:53:41,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 169 transitions, 12742 flow [2022-12-13 07:53:41,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 163 transitions, 12277 flow [2022-12-13 07:53:41,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:41,729 INFO L89 Accepts]: Start accepts. Operand has 99 places, 163 transitions, 12277 flow [2022-12-13 07:53:41,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:41,735 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:41,735 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 163 transitions, 12277 flow [2022-12-13 07:53:41,739 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 163 transitions, 12277 flow [2022-12-13 07:53:41,739 INFO L226 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-13 07:53:41,740 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:53:41,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 07:53:41,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 163 transitions, 12277 flow [2022-12-13 07:53:41,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:41,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:41,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:53:41,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 07:53:41,744 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 07:53:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash 959412242, now seen corresponding path program 1 times [2022-12-13 07:53:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:41,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025636008] [2022-12-13 07:53:41,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:43,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025636008] [2022-12-13 07:53:43,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025636008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:53:43,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:53:43,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:53:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191938236] [2022-12-13 07:53:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:53:43,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:53:43,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:43,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:53:43,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:53:43,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 07:53:43,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 163 transitions, 12277 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:43,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:43,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 07:53:43,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:44,105 INFO L130 PetriNetUnfolder]: 738/1202 cut-off events. [2022-12-13 07:53:44,106 INFO L131 PetriNetUnfolder]: For 5716/5716 co-relation queries the response was YES. [2022-12-13 07:53:44,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46098 conditions, 1202 events. 738/1202 cut-off events. For 5716/5716 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5180 event pairs, 53 based on Foata normal form. 6/869 useless extension candidates. Maximal degree in co-relation 25820. Up to 1190 conditions per place. [2022-12-13 07:53:44,120 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 129 selfloop transitions, 7 changer transitions 40/178 dead transitions. [2022-12-13 07:53:44,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 178 transitions, 13766 flow [2022-12-13 07:53:44,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:53:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:53:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 07:53:44,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3375 [2022-12-13 07:53:44,121 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2022-12-13 07:53:44,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 178 transitions, 13766 flow [2022-12-13 07:53:44,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 138 transitions, 10660 flow [2022-12-13 07:53:44,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:44,184 INFO L89 Accepts]: Start accepts. Operand has 99 places, 138 transitions, 10660 flow [2022-12-13 07:53:44,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:44,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:44,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 138 transitions, 10660 flow [2022-12-13 07:53:44,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 138 transitions, 10660 flow [2022-12-13 07:53:44,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:53:44,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:54:06,304 WARN L233 SmtUtils]: Spent 14.24s on a formula simplification. DAG size of input: 252 DAG size of output: 249 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:54:12,597 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 230 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:54:20,076 WARN L233 SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 273 DAG size of output: 270 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:54:24,312 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 07:54:24,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40129 [2022-12-13 07:54:24,313 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 135 transitions, 10428 flow [2022-12-13 07:54:24,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:24,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:24,313 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 07:54:24,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 07:54:24,313 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 07:54:24,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2041393763, now seen corresponding path program 1 times [2022-12-13 07:54:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:24,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901814017] [2022-12-13 07:54:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:25,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:25,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901814017] [2022-12-13 07:54:25,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901814017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:54:25,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:54:25,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:54:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398410433] [2022-12-13 07:54:25,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:54:25,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:54:25,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:25,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:54:25,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:54:25,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 07:54:25,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 135 transitions, 10428 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:25,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:25,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 07:54:25,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:25,607 INFO L130 PetriNetUnfolder]: 716/1138 cut-off events. [2022-12-13 07:54:25,607 INFO L131 PetriNetUnfolder]: For 5844/5844 co-relation queries the response was YES. [2022-12-13 07:54:25,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45056 conditions, 1138 events. 716/1138 cut-off events. For 5844/5844 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4748 event pairs, 48 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 26472. Up to 1131 conditions per place. [2022-12-13 07:54:25,620 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 124 selfloop transitions, 2 changer transitions 20/149 dead transitions. [2022-12-13 07:54:25,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 149 transitions, 11828 flow [2022-12-13 07:54:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:54:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:54:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 07:54:25,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 07:54:25,621 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2022-12-13 07:54:25,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 149 transitions, 11828 flow [2022-12-13 07:54:25,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 129 transitions, 10234 flow [2022-12-13 07:54:25,681 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:25,681 INFO L89 Accepts]: Start accepts. Operand has 96 places, 129 transitions, 10234 flow [2022-12-13 07:54:25,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:25,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:25,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 129 transitions, 10234 flow [2022-12-13 07:54:25,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 129 transitions, 10234 flow [2022-12-13 07:54:25,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:54:25,689 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:54:25,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:54:25,690 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 129 transitions, 10234 flow [2022-12-13 07:54:25,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:25,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:25,690 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:54:25,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 07:54:25,690 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 07:54:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash -267060433, now seen corresponding path program 1 times [2022-12-13 07:54:25,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:25,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681178658] [2022-12-13 07:54:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:25,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:27,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 07:54:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681178658] [2022-12-13 07:54:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681178658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:54:27,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:54:27,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:54:27,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083599851] [2022-12-13 07:54:27,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:54:27,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:54:27,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:27,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:54:27,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:54:27,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:54:27,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 129 transitions, 10234 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:27,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:27,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:54:27,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:28,336 INFO L130 PetriNetUnfolder]: 731/1173 cut-off events. [2022-12-13 07:54:28,336 INFO L131 PetriNetUnfolder]: For 4275/4275 co-relation queries the response was YES. [2022-12-13 07:54:28,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47465 conditions, 1173 events. 731/1173 cut-off events. For 4275/4275 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5011 event pairs, 53 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 27138. Up to 1164 conditions per place. [2022-12-13 07:54:28,350 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 130 selfloop transitions, 7 changer transitions 23/162 dead transitions. [2022-12-13 07:54:28,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 162 transitions, 13198 flow [2022-12-13 07:54:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:54:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:54:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 07:54:28,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37438423645320196 [2022-12-13 07:54:28,352 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2022-12-13 07:54:28,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 162 transitions, 13198 flow [2022-12-13 07:54:28,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 139 transitions, 11282 flow [2022-12-13 07:54:28,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:28,382 INFO L89 Accepts]: Start accepts. Operand has 101 places, 139 transitions, 11282 flow [2022-12-13 07:54:28,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:28,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:28,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 139 transitions, 11282 flow [2022-12-13 07:54:28,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 139 transitions, 11282 flow [2022-12-13 07:54:28,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:54:28,393 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:54:28,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:54:28,635 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:54:28,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-13 07:54:28,635 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 137 transitions, 11122 flow [2022-12-13 07:54:28,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:28,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:28,636 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:54:28,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 07:54:28,636 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 07:54:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:28,636 INFO L85 PathProgramCache]: Analyzing trace with hash -519196899, now seen corresponding path program 1 times [2022-12-13 07:54:28,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:28,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069162037] [2022-12-13 07:54:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:28,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:29,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 07:54:29,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:29,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069162037] [2022-12-13 07:54:29,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069162037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:54:29,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:54:29,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:54:29,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508916642] [2022-12-13 07:54:29,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:54:29,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:54:29,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:29,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:54:29,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:54:29,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 07:54:29,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 137 transitions, 11122 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:29,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:29,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 07:54:29,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:30,437 INFO L130 PetriNetUnfolder]: 719/1147 cut-off events. [2022-12-13 07:54:30,437 INFO L131 PetriNetUnfolder]: For 6165/6165 co-relation queries the response was YES. [2022-12-13 07:54:30,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47659 conditions, 1147 events. 719/1147 cut-off events. For 6165/6165 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4810 event pairs, 48 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 27804. Up to 1139 conditions per place. [2022-12-13 07:54:30,452 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 129 selfloop transitions, 5 changer transitions 20/156 dead transitions. [2022-12-13 07:54:30,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 156 transitions, 13012 flow [2022-12-13 07:54:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:54:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:54:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-12-13 07:54:30,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29838709677419356 [2022-12-13 07:54:30,454 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 74 predicate places. [2022-12-13 07:54:30,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 156 transitions, 13012 flow [2022-12-13 07:54:30,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 136 transitions, 11306 flow [2022-12-13 07:54:30,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:30,493 INFO L89 Accepts]: Start accepts. Operand has 103 places, 136 transitions, 11306 flow [2022-12-13 07:54:30,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:30,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:30,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 136 transitions, 11306 flow [2022-12-13 07:54:30,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 136 transitions, 11306 flow [2022-12-13 07:54:30,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:54:30,503 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:54:30,504 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:54:30,504 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 11306 flow [2022-12-13 07:54:30,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:30,504 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:30,506 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 07:54:30,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 07:54:30,506 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 07:54:30,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1407331720, now seen corresponding path program 1 times [2022-12-13 07:54:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:30,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073371203] [2022-12-13 07:54:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:32,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073371203] [2022-12-13 07:54:32,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073371203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:54:32,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:54:32,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:54:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784320460] [2022-12-13 07:54:32,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:54:32,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:54:32,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:54:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:54:32,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 07:54:32,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 11306 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:32,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:32,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 07:54:32,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:32,530 INFO L130 PetriNetUnfolder]: 716/1139 cut-off events. [2022-12-13 07:54:32,531 INFO L131 PetriNetUnfolder]: For 5418/5418 co-relation queries the response was YES. [2022-12-13 07:54:32,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48471 conditions, 1139 events. 716/1139 cut-off events. For 5418/5418 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4752 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 28456. Up to 1132 conditions per place. [2022-12-13 07:54:32,546 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 124 selfloop transitions, 3 changer transitions 20/150 dead transitions. [2022-12-13 07:54:32,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 150 transitions, 12792 flow [2022-12-13 07:54:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:54:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:54:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 07:54:32,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 07:54:32,547 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2022-12-13 07:54:32,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 150 transitions, 12792 flow [2022-12-13 07:54:32,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 130 transitions, 11080 flow [2022-12-13 07:54:32,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:32,578 INFO L89 Accepts]: Start accepts. Operand has 104 places, 130 transitions, 11080 flow [2022-12-13 07:54:32,583 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:32,583 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:32,583 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 130 transitions, 11080 flow [2022-12-13 07:54:32,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 130 transitions, 11080 flow [2022-12-13 07:54:32,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:54:47,781 WARN L233 SmtUtils]: Spent 12.40s on a formula simplification. DAG size of input: 254 DAG size of output: 252 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:54:48,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:54:48,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15887 [2022-12-13 07:54:48,465 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 129 transitions, 10994 flow [2022-12-13 07:54:48,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:48,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:48,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:54:48,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 07:54:48,466 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 07:54:48,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:48,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1983785738, now seen corresponding path program 1 times [2022-12-13 07:54:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:48,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074341474] [2022-12-13 07:54:48,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:48,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:49,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:49,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074341474] [2022-12-13 07:54:49,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074341474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:54:49,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:54:49,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:54:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549464603] [2022-12-13 07:54:49,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:54:49,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:54:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:54:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:54:49,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:54:49,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 129 transitions, 10994 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:49,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:49,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:54:49,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:50,355 INFO L130 PetriNetUnfolder]: 729/1170 cut-off events. [2022-12-13 07:54:50,355 INFO L131 PetriNetUnfolder]: For 5747/5747 co-relation queries the response was YES. [2022-12-13 07:54:50,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50799 conditions, 1170 events. 729/1170 cut-off events. For 5747/5747 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4957 event pairs, 53 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 29122. Up to 1161 conditions per place. [2022-12-13 07:54:50,372 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 129 selfloop transitions, 7 changer transitions 24/162 dead transitions. [2022-12-13 07:54:50,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 162 transitions, 14154 flow [2022-12-13 07:54:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:54:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:54:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 07:54:50,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 07:54:50,373 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 76 predicate places. [2022-12-13 07:54:50,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 162 transitions, 14154 flow [2022-12-13 07:54:50,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 138 transitions, 12012 flow [2022-12-13 07:54:50,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:50,407 INFO L89 Accepts]: Start accepts. Operand has 107 places, 138 transitions, 12012 flow [2022-12-13 07:54:50,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:50,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:50,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 138 transitions, 12012 flow [2022-12-13 07:54:50,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 138 transitions, 12012 flow [2022-12-13 07:54:50,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:54:50,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:54:50,626 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:54:50,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-13 07:54:50,626 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 136 transitions, 11838 flow [2022-12-13 07:54:50,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:50,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:50,626 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 07:54:50,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 07:54:50,627 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 07:54:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1101354326, now seen corresponding path program 1 times [2022-12-13 07:54:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:50,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231338177] [2022-12-13 07:54:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:51,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 07:54:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:51,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231338177] [2022-12-13 07:54:51,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231338177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:54:51,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:54:51,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:54:51,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240820017] [2022-12-13 07:54:51,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:54:51,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:54:51,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:51,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:54:51,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:54:51,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 07:54:51,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 136 transitions, 11838 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:51,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:51,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 07:54:51,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:52,375 INFO L130 PetriNetUnfolder]: 716/1139 cut-off events. [2022-12-13 07:54:52,375 INFO L131 PetriNetUnfolder]: For 5949/5949 co-relation queries the response was YES. [2022-12-13 07:54:52,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50714 conditions, 1139 events. 716/1139 cut-off events. For 5949/5949 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4761 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 29774. Up to 1132 conditions per place. [2022-12-13 07:54:52,390 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 124 selfloop transitions, 3 changer transitions 20/150 dead transitions. [2022-12-13 07:54:52,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 150 transitions, 13380 flow [2022-12-13 07:54:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:54:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:54:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 07:54:52,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 07:54:52,391 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2022-12-13 07:54:52,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 150 transitions, 13380 flow [2022-12-13 07:54:52,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 130 transitions, 11590 flow [2022-12-13 07:54:52,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:52,428 INFO L89 Accepts]: Start accepts. Operand has 107 places, 130 transitions, 11590 flow [2022-12-13 07:54:52,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:52,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:52,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 130 transitions, 11590 flow [2022-12-13 07:54:52,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 130 transitions, 11590 flow [2022-12-13 07:54:52,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:55:09,979 WARN L233 SmtUtils]: Spent 17.54s on a formula simplification. DAG size of input: 247 DAG size of output: 245 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:55:18,596 WARN L233 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 238 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:55:32,787 WARN L233 SmtUtils]: Spent 11.62s on a formula simplification that was a NOOP. DAG size: 255 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:55:32,789 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:55:32,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40363 [2022-12-13 07:55:32,790 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 11500 flow [2022-12-13 07:55:32,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:32,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:55:32,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:55:32,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 07:55:32,790 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 07:55:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:55:32,791 INFO L85 PathProgramCache]: Analyzing trace with hash 757313063, now seen corresponding path program 1 times [2022-12-13 07:55:32,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:55:32,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115708097] [2022-12-13 07:55:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:55:32,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:55:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:55:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:55:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115708097] [2022-12-13 07:55:34,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115708097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:55:34,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:55:34,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:55:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467017582] [2022-12-13 07:55:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:55:34,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:55:34,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:55:34,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:55:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:55:34,249 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:55:34,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 129 transitions, 11500 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:34,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:55:34,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:55:34,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:55:34,652 INFO L130 PetriNetUnfolder]: 729/1171 cut-off events. [2022-12-13 07:55:34,652 INFO L131 PetriNetUnfolder]: For 8032/8032 co-relation queries the response was YES. [2022-12-13 07:55:34,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53096 conditions, 1171 events. 729/1171 cut-off events. For 8032/8032 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4987 event pairs, 53 based on Foata normal form. 1/834 useless extension candidates. Maximal degree in co-relation 30440. Up to 1161 conditions per place. [2022-12-13 07:55:34,668 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 129 selfloop transitions, 8 changer transitions 23/162 dead transitions. [2022-12-13 07:55:34,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 162 transitions, 14790 flow [2022-12-13 07:55:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:55:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:55:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 07:55:34,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 07:55:34,669 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 80 predicate places. [2022-12-13 07:55:34,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 162 transitions, 14790 flow [2022-12-13 07:55:34,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 139 transitions, 12644 flow [2022-12-13 07:55:34,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:55:34,703 INFO L89 Accepts]: Start accepts. Operand has 111 places, 139 transitions, 12644 flow [2022-12-13 07:55:34,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:55:34,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:55:34,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 139 transitions, 12644 flow [2022-12-13 07:55:34,713 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 139 transitions, 12644 flow [2022-12-13 07:55:34,713 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:55:34,715 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:55:34,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:55:34,926 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:55:34,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-13 07:55:34,926 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 137 transitions, 12464 flow [2022-12-13 07:55:34,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:34,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:55:34,926 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 07:55:34,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 07:55:34,927 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 07:55:34,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:55:34,927 INFO L85 PathProgramCache]: Analyzing trace with hash -487733577, now seen corresponding path program 1 times [2022-12-13 07:55:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:55:34,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363771344] [2022-12-13 07:55:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:55:34,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:55:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:55:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:55:36,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363771344] [2022-12-13 07:55:36,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363771344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:55:36,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:55:36,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:55:36,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740222545] [2022-12-13 07:55:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:55:36,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:55:36,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:55:36,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:55:36,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:55:36,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 07:55:36,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 137 transitions, 12464 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:36,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:55:36,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 07:55:36,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:55:36,636 INFO L130 PetriNetUnfolder]: 717/1141 cut-off events. [2022-12-13 07:55:36,636 INFO L131 PetriNetUnfolder]: For 7994/7994 co-relation queries the response was YES. [2022-12-13 07:55:36,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53006 conditions, 1141 events. 717/1141 cut-off events. For 7994/7994 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4766 event pairs, 48 based on Foata normal form. 1/802 useless extension candidates. Maximal degree in co-relation 31092. Up to 1133 conditions per place. [2022-12-13 07:55:36,653 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 127 selfloop transitions, 5 changer transitions 15/151 dead transitions. [2022-12-13 07:55:36,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 151 transitions, 14064 flow [2022-12-13 07:55:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:55:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:55:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-13 07:55:36,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3271889400921659 [2022-12-13 07:55:36,654 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2022-12-13 07:55:36,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 151 transitions, 14064 flow [2022-12-13 07:55:36,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 136 transitions, 12634 flow [2022-12-13 07:55:36,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:55:36,690 INFO L89 Accepts]: Start accepts. Operand has 113 places, 136 transitions, 12634 flow [2022-12-13 07:55:36,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:55:36,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:55:36,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 136 transitions, 12634 flow [2022-12-13 07:55:36,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 136 transitions, 12634 flow [2022-12-13 07:55:36,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:55:36,700 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:55:36,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:55:36,701 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 136 transitions, 12634 flow [2022-12-13 07:55:36,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:36,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:55:36,701 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 07:55:36,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 07:55:36,701 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 07:55:36,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:55:36,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2076425538, now seen corresponding path program 1 times [2022-12-13 07:55:36,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:55:36,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565709214] [2022-12-13 07:55:36,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:55:36,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:55:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:55:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:39,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:55:39,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565709214] [2022-12-13 07:55:39,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565709214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:55:39,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:55:39,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:55:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109307914] [2022-12-13 07:55:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:55:39,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:55:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:55:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:55:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:55:39,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 07:55:39,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 136 transitions, 12634 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:39,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:55:39,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 07:55:39,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:55:40,464 INFO L130 PetriNetUnfolder]: 775/1230 cut-off events. [2022-12-13 07:55:40,464 INFO L131 PetriNetUnfolder]: For 7126/7126 co-relation queries the response was YES. [2022-12-13 07:55:40,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58470 conditions, 1230 events. 775/1230 cut-off events. For 7126/7126 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5297 event pairs, 48 based on Foata normal form. 1/865 useless extension candidates. Maximal degree in co-relation 31758. Up to 1223 conditions per place. [2022-12-13 07:55:40,482 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 143 selfloop transitions, 13 changer transitions 6/164 dead transitions. [2022-12-13 07:55:40,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 164 transitions, 15614 flow [2022-12-13 07:55:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:55:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:55:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-12-13 07:55:40,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32916666666666666 [2022-12-13 07:55:40,483 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2022-12-13 07:55:40,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 164 transitions, 15614 flow [2022-12-13 07:55:40,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 158 transitions, 15029 flow [2022-12-13 07:55:40,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:55:40,521 INFO L89 Accepts]: Start accepts. Operand has 120 places, 158 transitions, 15029 flow [2022-12-13 07:55:40,528 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:55:40,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:55:40,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 158 transitions, 15029 flow [2022-12-13 07:55:40,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 158 transitions, 15029 flow [2022-12-13 07:55:40,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 07:55:40,732 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:55:40,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-13 07:55:40,733 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 157 transitions, 14933 flow [2022-12-13 07:55:40,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:40,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:55:40,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:55:40,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 07:55:40,734 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 07:55:40,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:55:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash -60335387, now seen corresponding path program 1 times [2022-12-13 07:55:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:55:40,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401528760] [2022-12-13 07:55:40,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:55:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:55:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:55:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:42,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:55:42,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401528760] [2022-12-13 07:55:42,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401528760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:55:42,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:55:42,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:55:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998589599] [2022-12-13 07:55:42,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:55:42,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:55:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:55:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:55:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:55:42,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 07:55:42,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 157 transitions, 14933 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:42,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:55:42,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 07:55:42,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:55:43,195 INFO L130 PetriNetUnfolder]: 729/1182 cut-off events. [2022-12-13 07:55:43,195 INFO L131 PetriNetUnfolder]: For 9956/9956 co-relation queries the response was YES. [2022-12-13 07:55:43,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57033 conditions, 1182 events. 729/1182 cut-off events. For 9956/9956 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5067 event pairs, 53 based on Foata normal form. 6/849 useless extension candidates. Maximal degree in co-relation 32424. Up to 1171 conditions per place. [2022-12-13 07:55:43,212 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 128 selfloop transitions, 8 changer transitions 34/172 dead transitions. [2022-12-13 07:55:43,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 172 transitions, 16702 flow [2022-12-13 07:55:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:55:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:55:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-13 07:55:43,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.328125 [2022-12-13 07:55:43,213 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2022-12-13 07:55:43,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 172 transitions, 16702 flow [2022-12-13 07:55:43,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 138 transitions, 13364 flow [2022-12-13 07:55:43,250 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:55:43,250 INFO L89 Accepts]: Start accepts. Operand has 119 places, 138 transitions, 13364 flow [2022-12-13 07:55:43,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:55:43,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:55:43,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 138 transitions, 13364 flow [2022-12-13 07:55:43,261 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 138 transitions, 13364 flow [2022-12-13 07:55:43,261 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:55:43,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:56:18,387 WARN L233 SmtUtils]: Spent 35.02s on a formula simplification. DAG size of input: 262 DAG size of output: 260 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:56:25,194 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 252 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:56:49,272 WARN L233 SmtUtils]: Spent 24.08s on a formula simplification. DAG size of input: 276 DAG size of output: 274 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:57:30,421 WARN L233 SmtUtils]: Spent 34.95s on a formula simplification. DAG size of input: 306 DAG size of output: 301 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:57:31,925 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 07:57:31,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108675 [2022-12-13 07:57:31,925 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 135 transitions, 13072 flow [2022-12-13 07:57:31,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:31,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:57:31,926 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 07:57:31,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 07:57:31,926 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 07:57:31,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:57:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1201970882, now seen corresponding path program 1 times [2022-12-13 07:57:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:57:31,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788526982] [2022-12-13 07:57:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:57:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:57:34,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:57:34,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788526982] [2022-12-13 07:57:34,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788526982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:57:34,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:57:34,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:57:34,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602511544] [2022-12-13 07:57:34,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:57:34,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:57:34,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:57:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:57:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:57:34,071 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 07:57:34,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 135 transitions, 13072 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:34,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:57:34,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 07:57:34,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:57:34,418 INFO L130 PetriNetUnfolder]: 716/1138 cut-off events. [2022-12-13 07:57:34,419 INFO L131 PetriNetUnfolder]: For 8922/8922 co-relation queries the response was YES. [2022-12-13 07:57:34,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56282 conditions, 1138 events. 716/1138 cut-off events. For 8922/8922 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4737 event pairs, 48 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 33076. Up to 1131 conditions per place. [2022-12-13 07:57:34,435 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 122 selfloop transitions, 4 changer transitions 20/149 dead transitions. [2022-12-13 07:57:34,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 149 transitions, 14752 flow [2022-12-13 07:57:34,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:57:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:57:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 07:57:34,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 07:57:34,436 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2022-12-13 07:57:34,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 149 transitions, 14752 flow [2022-12-13 07:57:34,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 129 transitions, 12766 flow [2022-12-13 07:57:34,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:57:34,473 INFO L89 Accepts]: Start accepts. Operand has 114 places, 129 transitions, 12766 flow [2022-12-13 07:57:34,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:57:34,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:57:34,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 129 transitions, 12766 flow [2022-12-13 07:57:34,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 129 transitions, 12766 flow [2022-12-13 07:57:34,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:57:34,483 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:57:34,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:57:34,484 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 129 transitions, 12766 flow [2022-12-13 07:57:34,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:34,484 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:57:34,484 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:57:34,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 07:57:34,484 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 07:57:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:57:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2104456512, now seen corresponding path program 1 times [2022-12-13 07:57:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:57:34,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307577147] [2022-12-13 07:57:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:34,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:57:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:57:36,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:57:36,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307577147] [2022-12-13 07:57:36,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307577147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:57:36,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:57:36,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:57:36,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910455325] [2022-12-13 07:57:36,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:57:36,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:57:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:57:36,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:57:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:57:36,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:57:36,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 129 transitions, 12766 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:36,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:57:36,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:57:36,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:57:36,871 INFO L130 PetriNetUnfolder]: 729/1170 cut-off events. [2022-12-13 07:57:36,872 INFO L131 PetriNetUnfolder]: For 9799/9799 co-relation queries the response was YES. [2022-12-13 07:57:36,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58848 conditions, 1170 events. 729/1170 cut-off events. For 9799/9799 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4977 event pairs, 53 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 33742. Up to 1161 conditions per place. [2022-12-13 07:57:36,889 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 127 selfloop transitions, 9 changer transitions 24/162 dead transitions. [2022-12-13 07:57:36,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 162 transitions, 16382 flow [2022-12-13 07:57:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:57:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:57:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 07:57:36,890 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 07:57:36,890 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 89 predicate places. [2022-12-13 07:57:36,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 162 transitions, 16382 flow [2022-12-13 07:57:36,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 138 transitions, 13904 flow [2022-12-13 07:57:36,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:57:36,927 INFO L89 Accepts]: Start accepts. Operand has 120 places, 138 transitions, 13904 flow [2022-12-13 07:57:36,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:57:36,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:57:36,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 138 transitions, 13904 flow [2022-12-13 07:57:36,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 138 transitions, 13904 flow [2022-12-13 07:57:36,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 07:57:36,942 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 07:57:37,018 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:57:37,019 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 07:57:37,019 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 137 transitions, 13804 flow [2022-12-13 07:57:37,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:37,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:57:37,019 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 07:57:37,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 07:57:37,020 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 07:57:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:57:37,020 INFO L85 PathProgramCache]: Analyzing trace with hash 69560210, now seen corresponding path program 1 times [2022-12-13 07:57:37,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:57:37,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335621417] [2022-12-13 07:57:37,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:37,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:57:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:38,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 07:57:38,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:57:38,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335621417] [2022-12-13 07:57:38,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335621417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:57:38,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:57:38,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:57:38,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358486399] [2022-12-13 07:57:38,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:57:38,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:57:38,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:57:38,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:57:38,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:57:38,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 07:57:38,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 137 transitions, 13804 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:38,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:57:38,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 07:57:38,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:57:39,169 INFO L130 PetriNetUnfolder]: 716/1140 cut-off events. [2022-12-13 07:57:39,169 INFO L131 PetriNetUnfolder]: For 9301/9301 co-relation queries the response was YES. [2022-12-13 07:57:39,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58648 conditions, 1140 events. 716/1140 cut-off events. For 9301/9301 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4779 event pairs, 48 based on Foata normal form. 1/802 useless extension candidates. Maximal degree in co-relation 34408. Up to 1133 conditions per place. [2022-12-13 07:57:39,186 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 125 selfloop transitions, 3 changer transitions 21/151 dead transitions. [2022-12-13 07:57:39,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 15548 flow [2022-12-13 07:57:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:57:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:57:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-13 07:57:39,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-13 07:57:39,187 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2022-12-13 07:57:39,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 151 transitions, 15548 flow [2022-12-13 07:57:39,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 130 transitions, 13378 flow [2022-12-13 07:57:39,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:57:39,223 INFO L89 Accepts]: Start accepts. Operand has 121 places, 130 transitions, 13378 flow [2022-12-13 07:57:39,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:57:39,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:57:39,229 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 130 transitions, 13378 flow [2022-12-13 07:57:39,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 130 transitions, 13378 flow [2022-12-13 07:57:39,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:58:11,101 WARN L233 SmtUtils]: Spent 31.86s on a formula simplification. DAG size of input: 266 DAG size of output: 264 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:58:33,318 WARN L233 SmtUtils]: Spent 22.21s on a formula simplification that was a NOOP. DAG size: 260 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 07:58:36,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:58:36,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57547 [2022-12-13 07:58:36,770 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 13274 flow [2022-12-13 07:58:36,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:36,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:58:36,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:58:36,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 07:58:36,770 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 07:58:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:58:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1701079160, now seen corresponding path program 1 times [2022-12-13 07:58:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:58:36,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266140130] [2022-12-13 07:58:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:58:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:58:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:58:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:58:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:58:38,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266140130] [2022-12-13 07:58:38,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266140130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:58:38,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:58:38,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:58:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502136867] [2022-12-13 07:58:38,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:58:38,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:58:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:58:38,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:58:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:58:38,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:58:38,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 129 transitions, 13274 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:38,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:58:38,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:58:38,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:58:39,590 INFO L130 PetriNetUnfolder]: 781/1251 cut-off events. [2022-12-13 07:58:39,590 INFO L131 PetriNetUnfolder]: For 10771/10771 co-relation queries the response was YES. [2022-12-13 07:58:39,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65369 conditions, 1251 events. 781/1251 cut-off events. For 10771/10771 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5424 event pairs, 53 based on Foata normal form. 1/888 useless extension candidates. Maximal degree in co-relation 35074. Up to 1240 conditions per place. [2022-12-13 07:58:39,609 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 149 selfloop transitions, 15 changer transitions 5/171 dead transitions. [2022-12-13 07:58:39,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 171 transitions, 17976 flow [2022-12-13 07:58:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:58:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:58:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-12-13 07:58:39,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 07:58:39,618 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2022-12-13 07:58:39,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 171 transitions, 17976 flow [2022-12-13 07:58:39,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 166 transitions, 17437 flow [2022-12-13 07:58:39,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:58:39,677 INFO L89 Accepts]: Start accepts. Operand has 126 places, 166 transitions, 17437 flow [2022-12-13 07:58:39,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:58:39,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:58:39,686 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 166 transitions, 17437 flow [2022-12-13 07:58:39,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 166 transitions, 17437 flow [2022-12-13 07:58:39,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 07:58:39,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:58:39,921 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-13 07:58:39,921 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 165 transitions, 17331 flow [2022-12-13 07:58:39,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:39,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:58:39,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:58:39,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 07:58:39,922 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 07:58:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:58:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash 875889362, now seen corresponding path program 2 times [2022-12-13 07:58:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:58:39,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111495285] [2022-12-13 07:58:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:58:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:58:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:58:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:58:41,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:58:41,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111495285] [2022-12-13 07:58:41,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111495285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:58:41,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:58:41,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:58:41,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400500496] [2022-12-13 07:58:41,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:58:41,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:58:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:58:41,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:58:41,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:58:41,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 07:58:41,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 165 transitions, 17331 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:41,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:58:41,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 07:58:41,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:58:42,424 INFO L130 PetriNetUnfolder]: 808/1323 cut-off events. [2022-12-13 07:58:42,424 INFO L131 PetriNetUnfolder]: For 10692/10692 co-relation queries the response was YES. [2022-12-13 07:58:42,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70444 conditions, 1323 events. 808/1323 cut-off events. For 10692/10692 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6027 event pairs, 47 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 35740. Up to 1311 conditions per place. [2022-12-13 07:58:42,443 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 159 selfloop transitions, 9 changer transitions 40/210 dead transitions. [2022-12-13 07:58:42,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 210 transitions, 22480 flow [2022-12-13 07:58:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:58:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:58:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-12-13 07:58:42,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3185483870967742 [2022-12-13 07:58:42,445 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2022-12-13 07:58:42,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 210 transitions, 22480 flow [2022-12-13 07:58:42,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 170 transitions, 18121 flow [2022-12-13 07:58:42,488 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:58:42,488 INFO L89 Accepts]: Start accepts. Operand has 129 places, 170 transitions, 18121 flow [2022-12-13 07:58:42,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:58:42,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:58:42,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 170 transitions, 18121 flow [2022-12-13 07:58:42,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 170 transitions, 18121 flow [2022-12-13 07:58:42,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-13 07:58:42,503 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:58:42,504 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 07:58:42,504 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 170 transitions, 18121 flow [2022-12-13 07:58:42,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:42,504 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:58:42,504 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:58:42,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 07:58:42,504 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 07:58:42,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:58:42,504 INFO L85 PathProgramCache]: Analyzing trace with hash -238701506, now seen corresponding path program 1 times [2022-12-13 07:58:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:58:42,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443566822] [2022-12-13 07:58:42,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:58:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:58:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:58:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:58:44,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:58:44,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443566822] [2022-12-13 07:58:44,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443566822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:58:44,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:58:44,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:58:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783554499] [2022-12-13 07:58:44,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:58:44,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:58:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:58:44,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:58:44,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:58:44,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 07:58:44,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 170 transitions, 18121 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:44,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:58:44,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 07:58:44,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:58:45,301 INFO L130 PetriNetUnfolder]: 739/1202 cut-off events. [2022-12-13 07:58:45,301 INFO L131 PetriNetUnfolder]: For 8613/8613 co-relation queries the response was YES. [2022-12-13 07:58:45,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65032 conditions, 1202 events. 739/1202 cut-off events. For 8613/8613 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5195 event pairs, 48 based on Foata normal form. 6/867 useless extension candidates. Maximal degree in co-relation 36406. Up to 1191 conditions per place. [2022-12-13 07:58:45,328 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 126 selfloop transitions, 4 changer transitions 47/179 dead transitions. [2022-12-13 07:58:45,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 179 transitions, 19426 flow [2022-12-13 07:58:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:58:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:58:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 07:58:45,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32661290322580644 [2022-12-13 07:58:45,329 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 102 predicate places. [2022-12-13 07:58:45,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 179 transitions, 19426 flow [2022-12-13 07:58:45,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 132 transitions, 14366 flow [2022-12-13 07:58:45,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:58:45,389 INFO L89 Accepts]: Start accepts. Operand has 127 places, 132 transitions, 14366 flow [2022-12-13 07:58:45,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:58:45,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:58:45,400 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 132 transitions, 14366 flow [2022-12-13 07:58:45,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 132 transitions, 14366 flow [2022-12-13 07:58:45,406 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:59:54,436 WARN L233 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 288 DAG size of output: 286 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 08:01:44,499 WARN L233 SmtUtils]: Spent 1.78m on a formula simplification. DAG size of input: 302 DAG size of output: 301 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 08:02:08,379 WARN L233 SmtUtils]: Spent 23.88s on a formula simplification that was a NOOP. DAG size: 295 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 08:03:36,045 WARN L233 SmtUtils]: Spent 1.46m on a formula simplification. DAG size of input: 312 DAG size of output: 307 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 08:03:45,138 WARN L233 SmtUtils]: Spent 7.25s on a formula simplification. DAG size of input: 332 DAG size of output: 328 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 08:03:47,363 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 08:03:47,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301975 [2022-12-13 08:03:47,364 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 130 transitions, 14146 flow [2022-12-13 08:03:47,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:03:47,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:03:47,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:03:47,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 08:03:47,364 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 08:03:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:03:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1171034093, now seen corresponding path program 1 times [2022-12-13 08:03:47,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:03:47,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649361223] [2022-12-13 08:03:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:03:47,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:03:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:03:50,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:03:50,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:03:50,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649361223] [2022-12-13 08:03:50,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649361223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:03:50,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:03:50,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 08:03:50,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351707663] [2022-12-13 08:03:50,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:03:50,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 08:03:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:03:50,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 08:03:50,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 08:03:50,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 08:03:50,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 130 transitions, 14146 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:03:50,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:03:50,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 08:03:50,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:03:50,790 INFO L130 PetriNetUnfolder]: 729/1169 cut-off events. [2022-12-13 08:03:50,790 INFO L131 PetriNetUnfolder]: For 9210/9210 co-relation queries the response was YES. [2022-12-13 08:03:50,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64597 conditions, 1169 events. 729/1169 cut-off events. For 9210/9210 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4936 event pairs, 53 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 37072. Up to 1160 conditions per place. [2022-12-13 08:03:50,808 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 128 selfloop transitions, 7 changer transitions 24/161 dead transitions. [2022-12-13 08:03:50,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 161 transitions, 17870 flow [2022-12-13 08:03:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:03:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:03:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 08:03:50,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 08:03:50,809 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2022-12-13 08:03:50,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 161 transitions, 17870 flow [2022-12-13 08:03:50,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 137 transitions, 15152 flow [2022-12-13 08:03:50,849 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:03:50,849 INFO L89 Accepts]: Start accepts. Operand has 128 places, 137 transitions, 15152 flow [2022-12-13 08:03:50,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:03:50,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:03:50,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 137 transitions, 15152 flow [2022-12-13 08:03:50,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 137 transitions, 15152 flow [2022-12-13 08:03:50,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 08:03:50,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 08:03:51,064 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 08:03:51,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-13 08:03:51,065 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 135 transitions, 14930 flow [2022-12-13 08:03:51,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:03:51,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:03:51,065 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 08:03:51,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 08:03:51,065 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 08:03:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:03:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1598237393, now seen corresponding path program 1 times [2022-12-13 08:03:51,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:03:51,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260870987] [2022-12-13 08:03:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:03:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:03:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:03:53,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 08:03:53,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:03:53,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260870987] [2022-12-13 08:03:53,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260870987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:03:53,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:03:53,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:03:53,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461302414] [2022-12-13 08:03:53,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:03:53,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:03:53,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:03:53,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:03:53,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:03:53,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 08:03:53,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 135 transitions, 14930 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:03:53,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:03:53,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 08:03:53,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:03:53,619 INFO L130 PetriNetUnfolder]: 717/1140 cut-off events. [2022-12-13 08:03:53,619 INFO L131 PetriNetUnfolder]: For 10764/10764 co-relation queries the response was YES. [2022-12-13 08:03:53,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64292 conditions, 1140 events. 717/1140 cut-off events. For 10764/10764 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4705 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 37724. Up to 1133 conditions per place. [2022-12-13 08:03:53,637 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 125 selfloop transitions, 3 changer transitions 20/151 dead transitions. [2022-12-13 08:03:53,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 151 transitions, 17034 flow [2022-12-13 08:03:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:03:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 08:03:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 08:03:53,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 08:03:53,639 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 99 predicate places. [2022-12-13 08:03:53,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 151 transitions, 17034 flow [2022-12-13 08:03:53,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 131 transitions, 14770 flow [2022-12-13 08:03:53,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:03:53,677 INFO L89 Accepts]: Start accepts. Operand has 127 places, 131 transitions, 14770 flow [2022-12-13 08:03:53,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:03:53,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:03:53,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 131 transitions, 14770 flow [2022-12-13 08:03:53,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 131 transitions, 14770 flow [2022-12-13 08:03:53,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 08:05:06,472 WARN L233 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 313 DAG size of output: 310 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) Received shutdown request... [2022-12-13 08:05:20,008 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 08:05:20,263 WARN L249 SmtUtils]: Removed 101 from assertion stack [2022-12-13 08:05:20,264 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 08:05:20,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 08:05:20,264 WARN L619 AbstractCegarLoop]: Verification canceled: while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 334 for 11602ms.. [2022-12-13 08:05:20,265 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 08:05:20,265 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 08:05:20,265 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 08:05:20,265 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:05:20,267 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:05:20,267 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:05:20,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:05:20 BasicIcfg [2022-12-13 08:05:20,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:05:20,269 INFO L158 Benchmark]: Toolchain (without parser) took 846529.72ms. Allocated memory was 204.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 180.4MB in the beginning and 915.8MB in the end (delta: -735.4MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-13 08:05:20,269 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 204.5MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:05:20,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.44ms. Allocated memory is still 204.5MB. Free memory was 180.4MB in the beginning and 167.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 08:05:20,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.84ms. Allocated memory is still 204.5MB. Free memory was 167.1MB in the beginning and 165.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:05:20,270 INFO L158 Benchmark]: Boogie Preprocessor took 35.03ms. Allocated memory is still 204.5MB. Free memory was 165.0MB in the beginning and 162.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:05:20,270 INFO L158 Benchmark]: RCFGBuilder took 570.48ms. Allocated memory is still 204.5MB. Free memory was 162.9MB in the beginning and 130.4MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 08:05:20,270 INFO L158 Benchmark]: TraceAbstraction took 845634.69ms. Allocated memory was 204.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 128.8MB in the beginning and 915.8MB in the end (delta: -787.0MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-13 08:05:20,271 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.08ms. Allocated memory is still 204.5MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.44ms. Allocated memory is still 204.5MB. Free memory was 180.4MB in the beginning and 167.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.84ms. Allocated memory is still 204.5MB. Free memory was 167.1MB in the beginning and 165.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.03ms. Allocated memory is still 204.5MB. Free memory was 165.0MB in the beginning and 162.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 570.48ms. Allocated memory is still 204.5MB. Free memory was 162.9MB in the beginning and 130.4MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 845634.69ms. Allocated memory was 204.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 128.8MB in the beginning and 915.8MB in the end (delta: -787.0MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 173 PlacesBefore, 32 PlacesAfterwards, 181 TransitionsBefore, 28 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 112 TrivialYvCompositions, 29 ConcurrentYvCompositions, 11 ChoiceCompositions, 152 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 913, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 880, independent: 871, independent conditional: 0, independent unconditional: 871, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 880, independent: 864, independent conditional: 0, independent unconditional: 864, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 932, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 880, unknown conditional: 0, unknown unconditional: 880] , Statistics on independence cache: Total cache size (in pairs): 1423, Positive cache size: 1414, Positive conditional cache size: 0, Positive unconditional cache size: 1414, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 64 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: 1.1s, 35 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 64 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, 37 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 64 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, 38 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 88 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: 7.9s, 46 PlacesBefore, 44 PlacesAfterwards, 85 TransitionsBefore, 83 TransitionsAfterwards, 138 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, 46 PlacesBefore, 46 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 106 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, 52 PlacesBefore, 52 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 152 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, 58 PlacesBefore, 58 PlacesAfterwards, 149 TransitionsBefore, 149 TransitionsAfterwards, 162 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, 64 PlacesBefore, 64 PlacesAfterwards, 174 TransitionsBefore, 174 TransitionsAfterwards, 190 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, 70 PlacesBefore, 70 PlacesAfterwards, 188 TransitionsBefore, 188 TransitionsAfterwards, 200 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, 55 PlacesBefore, 55 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 112 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, 50 PlacesBefore, 50 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 100 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.8s, 57 PlacesBefore, 56 PlacesAfterwards, 118 TransitionsBefore, 117 TransitionsAfterwards, 146 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, 62 PlacesBefore, 62 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 178 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, 68 PlacesBefore, 68 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 216 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, 74 PlacesBefore, 74 PlacesAfterwards, 259 TransitionsBefore, 259 TransitionsAfterwards, 282 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, 61 PlacesBefore, 59 PlacesAfterwards, 133 TransitionsBefore, 131 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 1, Positive unconditional cache size: 1, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 62 PlacesAfterwards, 136 TransitionsBefore, 135 TransitionsAfterwards, 128 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): 2, Positive cache size: 2, Positive conditional cache size: 1, Positive unconditional cache size: 1, 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, 65 PlacesBefore, 64 PlacesAfterwards, 134 TransitionsBefore, 133 TransitionsAfterwards, 128 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): 2, Positive cache size: 2, Positive conditional cache size: 1, Positive unconditional cache size: 1, 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, 69 PlacesBefore, 67 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 128 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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.3s, 72 PlacesBefore, 68 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, 74 PlacesBefore, 72 PlacesAfterwards, 138 TransitionsBefore, 136 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 74 PlacesBefore, 72 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, 77 PlacesBefore, 75 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 76 PlacesBefore, 74 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, 80 PlacesBefore, 78 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 85 PlacesBefore, 84 PlacesAfterwards, 159 TransitionsBefore, 158 TransitionsAfterwards, 148 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, 164 TransitionsBefore, 164 TransitionsAfterwards, 148 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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.7s, 89 PlacesBefore, 83 PlacesAfterwards, 140 TransitionsBefore, 137 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 4, Positive conditional cache size: 3, Positive unconditional cache size: 1, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.3s, 83 PlacesBefore, 82 PlacesAfterwards, 131 TransitionsBefore, 130 TransitionsAfterwards, 128 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): 4, Positive cache size: 4, Positive conditional cache size: 3, Positive unconditional cache size: 1, 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, 87 PlacesBefore, 85 PlacesAfterwards, 137 TransitionsBefore, 135 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 4, Positive unconditional cache size: 1, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 128 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): 5, Positive cache size: 5, Positive conditional cache size: 4, Positive unconditional cache size: 1, 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, 92 PlacesBefore, 89 PlacesAfterwards, 141 TransitionsBefore, 138 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 95 PlacesBefore, 93 PlacesAfterwards, 145 TransitionsBefore, 143 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.8s, 96 PlacesBefore, 93 PlacesAfterwards, 136 TransitionsBefore, 135 TransitionsAfterwards, 128 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, 99 PlacesBefore, 99 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 158 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 40.1s, 99 PlacesBefore, 96 PlacesAfterwards, 138 TransitionsBefore, 135 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 128 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, 101 PlacesBefore, 99 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 128 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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.9s, 104 PlacesBefore, 101 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, 107 PlacesBefore, 105 PlacesAfterwards, 138 TransitionsBefore, 136 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.4s, 107 PlacesBefore, 105 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, 111 PlacesBefore, 109 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 128 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, 120 PlacesBefore, 119 PlacesAfterwards, 158 TransitionsBefore, 157 TransitionsAfterwards, 148 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 108.7s, 119 PlacesBefore, 113 PlacesAfterwards, 138 TransitionsBefore, 135 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 128 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, 120 PlacesBefore, 119 PlacesAfterwards, 138 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.5s, 121 PlacesBefore, 119 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, 126 PlacesBefore, 125 PlacesAfterwards, 166 TransitionsBefore, 165 TransitionsAfterwards, 160 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, 129 PlacesBefore, 129 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 158 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 302.0s, 127 PlacesBefore, 123 PlacesAfterwards, 132 TransitionsBefore, 130 TransitionsAfterwards, 128 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, 128 PlacesBefore, 126 PlacesAfterwards, 137 TransitionsBefore, 135 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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: 1, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 334 for 11602ms.. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 334 for 11602ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 334 for 11602ms.. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 334 for 11602ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 207 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: 845.5s, OverallIterations: 56, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1022 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1022 mSDsluCounter, 351 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 287 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14020 IncrementalHoareTripleChecker+Invalid, 14284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 64 mSDtfsCounter, 14020 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18121occurred in iteration=53, InterpolantAutomatonStates: 382, 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, 2.5s SatisfiabilityAnalysisTime, 68.8s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1116 ConstructedInterpolants, 9 QuantifiedInterpolants, 60092 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1164 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 60 InterpolantComputations, 56 PerfectInterpolantSequences, 4/8 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