/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/parallel-misc-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:31:18,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:31:18,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:31:18,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:31:18,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:31:18,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:31:18,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:31:18,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:31:18,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:31:18,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:31:18,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:31:18,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:31:18,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:31:18,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:31:18,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:31:18,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:31:18,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:31:18,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:31:18,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:31:18,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:31:18,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:31:18,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:31:18,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:31:18,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:31:18,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:31:18,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:31:18,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:31:18,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:31:18,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:31:18,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:31:18,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:31:18,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:31:18,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:31:18,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:31:18,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:31:18,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:31:18,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:31:18,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:31:18,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:31:18,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:31:18,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:31:18,179 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:31:18,210 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:31:18,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:31:18,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:31:18,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:31:18,213 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:31:18,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:31:18,214 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:31:18,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:31:18,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:31:18,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:31:18,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:31:18,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:31:18,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:31:18,216 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:31:18,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:31:18,216 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:31:18,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:31:18,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:31:18,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:31:18,217 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:31:18,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:31:18,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:31:18,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:31:18,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:31:18,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:31:18,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:31:18,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:31:18,218 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:31:18,218 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:31:18,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:31:18,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:31:18,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:31:18,589 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:31:18,590 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:31:18,591 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2022-12-13 07:31:19,812 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:31:20,029 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:31:20,030 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2022-12-13 07:31:20,042 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e62b206f/278c2ed3fa5e424eb52ff46b6c679aeb/FLAG11488a658 [2022-12-13 07:31:20,054 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e62b206f/278c2ed3fa5e424eb52ff46b6c679aeb [2022-12-13 07:31:20,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:31:20,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:31:20,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:31:20,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:31:20,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:31:20,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6772c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20, skipping insertion in model container [2022-12-13 07:31:20,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:31:20,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:31:20,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,290 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-12-13 07:31:20,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:31:20,306 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:31:20,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:31:20,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:31:20,351 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-12-13 07:31:20,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:31:20,367 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:31:20,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20 WrapperNode [2022-12-13 07:31:20,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:31:20,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:31:20,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:31:20,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:31:20,375 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:31:20" (1/1) ... [2022-12-13 07:31:20,391 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:31:20" (1/1) ... [2022-12-13 07:31:20,421 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 07:31:20,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:31:20,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:31:20,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:31:20,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:31:20,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,453 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:31:20,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:31:20,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:31:20,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:31:20,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (1/1) ... [2022-12-13 07:31:20,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:31:20,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:20,497 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:31:20,508 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:31:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:31:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:31:20,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:31:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:31:20,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:31:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:31:20,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:31:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:31:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:31:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:31:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:31:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:31:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:31:20,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:31:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:31:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:31:20,538 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:31:20,613 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:31:20,615 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:31:20,899 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:31:20,966 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:31:20,966 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 07:31:20,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:31:20 BoogieIcfgContainer [2022-12-13 07:31:20,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:31:20,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:31:20,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:31:20,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:31:20,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:31:20" (1/3) ... [2022-12-13 07:31:20,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779a42de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:31:20, skipping insertion in model container [2022-12-13 07:31:20,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:20" (2/3) ... [2022-12-13 07:31:20,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779a42de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:31:20, skipping insertion in model container [2022-12-13 07:31:20,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:31:20" (3/3) ... [2022-12-13 07:31:20,976 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-12-13 07:31:20,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:31:20,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:31:20,994 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:31:21,082 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 07:31:21,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 103 transitions, 230 flow [2022-12-13 07:31:21,208 INFO L130 PetriNetUnfolder]: 7/100 cut-off events. [2022-12-13 07:31:21,208 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:31:21,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 100 events. 7/100 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-12-13 07:31:21,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 103 transitions, 230 flow [2022-12-13 07:31:21,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 90 transitions, 198 flow [2022-12-13 07:31:21,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:21,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 90 transitions, 198 flow [2022-12-13 07:31:21,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 90 transitions, 198 flow [2022-12-13 07:31:21,281 INFO L130 PetriNetUnfolder]: 7/90 cut-off events. [2022-12-13 07:31:21,281 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:31:21,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 90 events. 7/90 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-12-13 07:31:21,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 90 transitions, 198 flow [2022-12-13 07:31:21,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 1250 [2022-12-13 07:31:24,605 INFO L241 LiptonReduction]: Total number of compositions: 68 [2022-12-13 07:31:24,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:31:24,624 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;@163f53ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:31:24,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 07:31:24,630 INFO L130 PetriNetUnfolder]: 2/21 cut-off events. [2022-12-13 07:31:24,630 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:31:24,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:24,631 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:31:24,631 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:31:24,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash -988867883, now seen corresponding path program 1 times [2022-12-13 07:31:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:24,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283202790] [2022-12-13 07:31:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:25,136 INFO L134 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:31:25,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:25,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283202790] [2022-12-13 07:31:25,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283202790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:31:25,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:31:25,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:31:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721465297] [2022-12-13 07:31:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:31:25,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:31:25,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:25,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:31:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:31:25,169 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:25,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:25,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:25,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:25,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:25,472 INFO L130 PetriNetUnfolder]: 433/696 cut-off events. [2022-12-13 07:31:25,473 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-13 07:31:25,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 696 events. 433/696 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2651 event pairs, 74 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 1212. Up to 359 conditions per place. [2022-12-13 07:31:25,484 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 55 selfloop transitions, 5 changer transitions 22/82 dead transitions. [2022-12-13 07:31:25,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 82 transitions, 382 flow [2022-12-13 07:31:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:31:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:31:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 07:31:25,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-13 07:31:25,502 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-13 07:31:25,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 82 transitions, 382 flow [2022-12-13 07:31:25,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 60 transitions, 288 flow [2022-12-13 07:31:25,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:25,515 INFO L89 Accepts]: Start accepts. Operand has 34 places, 60 transitions, 288 flow [2022-12-13 07:31:25,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:25,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:25,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 60 transitions, 288 flow [2022-12-13 07:31:25,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 60 transitions, 288 flow [2022-12-13 07:31:25,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:25,526 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:25,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 07:31:25,528 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 60 transitions, 288 flow [2022-12-13 07:31:25,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:25,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:25,528 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:31:25,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:31:25,532 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:31:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1722233065, now seen corresponding path program 2 times [2022-12-13 07:31:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:25,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148023916] [2022-12-13 07:31:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:25,732 INFO L134 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:31:25,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:25,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148023916] [2022-12-13 07:31:25,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148023916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:31:25,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:31:25,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:31:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167902297] [2022-12-13 07:31:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:31:25,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:31:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:25,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:31:25,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:31:25,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:25,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 60 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:25,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:25,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:25,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:25,844 INFO L130 PetriNetUnfolder]: 249/424 cut-off events. [2022-12-13 07:31:25,845 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 07:31:25,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 424 events. 249/424 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1494 event pairs, 6 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 1226. Up to 269 conditions per place. [2022-12-13 07:31:25,849 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 72 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2022-12-13 07:31:25,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 79 transitions, 525 flow [2022-12-13 07:31:25,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:31:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:31:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 07:31:25,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-13 07:31:25,852 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-13 07:31:25,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 79 transitions, 525 flow [2022-12-13 07:31:25,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 79 transitions, 525 flow [2022-12-13 07:31:25,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:25,858 INFO L89 Accepts]: Start accepts. Operand has 37 places, 79 transitions, 525 flow [2022-12-13 07:31:25,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:25,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:25,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 79 transitions, 525 flow [2022-12-13 07:31:25,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 79 transitions, 525 flow [2022-12-13 07:31:25,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:25,864 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:25,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:31:25,866 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 79 transitions, 525 flow [2022-12-13 07:31:25,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:25,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:25,866 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:31:25,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:31:25,866 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:31:25,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash -572220817, now seen corresponding path program 3 times [2022-12-13 07:31:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:25,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047851527] [2022-12-13 07:31:25,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:25,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:26,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047851527] [2022-12-13 07:31:26,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047851527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:31:26,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:31:26,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:31:26,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251386402] [2022-12-13 07:31:26,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:31:26,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:31:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:26,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:31:26,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:31:26,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:26,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 79 transitions, 525 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:26,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:26,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:26,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:26,168 INFO L130 PetriNetUnfolder]: 204/359 cut-off events. [2022-12-13 07:31:26,168 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 07:31:26,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 359 events. 204/359 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1200 event pairs, 8 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 1350. Up to 226 conditions per place. [2022-12-13 07:31:26,170 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 80 selfloop transitions, 9 changer transitions 2/91 dead transitions. [2022-12-13 07:31:26,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 91 transitions, 788 flow [2022-12-13 07:31:26,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:31:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:31:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 07:31:26,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-13 07:31:26,174 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-13 07:31:26,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 91 transitions, 788 flow [2022-12-13 07:31:26,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 89 transitions, 772 flow [2022-12-13 07:31:26,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:26,179 INFO L89 Accepts]: Start accepts. Operand has 40 places, 89 transitions, 772 flow [2022-12-13 07:31:26,181 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:26,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:26,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 89 transitions, 772 flow [2022-12-13 07:31:26,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 89 transitions, 772 flow [2022-12-13 07:31:26,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:26,184 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:26,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:31:26,185 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 89 transitions, 772 flow [2022-12-13 07:31:26,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:26,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:26,185 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:31:26,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:31:26,185 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:31:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash -323847353, now seen corresponding path program 4 times [2022-12-13 07:31:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:26,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644773689] [2022-12-13 07:31:26,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:26,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:26,299 INFO L134 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:31:26,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:26,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644773689] [2022-12-13 07:31:26,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644773689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:31:26,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:31:26,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:31:26,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211366276] [2022-12-13 07:31:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:31:26,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:31:26,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:26,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:31:26,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:31:26,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:26,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 89 transitions, 772 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:26,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:26,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:26,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:26,419 INFO L130 PetriNetUnfolder]: 210/361 cut-off events. [2022-12-13 07:31:26,420 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 07:31:26,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 361 events. 210/361 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1153 event pairs, 6 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 1687. Up to 246 conditions per place. [2022-12-13 07:31:26,423 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 86 selfloop transitions, 14 changer transitions 0/100 dead transitions. [2022-12-13 07:31:26,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 100 transitions, 1060 flow [2022-12-13 07:31:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:31:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:31:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-13 07:31:26,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 07:31:26,424 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2022-12-13 07:31:26,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 100 transitions, 1060 flow [2022-12-13 07:31:26,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 100 transitions, 1060 flow [2022-12-13 07:31:26,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:26,430 INFO L89 Accepts]: Start accepts. Operand has 44 places, 100 transitions, 1060 flow [2022-12-13 07:31:26,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:26,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:26,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 100 transitions, 1060 flow [2022-12-13 07:31:26,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 100 transitions, 1060 flow [2022-12-13 07:31:26,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:26,433 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:26,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:31:26,434 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 100 transitions, 1060 flow [2022-12-13 07:31:26,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:26,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:26,435 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:31:26,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:31:26,435 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:31:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 258699961, now seen corresponding path program 5 times [2022-12-13 07:31:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:26,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419699473] [2022-12-13 07:31:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:26,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:26,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419699473] [2022-12-13 07:31:26,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419699473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:31:26,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:31:26,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:31:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664570531] [2022-12-13 07:31:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:31:26,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:31:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:26,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:31:26,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:31:26,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:26,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 100 transitions, 1060 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:26,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:26,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:26,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:26,665 INFO L130 PetriNetUnfolder]: 202/339 cut-off events. [2022-12-13 07:31:26,665 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 07:31:26,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2086 conditions, 339 events. 202/339 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1086 event pairs, 0 based on Foata normal form. 18/331 useless extension candidates. Maximal degree in co-relation 1933. Up to 275 conditions per place. [2022-12-13 07:31:26,668 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 71 selfloop transitions, 11 changer transitions 17/99 dead transitions. [2022-12-13 07:31:26,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 99 transitions, 1239 flow [2022-12-13 07:31:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:31:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:31:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-13 07:31:26,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 07:31:26,670 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2022-12-13 07:31:26,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 99 transitions, 1239 flow [2022-12-13 07:31:26,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 82 transitions, 1029 flow [2022-12-13 07:31:26,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:26,697 INFO L89 Accepts]: Start accepts. Operand has 46 places, 82 transitions, 1029 flow [2022-12-13 07:31:26,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:26,699 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:26,699 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 82 transitions, 1029 flow [2022-12-13 07:31:26,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 82 transitions, 1029 flow [2022-12-13 07:31:26,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:26,701 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:26,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:31:26,702 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 82 transitions, 1029 flow [2022-12-13 07:31:26,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:26,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:26,702 INFO 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:31:26,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:31:26,703 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:31:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:26,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1046090103, now seen corresponding path program 1 times [2022-12-13 07:31:26,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:26,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263945194] [2022-12-13 07:31:26,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:26,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:26,901 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:31:26,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:26,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263945194] [2022-12-13 07:31:26,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263945194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:31:26,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:31:26,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:31:26,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789013374] [2022-12-13 07:31:26,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:31:26,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:31:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:26,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:31:26,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:31:26,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:26,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 82 transitions, 1029 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:26,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:26,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:26,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:27,094 INFO L130 PetriNetUnfolder]: 337/552 cut-off events. [2022-12-13 07:31:27,094 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-13 07:31:27,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 552 events. 337/552 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1987 event pairs, 0 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 3699. Up to 517 conditions per place. [2022-12-13 07:31:27,099 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 88 selfloop transitions, 8 changer transitions 73/169 dead transitions. [2022-12-13 07:31:27,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 169 transitions, 2441 flow [2022-12-13 07:31:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:31:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:31:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-13 07:31:27,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2022-12-13 07:31:27,105 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2022-12-13 07:31:27,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 169 transitions, 2441 flow [2022-12-13 07:31:27,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 96 transitions, 1398 flow [2022-12-13 07:31:27,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:27,118 INFO L89 Accepts]: Start accepts. Operand has 49 places, 96 transitions, 1398 flow [2022-12-13 07:31:27,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:27,120 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:27,120 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 96 transitions, 1398 flow [2022-12-13 07:31:27,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 96 transitions, 1398 flow [2022-12-13 07:31:27,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:27,126 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:27,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:31:27,127 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 96 transitions, 1398 flow [2022-12-13 07:31:27,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:27,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:27,127 INFO 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:31:27,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:31:27,128 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:31:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -257585099, now seen corresponding path program 1 times [2022-12-13 07:31:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:27,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104239005] [2022-12-13 07:31:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:27,340 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:31:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:27,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104239005] [2022-12-13 07:31:27,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104239005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:31:27,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:31:27,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:31:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336730179] [2022-12-13 07:31:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:31:27,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:31:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:27,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:31:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:31:27,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:27,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 96 transitions, 1398 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:27,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:27,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:27,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:27,537 INFO L130 PetriNetUnfolder]: 349/564 cut-off events. [2022-12-13 07:31:27,537 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 07:31:27,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4584 conditions, 564 events. 349/564 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1961 event pairs, 0 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 4356. Up to 529 conditions per place. [2022-12-13 07:31:27,543 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 100 selfloop transitions, 8 changer transitions 59/167 dead transitions. [2022-12-13 07:31:27,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 167 transitions, 2732 flow [2022-12-13 07:31:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:31:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:31:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-12-13 07:31:27,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2022-12-13 07:31:27,546 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-13 07:31:27,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 167 transitions, 2732 flow [2022-12-13 07:31:27,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 108 transitions, 1788 flow [2022-12-13 07:31:27,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:27,558 INFO L89 Accepts]: Start accepts. Operand has 52 places, 108 transitions, 1788 flow [2022-12-13 07:31:27,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:27,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:27,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 108 transitions, 1788 flow [2022-12-13 07:31:27,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 108 transitions, 1788 flow [2022-12-13 07:31:27,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:27,568 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:27,568 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:31:27,568 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 108 transitions, 1788 flow [2022-12-13 07:31:27,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:31:27,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:27,569 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:27,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:31:27,569 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:31:27,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1208786341, now seen corresponding path program 2 times [2022-12-13 07:31:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:27,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356530691] [2022-12-13 07:31:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:27,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:27,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356530691] [2022-12-13 07:31:27,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356530691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:27,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418280008] [2022-12-13 07:31:27,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:31:27,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:27,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:27,871 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:31:27,875 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:31:27,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:31:27,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:31:27,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 07:31:27,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:28,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:31:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:28,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418280008] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:31:28,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:31:28,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 07:31:28,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172519895] [2022-12-13 07:31:28,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:31:28,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 07:31:28,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 07:31:28,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:31:28,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:28,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 108 transitions, 1788 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:31:28,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:28,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:28,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:30,100 INFO L130 PetriNetUnfolder]: 804/1301 cut-off events. [2022-12-13 07:31:30,100 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-13 07:31:30,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11850 conditions, 1301 events. 804/1301 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5510 event pairs, 0 based on Foata normal form. 0/1245 useless extension candidates. Maximal degree in co-relation 11248. Up to 1266 conditions per place. [2022-12-13 07:31:30,112 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 166 selfloop transitions, 54 changer transitions 188/408 dead transitions. [2022-12-13 07:31:30,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 408 transitions, 7461 flow [2022-12-13 07:31:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 07:31:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-13 07:31:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 292 transitions. [2022-12-13 07:31:30,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31601731601731603 [2022-12-13 07:31:30,115 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2022-12-13 07:31:30,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 408 transitions, 7461 flow [2022-12-13 07:31:30,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 220 transitions, 4077 flow [2022-12-13 07:31:30,140 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:30,140 INFO L89 Accepts]: Start accepts. Operand has 69 places, 220 transitions, 4077 flow [2022-12-13 07:31:30,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:30,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:30,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 220 transitions, 4077 flow [2022-12-13 07:31:30,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 220 transitions, 4077 flow [2022-12-13 07:31:30,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:30,149 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:30,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:31:30,150 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 220 transitions, 4077 flow [2022-12-13 07:31:30,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:31:30,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:30,151 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:30,160 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:31:30,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:30,356 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:31:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash -384930243, now seen corresponding path program 2 times [2022-12-13 07:31:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:30,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927781490] [2022-12-13 07:31:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:30,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927781490] [2022-12-13 07:31:30,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927781490] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:30,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876483062] [2022-12-13 07:31:30,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:31:30,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:30,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:30,644 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:31:30,669 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:31:30,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:31:30,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:31:30,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 07:31:30,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:30,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:31:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:31,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876483062] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:31:31,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:31:31,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 07:31:31,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358907748] [2022-12-13 07:31:31,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:31:31,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:31:31,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:31,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:31:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:31:31,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:31,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 220 transitions, 4077 flow. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:31:31,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:31,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:31,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:32,478 INFO L130 PetriNetUnfolder]: 1014/1649 cut-off events. [2022-12-13 07:31:32,478 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-12-13 07:31:32,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16687 conditions, 1649 events. 1014/1649 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7313 event pairs, 0 based on Foata normal form. 0/1559 useless extension candidates. Maximal degree in co-relation 15938. Up to 1614 conditions per place. [2022-12-13 07:31:32,500 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 258 selfloop transitions, 68 changer transitions 162/488 dead transitions. [2022-12-13 07:31:32,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 488 transitions, 9925 flow [2022-12-13 07:31:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 07:31:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-13 07:31:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 265 transitions. [2022-12-13 07:31:32,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31698564593301437 [2022-12-13 07:31:32,503 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2022-12-13 07:31:32,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 488 transitions, 9925 flow [2022-12-13 07:31:32,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 326 transitions, 6685 flow [2022-12-13 07:31:32,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:32,531 INFO L89 Accepts]: Start accepts. Operand has 86 places, 326 transitions, 6685 flow [2022-12-13 07:31:32,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:32,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:32,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 326 transitions, 6685 flow [2022-12-13 07:31:32,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 326 transitions, 6685 flow [2022-12-13 07:31:32,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:32,546 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:32,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 07:31:32,546 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 326 transitions, 6685 flow [2022-12-13 07:31:32,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:31:32,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:32,547 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:32,555 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:31:32,753 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,SelfDestructingSolverStorable8 [2022-12-13 07:31:32,753 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:31:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash 959049493, now seen corresponding path program 1 times [2022-12-13 07:31:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:32,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877481283] [2022-12-13 07:31:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:33,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:33,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877481283] [2022-12-13 07:31:33,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877481283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:33,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925038414] [2022-12-13 07:31:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:33,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:33,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:33,095 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:31:33,104 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:31:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:33,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 07:31:33,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:33,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:31:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:33,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925038414] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:31:33,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:31:33,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-13 07:31:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299125877] [2022-12-13 07:31:33,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:31:33,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:31:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:33,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:31:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:31:33,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:33,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 326 transitions, 6685 flow. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:31:33,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:33,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:33,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:35,736 INFO L130 PetriNetUnfolder]: 1409/2304 cut-off events. [2022-12-13 07:31:35,736 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-12-13 07:31:35,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25631 conditions, 2304 events. 1409/2304 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11223 event pairs, 0 based on Foata normal form. 0/2154 useless extension candidates. Maximal degree in co-relation 24719. Up to 2269 conditions per place. [2022-12-13 07:31:35,758 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 285 selfloop transitions, 100 changer transitions 224/609 dead transitions. [2022-12-13 07:31:35,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 609 transitions, 13653 flow [2022-12-13 07:31:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 07:31:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-13 07:31:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 314 transitions. [2022-12-13 07:31:35,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36596736596736595 [2022-12-13 07:31:35,762 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2022-12-13 07:31:35,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 609 transitions, 13653 flow [2022-12-13 07:31:35,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 385 transitions, 8662 flow [2022-12-13 07:31:35,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:35,811 INFO L89 Accepts]: Start accepts. Operand has 108 places, 385 transitions, 8662 flow [2022-12-13 07:31:35,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:35,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:35,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 385 transitions, 8662 flow [2022-12-13 07:31:35,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 385 transitions, 8662 flow [2022-12-13 07:31:35,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:35,827 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:35,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 07:31:35,828 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 385 transitions, 8662 flow [2022-12-13 07:31:35,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:31:35,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:35,828 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:35,838 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:31:36,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:36,034 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:31:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2065523101, now seen corresponding path program 2 times [2022-12-13 07:31:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:36,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046189338] [2022-12-13 07:31:36,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:36,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:36,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046189338] [2022-12-13 07:31:36,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046189338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:36,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686323555] [2022-12-13 07:31:36,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:31:36,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:36,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:36,431 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:31:36,434 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:31:36,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:31:36,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:31:36,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 07:31:36,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:36,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:31:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:37,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686323555] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:31:37,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:31:37,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-13 07:31:37,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866805561] [2022-12-13 07:31:37,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:31:37,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:31:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:37,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:31:37,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:31:37,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:37,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 385 transitions, 8662 flow. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:31:37,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:37,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:37,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:38,846 INFO L130 PetriNetUnfolder]: 1616/2627 cut-off events. [2022-12-13 07:31:38,846 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2022-12-13 07:31:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31865 conditions, 2627 events. 1616/2627 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 12643 event pairs, 0 based on Foata normal form. 0/2477 useless extension candidates. Maximal degree in co-relation 30874. Up to 2592 conditions per place. [2022-12-13 07:31:38,870 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 340 selfloop transitions, 93 changer transitions 243/676 dead transitions. [2022-12-13 07:31:38,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 676 transitions, 16506 flow [2022-12-13 07:31:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 07:31:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 07:31:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 305 transitions. [2022-12-13 07:31:38,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3746928746928747 [2022-12-13 07:31:38,872 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2022-12-13 07:31:38,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 676 transitions, 16506 flow [2022-12-13 07:31:38,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 433 transitions, 10605 flow [2022-12-13 07:31:38,915 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:38,916 INFO L89 Accepts]: Start accepts. Operand has 126 places, 433 transitions, 10605 flow [2022-12-13 07:31:38,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:38,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:38,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 433 transitions, 10605 flow [2022-12-13 07:31:38,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 433 transitions, 10605 flow [2022-12-13 07:31:38,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:38,935 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:38,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 07:31:38,936 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 433 transitions, 10605 flow [2022-12-13 07:31:38,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:31:38,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:38,936 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:38,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 07:31:39,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:39,147 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:31:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:39,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1500589717, now seen corresponding path program 3 times [2022-12-13 07:31:39,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:39,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006897044] [2022-12-13 07:31:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:39,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006897044] [2022-12-13 07:31:39,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006897044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575359786] [2022-12-13 07:31:39,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:31:39,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:39,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:39,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:31:39,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 07:31:39,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 07:31:39,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:31:39,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:31:39,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:39,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:31:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:40,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575359786] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:31:40,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:31:40,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-13 07:31:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696285522] [2022-12-13 07:31:40,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:31:40,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:31:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:40,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:31:40,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:31:40,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:40,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 433 transitions, 10605 flow. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:31:40,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:40,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:40,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:44,369 INFO L130 PetriNetUnfolder]: 2209/3576 cut-off events. [2022-12-13 07:31:44,370 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-12-13 07:31:44,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46927 conditions, 3576 events. 2209/3576 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 18100 event pairs, 0 based on Foata normal form. 0/3396 useless extension candidates. Maximal degree in co-relation 45587. Up to 3541 conditions per place. [2022-12-13 07:31:44,400 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 504 selfloop transitions, 155 changer transitions 254/913 dead transitions. [2022-12-13 07:31:44,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 913 transitions, 24047 flow [2022-12-13 07:31:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-13 07:31:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-12-13 07:31:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 452 transitions. [2022-12-13 07:31:44,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31129476584022037 [2022-12-13 07:31:44,403 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2022-12-13 07:31:44,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 913 transitions, 24047 flow [2022-12-13 07:31:44,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 659 transitions, 17443 flow [2022-12-13 07:31:44,465 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:44,466 INFO L89 Accepts]: Start accepts. Operand has 157 places, 659 transitions, 17443 flow [2022-12-13 07:31:44,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:44,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:44,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 659 transitions, 17443 flow [2022-12-13 07:31:44,495 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 659 transitions, 17443 flow [2022-12-13 07:31:44,495 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:44,498 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:44,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 07:31:44,498 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 659 transitions, 17443 flow [2022-12-13 07:31:44,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:31:44,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:44,499 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:44,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 07:31:44,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 07:31:44,705 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:31:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash 605790457, now seen corresponding path program 3 times [2022-12-13 07:31:44,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:44,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670501260] [2022-12-13 07:31:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:44,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:45,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:45,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670501260] [2022-12-13 07:31:45,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670501260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:45,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529960613] [2022-12-13 07:31:45,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:31:45,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:45,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:45,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:31:45,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:31:45,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 07:31:45,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:31:45,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 07:31:45,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:45,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:31:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:46,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529960613] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:31:46,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:31:46,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-13 07:31:46,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642286066] [2022-12-13 07:31:46,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:31:46,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:31:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:46,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:31:46,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-12-13 07:31:46,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:46,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 659 transitions, 17443 flow. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:31:46,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:46,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:46,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:50,696 INFO L130 PetriNetUnfolder]: 3045/4930 cut-off events. [2022-12-13 07:31:50,696 INFO L131 PetriNetUnfolder]: For 350/350 co-relation queries the response was YES. [2022-12-13 07:31:50,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69639 conditions, 4930 events. 3045/4930 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 26158 event pairs, 0 based on Foata normal form. 0/4684 useless extension candidates. Maximal degree in co-relation 67388. Up to 4895 conditions per place. [2022-12-13 07:31:50,740 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 744 selfloop transitions, 176 changer transitions 369/1289 dead transitions. [2022-12-13 07:31:50,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 1289 transitions, 36530 flow [2022-12-13 07:31:50,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-12-13 07:31:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-12-13 07:31:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 520 transitions. [2022-12-13 07:31:50,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3151515151515151 [2022-12-13 07:31:50,751 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2022-12-13 07:31:50,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 1289 transitions, 36530 flow [2022-12-13 07:31:50,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 920 transitions, 26198 flow [2022-12-13 07:31:50,849 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:50,850 INFO L89 Accepts]: Start accepts. Operand has 187 places, 920 transitions, 26198 flow [2022-12-13 07:31:50,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:50,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:50,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 920 transitions, 26198 flow [2022-12-13 07:31:50,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 920 transitions, 26198 flow [2022-12-13 07:31:50,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:50,903 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:50,904 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 07:31:50,904 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 920 transitions, 26198 flow [2022-12-13 07:31:50,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:31:50,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:50,904 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:50,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 07:31:51,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:51,110 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:31:51,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:51,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1484359381, now seen corresponding path program 4 times [2022-12-13 07:31:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:51,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123182429] [2022-12-13 07:31:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:51,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:51,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123182429] [2022-12-13 07:31:51,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123182429] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:51,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002148186] [2022-12-13 07:31:51,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:31:51,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:51,710 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:31:51,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 07:31:51,799 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:31:51,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:31:51,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 07:31:51,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:52,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:31:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:53,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002148186] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:31:53,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:31:53,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-13 07:31:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892646528] [2022-12-13 07:31:53,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:31:53,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:31:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:31:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:31:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-12-13 07:31:53,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:31:53,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 920 transitions, 26198 flow. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:31:53,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:31:53,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:31:53,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:31:58,468 INFO L130 PetriNetUnfolder]: 4636/7591 cut-off events. [2022-12-13 07:31:58,468 INFO L131 PetriNetUnfolder]: For 604/604 co-relation queries the response was YES. [2022-12-13 07:31:58,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114807 conditions, 7591 events. 4636/7591 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 44711 event pairs, 0 based on Foata normal form. 0/7055 useless extension candidates. Maximal degree in co-relation 111843. Up to 7556 conditions per place. [2022-12-13 07:31:58,528 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1022 selfloop transitions, 322 changer transitions 507/1851 dead transitions. [2022-12-13 07:31:58,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 1851 transitions, 56295 flow [2022-12-13 07:31:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-13 07:31:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-12-13 07:31:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 626 transitions. [2022-12-13 07:31:58,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3695395513577332 [2022-12-13 07:31:58,531 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 233 predicate places. [2022-12-13 07:31:58,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 1851 transitions, 56295 flow [2022-12-13 07:31:58,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 1344 transitions, 40941 flow [2022-12-13 07:31:58,679 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:31:58,679 INFO L89 Accepts]: Start accepts. Operand has 231 places, 1344 transitions, 40941 flow [2022-12-13 07:31:58,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:31:58,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:31:58,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 1344 transitions, 40941 flow [2022-12-13 07:31:58,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 1344 transitions, 40941 flow [2022-12-13 07:31:58,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:31:58,764 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:31:58,765 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 07:31:58,765 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 1344 transitions, 40941 flow [2022-12-13 07:31:58,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:31:58,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:31:58,765 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:31:58,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 07:31:58,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:58,971 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:31:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:31:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1077262223, now seen corresponding path program 5 times [2022-12-13 07:31:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:31:58,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068127203] [2022-12-13 07:31:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:31:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:31:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:31:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:31:59,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068127203] [2022-12-13 07:31:59,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068127203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:31:59,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563095692] [2022-12-13 07:31:59,398 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:31:59,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:31:59,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:31:59,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:31:59,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 07:31:59,514 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 07:31:59,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:31:59,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 07:31:59,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:31:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:31:59,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:32:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:01,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563095692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:32:01,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:32:01,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-13 07:32:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768132390] [2022-12-13 07:32:01,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:32:01,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:32:01,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:32:01,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:32:01,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2022-12-13 07:32:01,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:32:01,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 1344 transitions, 40941 flow. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:32:01,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:32:01,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:32:01,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:32:07,325 INFO L130 PetriNetUnfolder]: 5410/8839 cut-off events. [2022-12-13 07:32:07,325 INFO L131 PetriNetUnfolder]: For 711/711 co-relation queries the response was YES. [2022-12-13 07:32:07,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142532 conditions, 8839 events. 5410/8839 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 53685 event pairs, 0 based on Foata normal form. 0/8253 useless extension candidates. Maximal degree in co-relation 139311. Up to 8804 conditions per place. [2022-12-13 07:32:07,505 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1193 selfloop transitions, 306 changer transitions 652/2151 dead transitions. [2022-12-13 07:32:07,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 2151 transitions, 69708 flow [2022-12-13 07:32:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-12-13 07:32:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2022-12-13 07:32:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 569 transitions. [2022-12-13 07:32:07,508 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36948051948051946 [2022-12-13 07:32:07,508 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 270 predicate places. [2022-12-13 07:32:07,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 300 places, 2151 transitions, 69708 flow [2022-12-13 07:32:07,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 1499 transitions, 48655 flow [2022-12-13 07:32:07,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:32:07,654 INFO L89 Accepts]: Start accepts. Operand has 270 places, 1499 transitions, 48655 flow [2022-12-13 07:32:07,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:32:07,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:32:07,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 270 places, 1499 transitions, 48655 flow [2022-12-13 07:32:07,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 270 places, 1499 transitions, 48655 flow [2022-12-13 07:32:07,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:32:07,724 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:32:07,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 07:32:07,725 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 1499 transitions, 48655 flow [2022-12-13 07:32:07,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:32:07,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:32:07,725 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:32:07,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 07:32:07,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 07:32:07,926 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:32:07,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:32:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -578752261, now seen corresponding path program 6 times [2022-12-13 07:32:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:32:07,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074622227] [2022-12-13 07:32:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:32:07,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:32:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:32:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:32:08,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074622227] [2022-12-13 07:32:08,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074622227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:32:08,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827777652] [2022-12-13 07:32:08,467 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:32:08,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:32:08,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:32:08,468 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:32:08,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 07:32:08,573 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-12-13 07:32:08,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:32:08,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 07:32:08,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:32:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:08,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:32:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:09,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827777652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:32:09,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:32:09,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-12-13 07:32:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152525987] [2022-12-13 07:32:09,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:32:09,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:32:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:32:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:32:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:32:09,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:32:09,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 1499 transitions, 48655 flow. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:32:09,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:32:09,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:32:09,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:32:17,121 INFO L130 PetriNetUnfolder]: 6343/10268 cut-off events. [2022-12-13 07:32:17,121 INFO L131 PetriNetUnfolder]: For 812/812 co-relation queries the response was YES. [2022-12-13 07:32:17,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175852 conditions, 10268 events. 6343/10268 cut-off events. For 812/812 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 63547 event pairs, 0 based on Foata normal form. 0/9730 useless extension candidates. Maximal degree in co-relation 171946. Up to 10233 conditions per place. [2022-12-13 07:32:17,199 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 1543 selfloop transitions, 358 changer transitions 566/2467 dead transitions. [2022-12-13 07:32:17,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 2467 transitions, 84739 flow [2022-12-13 07:32:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-12-13 07:32:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2022-12-13 07:32:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 633 transitions. [2022-12-13 07:32:17,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2997159090909091 [2022-12-13 07:32:17,206 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 335 predicate places. [2022-12-13 07:32:17,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 365 places, 2467 transitions, 84739 flow [2022-12-13 07:32:17,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 1901 transitions, 65495 flow [2022-12-13 07:32:17,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:32:17,362 INFO L89 Accepts]: Start accepts. Operand has 313 places, 1901 transitions, 65495 flow [2022-12-13 07:32:17,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:32:17,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:32:17,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 1901 transitions, 65495 flow [2022-12-13 07:32:17,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 1901 transitions, 65495 flow [2022-12-13 07:32:17,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:32:17,470 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:32:17,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 07:32:17,471 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 1901 transitions, 65495 flow [2022-12-13 07:32:17,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:32:17,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:32:17,471 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:32:17,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 07:32:17,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 07:32:17,676 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:32:17,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:32:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash -594189217, now seen corresponding path program 7 times [2022-12-13 07:32:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:32:17,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991674445] [2022-12-13 07:32:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:32:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:32:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:32:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:32:18,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991674445] [2022-12-13 07:32:18,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991674445] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:32:18,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643422196] [2022-12-13 07:32:18,103 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:32:18,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:32:18,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:32:18,105 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:32:18,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 07:32:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:32:18,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 07:32:18,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:32:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:18,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:32:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:19,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643422196] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:32:19,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:32:19,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-13 07:32:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571241733] [2022-12-13 07:32:19,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:32:19,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:32:19,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:32:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:32:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-12-13 07:32:19,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:32:19,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 1901 transitions, 65495 flow. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:32:19,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:32:19,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:32:19,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:32:26,166 INFO L130 PetriNetUnfolder]: 6899/11212 cut-off events. [2022-12-13 07:32:26,166 INFO L131 PetriNetUnfolder]: For 962/962 co-relation queries the response was YES. [2022-12-13 07:32:26,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203311 conditions, 11212 events. 6899/11212 cut-off events. For 962/962 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 70511 event pairs, 0 based on Foata normal form. 0/10466 useless extension candidates. Maximal degree in co-relation 198590. Up to 11177 conditions per place. [2022-12-13 07:32:26,255 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 1893 selfloop transitions, 367 changer transitions 238/2498 dead transitions. [2022-12-13 07:32:26,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 2498 transitions, 90942 flow [2022-12-13 07:32:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-13 07:32:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-12-13 07:32:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 439 transitions. [2022-12-13 07:32:26,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35007974481658694 [2022-12-13 07:32:26,258 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 339 predicate places. [2022-12-13 07:32:26,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 2498 transitions, 90942 flow [2022-12-13 07:32:26,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 351 places, 2260 transitions, 82374 flow [2022-12-13 07:32:26,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:32:26,457 INFO L89 Accepts]: Start accepts. Operand has 351 places, 2260 transitions, 82374 flow [2022-12-13 07:32:26,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:32:26,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:32:26,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 2260 transitions, 82374 flow [2022-12-13 07:32:26,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 2260 transitions, 82374 flow [2022-12-13 07:32:26,553 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:32:26,559 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:32:26,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 07:32:26,560 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 2260 transitions, 82374 flow [2022-12-13 07:32:26,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:32:26,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:32:26,561 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:32:26,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 07:32:26,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 07:32:26,766 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:32:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:32:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2005342251, now seen corresponding path program 8 times [2022-12-13 07:32:26,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:32:26,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077495495] [2022-12-13 07:32:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:32:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:32:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:32:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:27,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:32:27,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077495495] [2022-12-13 07:32:27,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077495495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:32:27,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976243267] [2022-12-13 07:32:27,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:32:27,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:32:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:32:27,236 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:32:27,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 07:32:27,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:32:27,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:32:27,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 07:32:27,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:32:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:27,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:32:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:28,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976243267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:32:28,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:32:28,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-13 07:32:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783910874] [2022-12-13 07:32:28,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:32:28,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:32:28,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:32:28,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:32:28,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2022-12-13 07:32:28,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:32:28,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 2260 transitions, 82374 flow. Second operand has 25 states, 25 states have (on average 3.04) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:28,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:32:28,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:32:28,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:32:38,221 INFO L130 PetriNetUnfolder]: 8058/13075 cut-off events. [2022-12-13 07:32:38,222 INFO L131 PetriNetUnfolder]: For 1065/1065 co-relation queries the response was YES. [2022-12-13 07:32:38,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250132 conditions, 13075 events. 8058/13075 cut-off events. For 1065/1065 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 84360 event pairs, 0 based on Foata normal form. 0/12309 useless extension candidates. Maximal degree in co-relation 244766. Up to 13040 conditions per place. [2022-12-13 07:32:38,513 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 2164 selfloop transitions, 398 changer transitions 437/2999 dead transitions. [2022-12-13 07:32:38,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 2999 transitions, 115105 flow [2022-12-13 07:32:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-12-13 07:32:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-12-13 07:32:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 522 transitions. [2022-12-13 07:32:38,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31636363636363635 [2022-12-13 07:32:38,525 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 395 predicate places. [2022-12-13 07:32:38,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 425 places, 2999 transitions, 115105 flow [2022-12-13 07:32:38,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 393 places, 2562 transitions, 98499 flow [2022-12-13 07:32:38,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:32:38,723 INFO L89 Accepts]: Start accepts. Operand has 393 places, 2562 transitions, 98499 flow [2022-12-13 07:32:38,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:32:38,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:32:38,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 393 places, 2562 transitions, 98499 flow [2022-12-13 07:32:38,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 393 places, 2562 transitions, 98499 flow [2022-12-13 07:32:38,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:32:38,825 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:32:38,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 07:32:38,826 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 2562 transitions, 98499 flow [2022-12-13 07:32:38,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.04) internal successors, (76), 24 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:38,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:32:38,826 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:32:38,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 07:32:39,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 07:32:39,033 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:32:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:32:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash -123806835, now seen corresponding path program 9 times [2022-12-13 07:32:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:32:39,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747847672] [2022-12-13 07:32:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:32:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:32:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:32:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:32:39,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747847672] [2022-12-13 07:32:39,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747847672] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:32:39,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770691304] [2022-12-13 07:32:39,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:32:39,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:32:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:32:39,428 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:32:39,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 07:32:39,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 07:32:39,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:32:39,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 07:32:39,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:32:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:39,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:32:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:40,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770691304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:32:40,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:32:40,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-13 07:32:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634381759] [2022-12-13 07:32:40,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:32:40,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:32:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:32:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:32:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-12-13 07:32:40,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:32:40,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 2562 transitions, 98499 flow. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:32:40,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:32:40,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:32:40,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:32:49,667 INFO L130 PetriNetUnfolder]: 9073/14764 cut-off events. [2022-12-13 07:32:49,667 INFO L131 PetriNetUnfolder]: For 1283/1283 co-relation queries the response was YES. [2022-12-13 07:32:49,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297250 conditions, 14764 events. 9073/14764 cut-off events. For 1283/1283 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 97504 event pairs, 0 based on Foata normal form. 0/13806 useless extension candidates. Maximal degree in co-relation 291199. Up to 14729 conditions per place. [2022-12-13 07:32:49,799 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 2405 selfloop transitions, 456 changer transitions 455/3316 dead transitions. [2022-12-13 07:32:49,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 3316 transitions, 134044 flow [2022-12-13 07:32:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-13 07:32:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-12-13 07:32:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 541 transitions. [2022-12-13 07:32:49,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3725895316804408 [2022-12-13 07:32:49,802 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 428 predicate places. [2022-12-13 07:32:49,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 458 places, 3316 transitions, 134044 flow [2022-12-13 07:32:49,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 434 places, 2861 transitions, 115712 flow [2022-12-13 07:32:50,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:32:50,233 INFO L89 Accepts]: Start accepts. Operand has 434 places, 2861 transitions, 115712 flow [2022-12-13 07:32:50,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:32:50,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:32:50,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 434 places, 2861 transitions, 115712 flow [2022-12-13 07:32:50,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 434 places, 2861 transitions, 115712 flow [2022-12-13 07:32:50,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:32:50,325 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:32:50,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 07:32:50,326 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 2861 transitions, 115712 flow [2022-12-13 07:32:50,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:32:50,326 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:32:50,326 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:32:50,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 07:32:50,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:32:50,527 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:32:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:32:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2048545325, now seen corresponding path program 10 times [2022-12-13 07:32:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:32:50,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083608232] [2022-12-13 07:32:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:32:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:32:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:32:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:32:51,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083608232] [2022-12-13 07:32:51,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083608232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:32:51,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125980380] [2022-12-13 07:32:51,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:32:51,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:32:51,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:32:51,102 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:32:51,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 07:32:51,196 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:32:51,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:32:51,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 07:32:51,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:32:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:51,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:32:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:32:52,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125980380] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:32:52,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:32:52,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-12-13 07:32:52,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569470996] [2022-12-13 07:32:52,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:32:52,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 07:32:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:32:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 07:32:52,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2022-12-13 07:32:52,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:32:52,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 2861 transitions, 115712 flow. Second operand has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:32:52,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:32:52,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:32:52,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:33:05,409 INFO L130 PetriNetUnfolder]: 10738/17481 cut-off events. [2022-12-13 07:33:05,409 INFO L131 PetriNetUnfolder]: For 1522/1522 co-relation queries the response was YES. [2022-12-13 07:33:05,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369393 conditions, 17481 events. 10738/17481 cut-off events. For 1522/1522 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 118721 event pairs, 0 based on Foata normal form. 0/16311 useless extension candidates. Maximal degree in co-relation 362101. Up to 17446 conditions per place. [2022-12-13 07:33:05,575 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 2744 selfloop transitions, 640 changer transitions 530/3914 dead transitions. [2022-12-13 07:33:05,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 3914 transitions, 166035 flow [2022-12-13 07:33:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-12-13 07:33:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2022-12-13 07:33:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 732 transitions. [2022-12-13 07:33:05,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3824451410658307 [2022-12-13 07:33:05,577 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 490 predicate places. [2022-12-13 07:33:05,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 520 places, 3914 transitions, 166035 flow [2022-12-13 07:33:05,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 494 places, 3384 transitions, 143628 flow [2022-12-13 07:33:05,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:33:05,864 INFO L89 Accepts]: Start accepts. Operand has 494 places, 3384 transitions, 143628 flow [2022-12-13 07:33:05,893 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:33:05,893 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:33:05,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 494 places, 3384 transitions, 143628 flow [2022-12-13 07:33:05,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 494 places, 3384 transitions, 143628 flow [2022-12-13 07:33:05,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:33:05,999 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:33:06,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 07:33:06,000 INFO L495 AbstractCegarLoop]: Abstraction has has 494 places, 3384 transitions, 143628 flow [2022-12-13 07:33:06,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:33:06,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:33:06,000 INFO L214 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:33:06,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 07:33:06,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-12-13 07:33:06,201 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:33:06,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:33:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash 910659909, now seen corresponding path program 11 times [2022-12-13 07:33:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:33:06,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293462440] [2022-12-13 07:33:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:33:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:33:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:33:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:07,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:33:07,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293462440] [2022-12-13 07:33:07,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293462440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:33:07,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727729520] [2022-12-13 07:33:07,197 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:33:07,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:33:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:33:07,199 INFO L229 MonitoredProcess]: Starting monitored process 15 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:33:07,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 07:33:07,288 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-12-13 07:33:07,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:33:07,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:33:07,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:33:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:07,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:33:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:09,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727729520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:33:09,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:33:09,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-13 07:33:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094821920] [2022-12-13 07:33:09,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:33:09,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 07:33:09,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:33:09,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 07:33:09,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2022-12-13 07:33:09,169 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:33:09,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 3384 transitions, 143628 flow. Second operand has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:33:09,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:33:09,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:33:09,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:33:25,373 INFO L130 PetriNetUnfolder]: 11723/19066 cut-off events. [2022-12-13 07:33:25,373 INFO L131 PetriNetUnfolder]: For 1601/1601 co-relation queries the response was YES. [2022-12-13 07:33:25,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421924 conditions, 19066 events. 11723/19066 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 130229 event pairs, 0 based on Foata normal form. 0/17740 useless extension candidates. Maximal degree in co-relation 412943. Up to 19031 conditions per place. [2022-12-13 07:33:25,534 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 3178 selfloop transitions, 641 changer transitions 431/4250 dead transitions. [2022-12-13 07:33:25,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 4250 transitions, 188692 flow [2022-12-13 07:33:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-12-13 07:33:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-12-13 07:33:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 609 transitions. [2022-12-13 07:33:25,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3690909090909091 [2022-12-13 07:33:25,536 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 538 predicate places. [2022-12-13 07:33:25,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 568 places, 4250 transitions, 188692 flow [2022-12-13 07:33:25,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 550 places, 3819 transitions, 169728 flow [2022-12-13 07:33:25,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:33:25,942 INFO L89 Accepts]: Start accepts. Operand has 550 places, 3819 transitions, 169728 flow [2022-12-13 07:33:25,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:33:25,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:33:25,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 550 places, 3819 transitions, 169728 flow [2022-12-13 07:33:26,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 550 places, 3819 transitions, 169728 flow [2022-12-13 07:33:26,063 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:33:26,072 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:33:26,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 07:33:26,072 INFO L495 AbstractCegarLoop]: Abstraction has has 550 places, 3819 transitions, 169728 flow [2022-12-13 07:33:26,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:33:26,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:33:26,073 INFO L214 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:33:26,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 07:33:26,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:33:26,274 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:33:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:33:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1838439437, now seen corresponding path program 12 times [2022-12-13 07:33:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:33:26,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903590813] [2022-12-13 07:33:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:33:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:33:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:33:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:27,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:33:27,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903590813] [2022-12-13 07:33:27,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903590813] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:33:27,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670269928] [2022-12-13 07:33:27,072 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:33:27,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:33:27,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:33:27,073 INFO L229 MonitoredProcess]: Starting monitored process 16 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:33:27,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 07:33:27,192 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-12-13 07:33:27,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:33:27,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:33:27,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:33:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:27,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:33:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:29,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670269928] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:33:29,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:33:29,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-13 07:33:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209590681] [2022-12-13 07:33:29,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:33:29,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 07:33:29,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:33:29,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 07:33:29,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2022-12-13 07:33:29,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:33:29,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 3819 transitions, 169728 flow. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 30 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:33:29,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:33:29,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:33:29,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:33:52,047 INFO L130 PetriNetUnfolder]: 13389/21678 cut-off events. [2022-12-13 07:33:52,048 INFO L131 PetriNetUnfolder]: For 1688/1688 co-relation queries the response was YES. [2022-12-13 07:33:52,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501316 conditions, 21678 events. 13389/21678 cut-off events. For 1688/1688 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 149668 event pairs, 0 based on Foata normal form. 0/20548 useless extension candidates. Maximal degree in co-relation 492312. Up to 21643 conditions per place. [2022-12-13 07:33:52,265 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 3259 selfloop transitions, 688 changer transitions 1200/5147 dead transitions. [2022-12-13 07:33:52,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 5147 transitions, 238508 flow [2022-12-13 07:33:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-12-13 07:33:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2022-12-13 07:33:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 801 transitions. [2022-12-13 07:33:52,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29843517138599107 [2022-12-13 07:33:52,268 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 641 predicate places. [2022-12-13 07:33:52,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 671 places, 5147 transitions, 238508 flow [2022-12-13 07:33:52,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 581 places, 3947 transitions, 183308 flow [2022-12-13 07:33:52,825 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:33:52,825 INFO L89 Accepts]: Start accepts. Operand has 581 places, 3947 transitions, 183308 flow [2022-12-13 07:33:52,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:33:52,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:33:52,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 581 places, 3947 transitions, 183308 flow [2022-12-13 07:33:52,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 581 places, 3947 transitions, 183308 flow [2022-12-13 07:33:52,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:33:52,987 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:33:52,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 07:33:52,988 INFO L495 AbstractCegarLoop]: Abstraction has has 581 places, 3947 transitions, 183308 flow [2022-12-13 07:33:52,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 30 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:33:52,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:33:52,988 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:33:52,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 07:33:53,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:33:53,189 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:33:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:33:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash 862239757, now seen corresponding path program 13 times [2022-12-13 07:33:53,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:33:53,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112306021] [2022-12-13 07:33:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:33:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:33:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:33:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:53,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:33:53,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112306021] [2022-12-13 07:33:53,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112306021] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:33:53,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988983180] [2022-12-13 07:33:53,886 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:33:53,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:33:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:33:53,888 INFO L229 MonitoredProcess]: Starting monitored process 17 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:33:53,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 07:33:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:33:53,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:33:53,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:33:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:54,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:33:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:33:56,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988983180] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:33:56,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:33:56,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 07:33:56,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204286297] [2022-12-13 07:33:56,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:33:56,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:33:56,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:33:56,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:33:56,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:33:56,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:33:56,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 3947 transitions, 183308 flow. Second operand has 30 states, 30 states have (on average 2.4) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:33:56,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:33:56,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:33:56,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:34:24,965 INFO L130 PetriNetUnfolder]: 15256/24659 cut-off events. [2022-12-13 07:34:24,965 INFO L131 PetriNetUnfolder]: For 1896/1896 co-relation queries the response was YES. [2022-12-13 07:34:24,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594943 conditions, 24659 events. 15256/24659 cut-off events. For 1896/1896 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 173846 event pairs, 0 based on Foata normal form. 0/23101 useless extension candidates. Maximal degree in co-relation 584968. Up to 24624 conditions per place. [2022-12-13 07:34:25,189 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 3688 selfloop transitions, 750 changer transitions 1047/5485 dead transitions. [2022-12-13 07:34:25,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 5485 transitions, 265236 flow [2022-12-13 07:34:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-12-13 07:34:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2022-12-13 07:34:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 890 transitions. [2022-12-13 07:34:25,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3315946348733234 [2022-12-13 07:34:25,192 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 672 predicate places. [2022-12-13 07:34:25,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 702 places, 5485 transitions, 265236 flow [2022-12-13 07:34:25,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 642 places, 4438 transitions, 214980 flow [2022-12-13 07:34:25,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:34:25,626 INFO L89 Accepts]: Start accepts. Operand has 642 places, 4438 transitions, 214980 flow [2022-12-13 07:34:25,680 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:34:25,680 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:34:25,680 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 642 places, 4438 transitions, 214980 flow [2022-12-13 07:34:25,851 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 642 places, 4438 transitions, 214980 flow [2022-12-13 07:34:25,851 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:34:25,865 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:34:25,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-13 07:34:25,866 INFO L495 AbstractCegarLoop]: Abstraction has has 642 places, 4438 transitions, 214980 flow [2022-12-13 07:34:25,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.4) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:34:25,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:34:25,866 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:34:25,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 07:34:26,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 07:34:26,067 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:34:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:34:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash 887107115, now seen corresponding path program 14 times [2022-12-13 07:34:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:34:26,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701422844] [2022-12-13 07:34:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:34:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:34:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:34:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:34:26,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:34:26,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701422844] [2022-12-13 07:34:26,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701422844] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:34:26,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131221326] [2022-12-13 07:34:26,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:34:26,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:34:26,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:34:26,864 INFO L229 MonitoredProcess]: Starting monitored process 18 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:34:26,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 07:34:26,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:34:26,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:34:26,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:34:26,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:34:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:34:27,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:34:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:34:29,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131221326] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:34:29,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:34:29,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 07:34:29,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019237745] [2022-12-13 07:34:29,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:34:29,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:34:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:34:29,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:34:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:34:29,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:34:29,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 4438 transitions, 214980 flow. Second operand has 30 states, 30 states have (on average 2.533333333333333) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:34:29,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:34:29,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:34:29,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:35:05,998 INFO L130 PetriNetUnfolder]: 16600/26855 cut-off events. [2022-12-13 07:35:05,998 INFO L131 PetriNetUnfolder]: For 2190/2190 co-relation queries the response was YES. [2022-12-13 07:35:06,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674945 conditions, 26855 events. 16600/26855 cut-off events. For 2190/2190 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 191615 event pairs, 0 based on Foata normal form. 0/25393 useless extension candidates. Maximal degree in co-relation 663237. Up to 26820 conditions per place. [2022-12-13 07:35:06,290 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 4294 selfloop transitions, 833 changer transitions 849/5976 dead transitions. [2022-12-13 07:35:06,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 784 places, 5976 transitions, 301050 flow [2022-12-13 07:35:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-12-13 07:35:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2022-12-13 07:35:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 942 transitions. [2022-12-13 07:35:06,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2994278448823903 [2022-12-13 07:35:06,293 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 754 predicate places. [2022-12-13 07:35:06,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 784 places, 5976 transitions, 301050 flow [2022-12-13 07:35:06,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 706 places, 5127 transitions, 258600 flow [2022-12-13 07:35:06,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:35:06,842 INFO L89 Accepts]: Start accepts. Operand has 706 places, 5127 transitions, 258600 flow [2022-12-13 07:35:06,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:35:06,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:35:06,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 706 places, 5127 transitions, 258600 flow [2022-12-13 07:35:07,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 706 places, 5127 transitions, 258600 flow [2022-12-13 07:35:07,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:35:07,148 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:35:07,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 307 [2022-12-13 07:35:07,149 INFO L495 AbstractCegarLoop]: Abstraction has has 706 places, 5127 transitions, 258600 flow [2022-12-13 07:35:07,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.533333333333333) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:35:07,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:35:07,149 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:35:07,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 07:35:07,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:35:07,350 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:35:07,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:35:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1770116411, now seen corresponding path program 15 times [2022-12-13 07:35:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:35:07,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566153099] [2022-12-13 07:35:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:35:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:35:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:35:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:35:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:35:08,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566153099] [2022-12-13 07:35:08,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566153099] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:35:08,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575600063] [2022-12-13 07:35:08,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:35:08,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:35:08,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:35:08,336 INFO L229 MonitoredProcess]: Starting monitored process 19 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:35:08,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 07:35:08,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-12-13 07:35:08,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:35:08,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:35:08,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:35:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:35:09,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:35:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:35:10,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575600063] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:35:10,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:35:10,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 07:35:10,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299862542] [2022-12-13 07:35:10,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:35:10,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:35:10,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:35:10,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:35:10,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:35:10,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:35:10,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 5127 transitions, 258600 flow. Second operand has 30 states, 30 states have (on average 2.533333333333333) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:35:10,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:35:10,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:35:10,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:35:52,609 INFO L130 PetriNetUnfolder]: 17909/28946 cut-off events. [2022-12-13 07:35:52,610 INFO L131 PetriNetUnfolder]: For 2366/2366 co-relation queries the response was YES. [2022-12-13 07:35:52,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756475 conditions, 28946 events. 17909/28946 cut-off events. For 2366/2366 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 208228 event pairs, 0 based on Foata normal form. 0/27410 useless extension candidates. Maximal degree in co-relation 743884. Up to 28911 conditions per place. [2022-12-13 07:35:52,916 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 4537 selfloop transitions, 954 changer transitions 886/6377 dead transitions. [2022-12-13 07:35:52,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 826 places, 6377 transitions, 334007 flow [2022-12-13 07:35:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-12-13 07:35:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2022-12-13 07:35:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 820 transitions. [2022-12-13 07:35:52,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3080390683696469 [2022-12-13 07:35:52,918 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 796 predicate places. [2022-12-13 07:35:52,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 826 places, 6377 transitions, 334007 flow [2022-12-13 07:35:53,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 758 places, 5491 transitions, 287935 flow [2022-12-13 07:35:53,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:35:53,645 INFO L89 Accepts]: Start accepts. Operand has 758 places, 5491 transitions, 287935 flow [2022-12-13 07:35:53,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:35:53,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:35:53,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 758 places, 5491 transitions, 287935 flow [2022-12-13 07:35:53,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 758 places, 5491 transitions, 287935 flow [2022-12-13 07:35:53,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:35:53,954 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:35:53,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-13 07:35:53,955 INFO L495 AbstractCegarLoop]: Abstraction has has 758 places, 5491 transitions, 287935 flow [2022-12-13 07:35:53,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.533333333333333) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:35:53,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:35:53,955 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:35:53,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 07:35:54,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:35:54,156 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:35:54,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:35:54,157 INFO L85 PathProgramCache]: Analyzing trace with hash 550923989, now seen corresponding path program 16 times [2022-12-13 07:35:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:35:54,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865904771] [2022-12-13 07:35:54,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:35:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:35:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:35:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:35:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:35:54,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865904771] [2022-12-13 07:35:54,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865904771] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:35:54,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975009402] [2022-12-13 07:35:54,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:35:54,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:35:54,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:35:54,749 INFO L229 MonitoredProcess]: Starting monitored process 20 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:35:54,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 07:35:54,836 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:35:54,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:35:54,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:35:54,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:35:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:35:55,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:35:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:35:57,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975009402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:35:57,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:35:57,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 07:35:57,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002687446] [2022-12-13 07:35:57,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:35:57,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:35:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:35:57,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:35:57,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:35:57,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:35:57,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 5491 transitions, 287935 flow. Second operand has 30 states, 30 states have (on average 2.4) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:35:57,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:35:57,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:35:57,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:36:42,193 INFO L130 PetriNetUnfolder]: 19085/30900 cut-off events. [2022-12-13 07:36:42,194 INFO L131 PetriNetUnfolder]: For 2671/2671 co-relation queries the response was YES. [2022-12-13 07:36:42,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838539 conditions, 30900 events. 19085/30900 cut-off events. For 2671/2671 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 225857 event pairs, 0 based on Foata normal form. 0/29110 useless extension candidates. Maximal degree in co-relation 825033. Up to 30865 conditions per place. [2022-12-13 07:36:42,508 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 5018 selfloop transitions, 793 changer transitions 787/6598 dead transitions. [2022-12-13 07:36:42,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 854 places, 6598 transitions, 359055 flow [2022-12-13 07:36:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-12-13 07:36:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2022-12-13 07:36:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 785 transitions. [2022-12-13 07:36:42,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36785379568884724 [2022-12-13 07:36:42,510 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 824 predicate places. [2022-12-13 07:36:42,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 854 places, 6598 transitions, 359055 flow [2022-12-13 07:36:43,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 814 places, 5811 transitions, 316335 flow [2022-12-13 07:36:43,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:36:43,252 INFO L89 Accepts]: Start accepts. Operand has 814 places, 5811 transitions, 316335 flow [2022-12-13 07:36:43,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:36:43,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:36:43,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 814 places, 5811 transitions, 316335 flow [2022-12-13 07:36:43,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 814 places, 5811 transitions, 316335 flow [2022-12-13 07:36:43,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:36:43,588 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:36:43,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 337 [2022-12-13 07:36:43,589 INFO L495 AbstractCegarLoop]: Abstraction has has 814 places, 5811 transitions, 316335 flow [2022-12-13 07:36:43,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.4) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:36:43,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:36:43,589 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:36:43,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 07:36:43,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:36:43,790 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:36:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:36:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1505119731, now seen corresponding path program 17 times [2022-12-13 07:36:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:36:43,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608122055] [2022-12-13 07:36:43,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:36:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:36:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:36:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:44,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:36:44,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608122055] [2022-12-13 07:36:44,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608122055] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:36:44,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176799300] [2022-12-13 07:36:44,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:36:44,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:36:44,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:36:44,517 INFO L229 MonitoredProcess]: Starting monitored process 21 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:36:44,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 07:36:44,610 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-13 07:36:44,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:36:44,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:36:44,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:36:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:45,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:36:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:46,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176799300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:36:46,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:36:46,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 07:36:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021994130] [2022-12-13 07:36:46,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:36:46,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:36:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:36:46,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:36:46,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:36:46,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:36:46,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 814 places, 5811 transitions, 316335 flow. Second operand has 30 states, 30 states have (on average 2.4) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:36:46,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:36:46,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:36:46,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:37:38,469 INFO L130 PetriNetUnfolder]: 20657/33378 cut-off events. [2022-12-13 07:37:38,469 INFO L131 PetriNetUnfolder]: For 2732/2732 co-relation queries the response was YES. [2022-12-13 07:37:38,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939135 conditions, 33378 events. 20657/33378 cut-off events. For 2732/2732 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 245436 event pairs, 0 based on Foata normal form. 0/31402 useless extension candidates. Maximal degree in co-relation 923998. Up to 33343 conditions per place. [2022-12-13 07:37:38,844 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 5455 selfloop transitions, 938 changer transitions 627/7020 dead transitions. [2022-12-13 07:37:38,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 7020 transitions, 395910 flow [2022-12-13 07:37:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-12-13 07:37:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2022-12-13 07:37:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 786 transitions. [2022-12-13 07:37:38,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3338997451146984 [2022-12-13 07:37:38,847 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 890 predicate places. [2022-12-13 07:37:38,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 920 places, 7020 transitions, 395910 flow [2022-12-13 07:37:39,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 884 places, 6393 transitions, 360798 flow [2022-12-13 07:37:39,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:37:39,714 INFO L89 Accepts]: Start accepts. Operand has 884 places, 6393 transitions, 360798 flow [2022-12-13 07:37:39,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:37:39,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:37:39,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 884 places, 6393 transitions, 360798 flow [2022-12-13 07:37:40,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 884 places, 6393 transitions, 360798 flow [2022-12-13 07:37:40,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:37:40,089 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:37:40,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 376 [2022-12-13 07:37:40,089 INFO L495 AbstractCegarLoop]: Abstraction has has 884 places, 6393 transitions, 360798 flow [2022-12-13 07:37:40,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.4) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:37:40,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:37:40,090 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:37:40,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 07:37:40,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 07:37:40,296 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:37:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:37:40,297 INFO L85 PathProgramCache]: Analyzing trace with hash 270823431, now seen corresponding path program 18 times [2022-12-13 07:37:40,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:37:40,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885377648] [2022-12-13 07:37:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:37:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:37:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:37:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:37:41,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:37:41,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885377648] [2022-12-13 07:37:41,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885377648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:37:41,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43500679] [2022-12-13 07:37:41,047 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:37:41,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:37:41,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:37:41,048 INFO L229 MonitoredProcess]: Starting monitored process 22 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:37:41,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 07:37:41,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-12-13 07:37:41,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:37:41,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:37:41,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:37:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:37:41,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:37:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:37:43,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43500679] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:37:43,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:37:43,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 07:37:43,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596969903] [2022-12-13 07:37:43,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:37:43,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:37:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:37:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:37:43,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:37:43,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:37:43,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 884 places, 6393 transitions, 360798 flow. Second operand has 30 states, 30 states have (on average 2.533333333333333) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:37:43,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:37:43,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:37:43,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:39:07,243 INFO L130 PetriNetUnfolder]: 22645/36556 cut-off events. [2022-12-13 07:39:07,243 INFO L131 PetriNetUnfolder]: For 2971/2971 co-relation queries the response was YES. [2022-12-13 07:39:07,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065049 conditions, 36556 events. 22645/36556 cut-off events. For 2971/2971 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 273531 event pairs, 0 based on Foata normal form. 0/34688 useless extension candidates. Maximal degree in co-relation 1048791. Up to 36521 conditions per place. [2022-12-13 07:39:07,725 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 5928 selfloop transitions, 911 changer transitions 1154/7993 dead transitions. [2022-12-13 07:39:07,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 7993 transitions, 466573 flow [2022-12-13 07:39:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-12-13 07:39:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2022-12-13 07:39:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 1011 transitions. [2022-12-13 07:39:07,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2945804195804196 [2022-12-13 07:39:07,727 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 1009 predicate places. [2022-12-13 07:39:07,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 1039 places, 7993 transitions, 466573 flow [2022-12-13 07:39:08,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 937 places, 6839 transitions, 399641 flow [2022-12-13 07:39:08,758 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:39:08,758 INFO L89 Accepts]: Start accepts. Operand has 937 places, 6839 transitions, 399641 flow [2022-12-13 07:39:08,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:39:08,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:39:08,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 937 places, 6839 transitions, 399641 flow [2022-12-13 07:39:09,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 937 places, 6839 transitions, 399641 flow [2022-12-13 07:39:09,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:39:09,156 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:39:09,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 402 [2022-12-13 07:39:09,160 INFO L495 AbstractCegarLoop]: Abstraction has has 937 places, 6839 transitions, 399641 flow [2022-12-13 07:39:09,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.533333333333333) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:39:09,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:39:09,160 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:39:09,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 07:39:09,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 07:39:09,367 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:39:09,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:39:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash 618080725, now seen corresponding path program 19 times [2022-12-13 07:39:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:39:09,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349196212] [2022-12-13 07:39:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:39:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:39:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:39:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:39:10,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:39:10,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349196212] [2022-12-13 07:39:10,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349196212] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:39:10,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635529403] [2022-12-13 07:39:10,219 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:39:10,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:39:10,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:39:10,221 INFO L229 MonitoredProcess]: Starting monitored process 23 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:39:10,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 07:39:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:39:10,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:39:10,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:39:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:39:10,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:39:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:39:12,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635529403] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:39:12,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:39:12,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 07:39:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803165388] [2022-12-13 07:39:12,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:39:12,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:39:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:39:12,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:39:12,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:39:12,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:39:12,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 6839 transitions, 399641 flow. Second operand has 30 states, 30 states have (on average 2.4) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:39:12,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:39:12,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:39:12,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:40:37,979 INFO L130 PetriNetUnfolder]: 24468/39607 cut-off events. [2022-12-13 07:40:37,980 INFO L131 PetriNetUnfolder]: For 3502/3502 co-relation queries the response was YES. [2022-12-13 07:40:38,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193619 conditions, 39607 events. 24468/39607 cut-off events. For 3502/3502 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 300836 event pairs, 0 based on Foata normal form. 0/37317 useless extension candidates. Maximal degree in co-relation 1175712. Up to 39572 conditions per place. [2022-12-13 07:40:38,513 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 6380 selfloop transitions, 973 changer transitions 1096/8449 dead transitions. [2022-12-13 07:40:38,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 8449 transitions, 510453 flow [2022-12-13 07:40:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-12-13 07:40:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2022-12-13 07:40:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 910 transitions. [2022-12-13 07:40:38,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3794829024186822 [2022-12-13 07:40:38,516 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 1015 predicate places. [2022-12-13 07:40:38,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 1045 places, 8449 transitions, 510453 flow [2022-12-13 07:40:39,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 992 places, 7353 transitions, 444378 flow [2022-12-13 07:40:39,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:40:39,473 INFO L89 Accepts]: Start accepts. Operand has 992 places, 7353 transitions, 444378 flow [2022-12-13 07:40:39,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:40:39,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:40:39,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 992 places, 7353 transitions, 444378 flow [2022-12-13 07:40:39,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 992 places, 7353 transitions, 444378 flow [2022-12-13 07:40:39,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:40:39,866 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:40:39,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 393 [2022-12-13 07:40:39,866 INFO L495 AbstractCegarLoop]: Abstraction has has 992 places, 7353 transitions, 444378 flow [2022-12-13 07:40:39,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.4) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:40:39,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:40:39,867 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:40:39,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 07:40:40,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 07:40:40,068 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:40:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:40:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1603243407, now seen corresponding path program 20 times [2022-12-13 07:40:40,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:40:40,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607811122] [2022-12-13 07:40:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:40:40,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:40:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:40:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:40:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:40:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607811122] [2022-12-13 07:40:40,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607811122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:40:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769268783] [2022-12-13 07:40:40,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:40:40,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:40:40,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:40:40,884 INFO L229 MonitoredProcess]: Starting monitored process 24 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:40:40,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 07:40:40,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:40:40,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:40:40,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:40:41,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:40:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:40:41,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:40:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:40:43,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769268783] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:40:43,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:40:43,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 07:40:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417495831] [2022-12-13 07:40:43,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:40:43,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:40:43,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:40:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:40:43,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:40:43,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:40:43,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 992 places, 7353 transitions, 444378 flow. Second operand has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:40:43,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:40:43,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:40:43,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:42:15,974 INFO L130 PetriNetUnfolder]: 25294/40921 cut-off events. [2022-12-13 07:42:15,974 INFO L131 PetriNetUnfolder]: For 3544/3544 co-relation queries the response was YES. [2022-12-13 07:42:16,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274231 conditions, 40921 events. 25294/40921 cut-off events. For 3544/3544 co-relation queries the response was YES. Maximal size of possible extension queue 1500. Compared 312628 event pairs, 0 based on Foata normal form. 0/38569 useless extension candidates. Maximal degree in co-relation 1254729. Up to 40886 conditions per place. [2022-12-13 07:42:16,467 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 6856 selfloop transitions, 945 changer transitions 767/8568 dead transitions. [2022-12-13 07:42:16,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1093 places, 8568 transitions, 534825 flow [2022-12-13 07:42:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-12-13 07:42:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2022-12-13 07:42:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 828 transitions. [2022-12-13 07:42:16,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3689839572192513 [2022-12-13 07:42:16,469 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 1063 predicate places. [2022-12-13 07:42:16,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 1093 places, 8568 transitions, 534825 flow [2022-12-13 07:42:17,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1055 places, 7801 transitions, 487055 flow [2022-12-13 07:42:17,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:42:17,541 INFO L89 Accepts]: Start accepts. Operand has 1055 places, 7801 transitions, 487055 flow [2022-12-13 07:42:17,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:42:17,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:42:17,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1055 places, 7801 transitions, 487055 flow [2022-12-13 07:42:18,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 1055 places, 7801 transitions, 487055 flow [2022-12-13 07:42:18,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:42:18,257 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:42:18,259 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 718 [2022-12-13 07:42:18,259 INFO L495 AbstractCegarLoop]: Abstraction has has 1055 places, 7801 transitions, 487055 flow [2022-12-13 07:42:18,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:42:18,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:42:18,259 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:42:18,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 07:42:18,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:42:18,465 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:42:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:42:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1950500701, now seen corresponding path program 21 times [2022-12-13 07:42:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:42:18,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990154439] [2022-12-13 07:42:18,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:42:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:42:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:42:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:42:19,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:42:19,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990154439] [2022-12-13 07:42:19,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990154439] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:42:19,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118524336] [2022-12-13 07:42:19,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:42:19,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:42:19,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:42:19,490 INFO L229 MonitoredProcess]: Starting monitored process 25 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:42:19,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 07:42:19,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 07:42:19,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:42:19,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 07:42:19,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:42:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:42:20,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:42:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:42:22,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118524336] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:42:22,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:42:22,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 07:42:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237959041] [2022-12-13 07:42:22,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:42:22,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:42:22,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:42:22,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:42:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2022-12-13 07:42:22,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 07:42:22,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1055 places, 7801 transitions, 487055 flow. Second operand has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:42:22,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:42:22,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 07:42:22,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 07:44:12,521 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 07:44:12,521 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 07:44:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-12-13 07:44:12,554 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 07:44:12,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 07:44:12,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:44:12,755 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/22 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 1255201 conditions, 39056 events (24689/39055 cut-off events. For 3133/3133 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 300455 event pairs, 0 based on Foata normal form. 0/38039 useless extension candidates. Maximal degree in co-relation 1251654. Up to 39020 conditions per place.). [2022-12-13 07:44:12,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 07:44:12,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 07:44:12,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 07:44:12,757 INFO L445 BasicCegarLoop]: Path program histogram: [21, 5, 3, 2] [2022-12-13 07:44:12,759 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:44:12,759 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:44:12,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:44:12 BasicIcfg [2022-12-13 07:44:12,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:44:12,761 INFO L158 Benchmark]: Toolchain (without parser) took 772704.11ms. Allocated memory was 190.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 166.9MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-13 07:44:12,762 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory was 167.2MB in the beginning and 167.1MB in the end (delta: 152.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:44:12,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.71ms. Allocated memory is still 190.8MB. Free memory was 166.9MB in the beginning and 153.5MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 07:44:12,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.01ms. Allocated memory is still 190.8MB. Free memory was 153.5MB in the beginning and 151.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:44:12,762 INFO L158 Benchmark]: Boogie Preprocessor took 34.28ms. Allocated memory is still 190.8MB. Free memory was 151.5MB in the beginning and 150.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 07:44:12,762 INFO L158 Benchmark]: RCFGBuilder took 511.75ms. Allocated memory is still 190.8MB. Free memory was 150.4MB in the beginning and 131.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 07:44:12,762 INFO L158 Benchmark]: TraceAbstraction took 771790.28ms. Allocated memory was 190.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 130.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-13 07:44:12,763 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.13ms. Allocated memory is still 190.8MB. Free memory was 167.2MB in the beginning and 167.1MB in the end (delta: 152.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.71ms. Allocated memory is still 190.8MB. Free memory was 166.9MB in the beginning and 153.5MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.01ms. Allocated memory is still 190.8MB. Free memory was 153.5MB in the beginning and 151.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.28ms. Allocated memory is still 190.8MB. Free memory was 151.5MB in the beginning and 150.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 511.75ms. Allocated memory is still 190.8MB. Free memory was 150.4MB in the beginning and 131.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 771790.28ms. Allocated memory was 190.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 130.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 93 PlacesBefore, 30 PlacesAfterwards, 90 TransitionsBefore, 22 TransitionsAfterwards, 1250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 28 ConcurrentYvCompositions, 5 ChoiceCompositions, 68 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 707, independent: 693, independent conditional: 693, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 707, independent: 693, independent conditional: 0, independent unconditional: 693, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 707, independent: 693, independent conditional: 0, independent unconditional: 693, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 707, independent: 693, independent conditional: 0, independent unconditional: 693, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 638, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 638, independent: 624, independent conditional: 0, independent unconditional: 624, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 707, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 638, unknown conditional: 0, unknown unconditional: 638] , Statistics on independence cache: Total cache size (in pairs): 1038, Positive cache size: 1027, Positive conditional cache size: 0, Positive unconditional cache size: 1027, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 34 PlacesBefore, 34 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 220 TransitionsBefore, 220 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 326 TransitionsBefore, 326 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 385 TransitionsBefore, 385 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 126 PlacesBefore, 126 PlacesAfterwards, 433 TransitionsBefore, 433 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 157 PlacesBefore, 157 PlacesAfterwards, 659 TransitionsBefore, 659 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 187 PlacesBefore, 187 PlacesAfterwards, 920 TransitionsBefore, 920 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 231 PlacesBefore, 231 PlacesAfterwards, 1344 TransitionsBefore, 1344 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 270 PlacesBefore, 270 PlacesAfterwards, 1499 TransitionsBefore, 1499 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 313 PlacesBefore, 313 PlacesAfterwards, 1901 TransitionsBefore, 1901 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 351 PlacesBefore, 351 PlacesAfterwards, 2260 TransitionsBefore, 2260 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 393 PlacesBefore, 393 PlacesAfterwards, 2562 TransitionsBefore, 2562 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 434 PlacesBefore, 434 PlacesAfterwards, 2861 TransitionsBefore, 2861 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 494 PlacesBefore, 494 PlacesAfterwards, 3384 TransitionsBefore, 3384 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 550 PlacesBefore, 550 PlacesAfterwards, 3819 TransitionsBefore, 3819 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 581 PlacesBefore, 581 PlacesAfterwards, 3947 TransitionsBefore, 3947 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 642 PlacesBefore, 642 PlacesAfterwards, 4438 TransitionsBefore, 4438 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 706 PlacesBefore, 706 PlacesAfterwards, 5127 TransitionsBefore, 5127 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 758 PlacesBefore, 758 PlacesAfterwards, 5491 TransitionsBefore, 5491 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 814 PlacesBefore, 814 PlacesAfterwards, 5811 TransitionsBefore, 5811 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 884 PlacesBefore, 884 PlacesAfterwards, 6393 TransitionsBefore, 6393 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 937 PlacesBefore, 937 PlacesAfterwards, 6839 TransitionsBefore, 6839 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 992 PlacesBefore, 992 PlacesAfterwards, 7353 TransitionsBefore, 7353 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 1055 PlacesBefore, 1055 PlacesAfterwards, 7801 TransitionsBefore, 7801 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/22 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 1255201 conditions, 39056 events (24689/39055 cut-off events. For 3133/3133 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 300455 event pairs, 0 based on Foata normal form. 0/38039 useless extension candidates. Maximal degree in co-relation 1251654. Up to 39020 conditions per place.). - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/22 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 1255201 conditions, 39056 events (24689/39055 cut-off events. For 3133/3133 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 300455 event pairs, 0 based on Foata normal form. 0/38039 useless extension candidates. Maximal degree in co-relation 1251654. Up to 39020 conditions per place.). - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/22 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 1255201 conditions, 39056 events (24689/39055 cut-off events. For 3133/3133 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 300455 event pairs, 0 based on Foata normal form. 0/38039 useless extension candidates. Maximal degree in co-relation 1251654. Up to 39020 conditions per place.). - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/22 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 1255201 conditions, 39056 events (24689/39055 cut-off events. For 3133/3133 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 300455 event pairs, 0 based on Foata normal form. 0/38039 useless extension candidates. Maximal degree in co-relation 1251654. Up to 39020 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 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: 771.6s, OverallIterations: 31, TraceHistogramMax: 6, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 689.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19345 SdHoareTripleChecker+Valid, 27.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19345 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 23.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 1803 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46824 IncrementalHoareTripleChecker+Invalid, 48627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1803 mSolverCounterUnsat, 13 mSDtfsCounter, 46824 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3531 GetRequests, 976 SyntacticMatches, 37 SemanticMatches, 2518 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108606 ImplicationChecksByTransitivity, 120.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487055occurred in iteration=30, InterpolantAutomatonStates: 2020, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 55.8s InterpolantComputationTime, 1522 NumberOfCodeBlocks, 1522 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 2139 ConstructedInterpolants, 0 QuantifiedInterpolants, 53493 SizeOfPredicates, 1096 NumberOfNonLiveVariables, 3996 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 79 InterpolantComputations, 7 PerfectInterpolantSequences, 250/1358 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