/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:05:36,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:05:36,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:05:36,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:05:36,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:05:36,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:05:36,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:05:36,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:05:36,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:05:36,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:05:36,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:05:36,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:05:36,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:05:36,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:05:36,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:05:36,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:05:36,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:05:36,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:05:36,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:05:36,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:05:36,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:05:36,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:05:36,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:05:36,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:05:36,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:05:36,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:05:36,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:05:36,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:05:36,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:05:36,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:05:36,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:05:36,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:05:36,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:05:36,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:05:36,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:05:36,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:05:36,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:05:36,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:05:36,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:05:36,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:05:36,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:05:36,507 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 04:05:36,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:05:36,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:05:36,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:05:36,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:05:36,533 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:05:36,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:05:36,534 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:05:36,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:05:36,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:05:36,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:05:36,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:05:36,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:05:36,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:05:36,535 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:05:36,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:05:36,535 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:05:36,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:05:36,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:05:36,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:05:36,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:05:36,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:05:36,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:05:36,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:05:36,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:05:36,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:05:36,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:05:36,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:05:36,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:05:36,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 04:05:36,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:05:36,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:05:36,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:05:36,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:05:36,825 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:05:36,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-12-13 04:05:37,772 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:05:37,953 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:05:37,953 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-12-13 04:05:37,959 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58393320e/6f3c2cd1470740ebbdc0fbcbf4be2c9d/FLAG49f6c70a1 [2022-12-13 04:05:37,969 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58393320e/6f3c2cd1470740ebbdc0fbcbf4be2c9d [2022-12-13 04:05:37,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:05:37,972 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:05:37,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:05:37,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:05:37,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:05:37,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:05:37" (1/1) ... [2022-12-13 04:05:37,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49755530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:37, skipping insertion in model container [2022-12-13 04:05:37,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:05:37" (1/1) ... [2022-12-13 04:05:37,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:05:38,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:05:38,184 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/chl-word-subst.wvr.c[3345,3358] [2022-12-13 04:05:38,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:05:38,213 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:05:38,245 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/chl-word-subst.wvr.c[3345,3358] [2022-12-13 04:05:38,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:05:38,264 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:05:38,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38 WrapperNode [2022-12-13 04:05:38,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:05:38,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:05:38,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:05:38,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:05:38,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,318 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 176 [2022-12-13 04:05:38,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:05:38,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:05:38,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:05:38,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:05:38,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,357 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:05:38,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:05:38,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:05:38,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:05:38,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (1/1) ... [2022-12-13 04:05:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:05:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:05:38,388 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 04:05:38,396 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 04:05:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:05:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:05:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:05:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:05:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:05:38,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:05:38,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:05:38,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:05:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 04:05:38,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 04:05:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:05:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 04:05:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:05:38,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:05:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:05:38,421 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 04:05:38,527 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:05:38,528 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:05:38,856 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:05:38,864 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:05:38,864 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 04:05:38,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:05:38 BoogieIcfgContainer [2022-12-13 04:05:38,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:05:38,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:05:38,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:05:38,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:05:38,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:05:37" (1/3) ... [2022-12-13 04:05:38,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63872127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:05:38, skipping insertion in model container [2022-12-13 04:05:38,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:05:38" (2/3) ... [2022-12-13 04:05:38,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63872127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:05:38, skipping insertion in model container [2022-12-13 04:05:38,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:05:38" (3/3) ... [2022-12-13 04:05:38,872 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2022-12-13 04:05:38,884 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:05:38,885 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:05:38,885 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:05:38,942 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 04:05:38,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 288 transitions, 600 flow [2022-12-13 04:05:39,112 INFO L130 PetriNetUnfolder]: 29/285 cut-off events. [2022-12-13 04:05:39,112 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:05:39,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 285 events. 29/285 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-13 04:05:39,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 269 places, 288 transitions, 600 flow [2022-12-13 04:05:39,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 256 places, 275 transitions, 568 flow [2022-12-13 04:05:39,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:39,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 275 transitions, 568 flow [2022-12-13 04:05:39,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 275 transitions, 568 flow [2022-12-13 04:05:39,234 INFO L130 PetriNetUnfolder]: 29/275 cut-off events. [2022-12-13 04:05:39,234 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:05:39,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 275 events. 29/275 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 371 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-13 04:05:39,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 275 transitions, 568 flow [2022-12-13 04:05:39,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 7560 [2022-12-13 04:05:47,797 INFO L241 LiptonReduction]: Total number of compositions: 235 [2022-12-13 04:05:47,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:05:47,821 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;@3bda30ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:05:47,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 04:05:47,829 INFO L130 PetriNetUnfolder]: 11/38 cut-off events. [2022-12-13 04:05:47,829 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:05:47,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:47,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:47,830 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 04:05:47,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1687508420, now seen corresponding path program 1 times [2022-12-13 04:05:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:47,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302454547] [2022-12-13 04:05:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:47,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:48,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302454547] [2022-12-13 04:05:48,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302454547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:48,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:48,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 04:05:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751189234] [2022-12-13 04:05:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:48,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:05:48,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:05:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:05:48,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-13 04:05:48,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:48,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:48,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-13 04:05:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:48,492 INFO L130 PetriNetUnfolder]: 1087/1478 cut-off events. [2022-12-13 04:05:48,492 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-13 04:05:48,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 1478 events. 1087/1478 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4933 event pairs, 481 based on Foata normal form. 1/940 useless extension candidates. Maximal degree in co-relation 2496. Up to 1127 conditions per place. [2022-12-13 04:05:48,501 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 34 selfloop transitions, 0 changer transitions 25/60 dead transitions. [2022-12-13 04:05:48,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 271 flow [2022-12-13 04:05:48,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:05:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:05:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 04:05:48,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-13 04:05:48,514 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-13 04:05:48,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 60 transitions, 271 flow [2022-12-13 04:05:48,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 35 transitions, 156 flow [2022-12-13 04:05:48,522 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:48,523 INFO L89 Accepts]: Start accepts. Operand has 37 places, 35 transitions, 156 flow [2022-12-13 04:05:48,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:48,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:48,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 35 transitions, 156 flow [2022-12-13 04:05:48,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 35 transitions, 156 flow [2022-12-13 04:05:48,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-13 04:05:48,536 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:48,539 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 04:05:48,539 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 156 flow [2022-12-13 04:05:48,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:48,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:48,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:48,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:05:48,542 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 04:05:48,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:48,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1714978131, now seen corresponding path program 1 times [2022-12-13 04:05:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:48,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859176317] [2022-12-13 04:05:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:49,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859176317] [2022-12-13 04:05:49,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859176317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:49,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:49,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086142635] [2022-12-13 04:05:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:49,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:05:49,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:49,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:05:49,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:05:49,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:49,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:49,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:49,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:49,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:49,476 INFO L130 PetriNetUnfolder]: 644/911 cut-off events. [2022-12-13 04:05:49,476 INFO L131 PetriNetUnfolder]: For 80/96 co-relation queries the response was YES. [2022-12-13 04:05:49,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2808 conditions, 911 events. 644/911 cut-off events. For 80/96 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3234 event pairs, 38 based on Foata normal form. 1/619 useless extension candidates. Maximal degree in co-relation 2605. Up to 904 conditions per place. [2022-12-13 04:05:49,481 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 63 selfloop transitions, 2 changer transitions 10/76 dead transitions. [2022-12-13 04:05:49,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 497 flow [2022-12-13 04:05:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:05:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:05:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-13 04:05:49,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2022-12-13 04:05:49,484 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 04:05:49,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 76 transitions, 497 flow [2022-12-13 04:05:49,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 66 transitions, 428 flow [2022-12-13 04:05:49,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:49,492 INFO L89 Accepts]: Start accepts. Operand has 40 places, 66 transitions, 428 flow [2022-12-13 04:05:49,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:49,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:49,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 66 transitions, 428 flow [2022-12-13 04:05:49,495 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 66 transitions, 428 flow [2022-12-13 04:05:49,495 INFO L226 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-13 04:05:49,500 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:49,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 04:05:49,502 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 66 transitions, 428 flow [2022-12-13 04:05:49,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:49,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:49,502 INFO 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 04:05:49,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:05:49,502 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 04:05:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1253104725, now seen corresponding path program 2 times [2022-12-13 04:05:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:49,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390628873] [2022-12-13 04:05:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:49,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:50,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:50,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390628873] [2022-12-13 04:05:50,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390628873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:50,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:50,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:50,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217450576] [2022-12-13 04:05:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:50,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:05:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:50,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:05:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:05:50,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:50,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 66 transitions, 428 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:50,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:50,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:50,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:50,395 INFO L130 PetriNetUnfolder]: 706/1028 cut-off events. [2022-12-13 04:05:50,396 INFO L131 PetriNetUnfolder]: For 120/168 co-relation queries the response was YES. [2022-12-13 04:05:50,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4213 conditions, 1028 events. 706/1028 cut-off events. For 120/168 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3834 event pairs, 21 based on Foata normal form. 2/711 useless extension candidates. Maximal degree in co-relation 3872. Up to 1026 conditions per place. [2022-12-13 04:05:50,401 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 118 selfloop transitions, 14 changer transitions 12/145 dead transitions. [2022-12-13 04:05:50,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 145 transitions, 1232 flow [2022-12-13 04:05:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:05:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:05:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-13 04:05:50,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 04:05:50,403 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-13 04:05:50,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 145 transitions, 1232 flow [2022-12-13 04:05:50,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 133 transitions, 1127 flow [2022-12-13 04:05:50,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:50,412 INFO L89 Accepts]: Start accepts. Operand has 44 places, 133 transitions, 1127 flow [2022-12-13 04:05:50,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:50,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:50,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 133 transitions, 1127 flow [2022-12-13 04:05:50,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 133 transitions, 1127 flow [2022-12-13 04:05:50,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 04:05:50,416 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:50,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 04:05:50,417 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 133 transitions, 1127 flow [2022-12-13 04:05:50,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:50,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:50,418 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:50,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 04:05:50,418 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 04:05:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1388856647, now seen corresponding path program 3 times [2022-12-13 04:05:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:50,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173157942] [2022-12-13 04:05:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:50,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:50,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:50,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173157942] [2022-12-13 04:05:50,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173157942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:50,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:50,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:50,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573477861] [2022-12-13 04:05:50,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:50,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:05:50,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:05:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:05:50,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:50,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 133 transitions, 1127 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:50,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:50,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:50,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:51,144 INFO L130 PetriNetUnfolder]: 774/1138 cut-off events. [2022-12-13 04:05:51,144 INFO L131 PetriNetUnfolder]: For 163/259 co-relation queries the response was YES. [2022-12-13 04:05:51,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5796 conditions, 1138 events. 774/1138 cut-off events. For 163/259 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4392 event pairs, 19 based on Foata normal form. 10/797 useless extension candidates. Maximal degree in co-relation 5355. Up to 1136 conditions per place. [2022-12-13 04:05:51,158 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 142 selfloop transitions, 6 changer transitions 10/159 dead transitions. [2022-12-13 04:05:51,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 159 transitions, 1669 flow [2022-12-13 04:05:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:05:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:05:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-13 04:05:51,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2022-12-13 04:05:51,162 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-13 04:05:51,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 159 transitions, 1669 flow [2022-12-13 04:05:51,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 149 transitions, 1560 flow [2022-12-13 04:05:51,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:51,181 INFO L89 Accepts]: Start accepts. Operand has 47 places, 149 transitions, 1560 flow [2022-12-13 04:05:51,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:51,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:51,183 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 149 transitions, 1560 flow [2022-12-13 04:05:51,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 149 transitions, 1560 flow [2022-12-13 04:05:51,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 04:05:51,189 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:51,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 04:05:51,192 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 149 transitions, 1560 flow [2022-12-13 04:05:51,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:51,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:51,193 INFO 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 04:05:51,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 04:05:51,193 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 04:05:51,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1244879295, now seen corresponding path program 4 times [2022-12-13 04:05:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:51,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796392154] [2022-12-13 04:05:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:51,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:51,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796392154] [2022-12-13 04:05:51,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796392154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:51,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:51,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483611694] [2022-12-13 04:05:51,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:51,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:05:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:05:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:05:51,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:51,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 149 transitions, 1560 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:51,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:51,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:51,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:51,963 INFO L130 PetriNetUnfolder]: 763/1115 cut-off events. [2022-12-13 04:05:51,963 INFO L131 PetriNetUnfolder]: For 190/294 co-relation queries the response was YES. [2022-12-13 04:05:51,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6791 conditions, 1115 events. 763/1115 cut-off events. For 190/294 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4268 event pairs, 19 based on Foata normal form. 2/776 useless extension candidates. Maximal degree in co-relation 6294. Up to 1113 conditions per place. [2022-12-13 04:05:51,971 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 132 selfloop transitions, 5 changer transitions 10/148 dead transitions. [2022-12-13 04:05:51,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 148 transitions, 1844 flow [2022-12-13 04:05:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:05:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:05:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-13 04:05:51,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2022-12-13 04:05:51,972 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-13 04:05:51,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 148 transitions, 1844 flow [2022-12-13 04:05:51,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 138 transitions, 1715 flow [2022-12-13 04:05:51,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:51,986 INFO L89 Accepts]: Start accepts. Operand has 49 places, 138 transitions, 1715 flow [2022-12-13 04:05:51,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:51,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:51,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 138 transitions, 1715 flow [2022-12-13 04:05:51,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 138 transitions, 1715 flow [2022-12-13 04:05:51,989 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 04:05:51,990 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:51,991 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 04:05:51,991 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 138 transitions, 1715 flow [2022-12-13 04:05:51,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:51,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:51,991 INFO 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 04:05:51,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 04:05:51,991 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 04:05:51,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1060492089, now seen corresponding path program 5 times [2022-12-13 04:05:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:51,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19446354] [2022-12-13 04:05:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:52,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:52,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19446354] [2022-12-13 04:05:52,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19446354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:52,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:52,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407087571] [2022-12-13 04:05:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:52,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:05:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:52,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:05:52,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:05:52,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:52,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 138 transitions, 1715 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:52,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:52,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:52,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:52,747 INFO L130 PetriNetUnfolder]: 847/1270 cut-off events. [2022-12-13 04:05:52,747 INFO L131 PetriNetUnfolder]: For 424/644 co-relation queries the response was YES. [2022-12-13 04:05:52,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8981 conditions, 1270 events. 847/1270 cut-off events. For 424/644 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5181 event pairs, 23 based on Foata normal form. 13/912 useless extension candidates. Maximal degree in co-relation 8360. Up to 1265 conditions per place. [2022-12-13 04:05:52,756 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 167 selfloop transitions, 5 changer transitions 12/185 dead transitions. [2022-12-13 04:05:52,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 185 transitions, 2674 flow [2022-12-13 04:05:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:05:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:05:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-13 04:05:52,757 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44571428571428573 [2022-12-13 04:05:52,758 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-13 04:05:52,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 185 transitions, 2674 flow [2022-12-13 04:05:52,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 173 transitions, 2497 flow [2022-12-13 04:05:52,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:52,773 INFO L89 Accepts]: Start accepts. Operand has 52 places, 173 transitions, 2497 flow [2022-12-13 04:05:52,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:52,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:52,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 173 transitions, 2497 flow [2022-12-13 04:05:52,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 173 transitions, 2497 flow [2022-12-13 04:05:52,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-13 04:05:52,779 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:52,779 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 04:05:52,779 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 173 transitions, 2497 flow [2022-12-13 04:05:52,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:52,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:52,780 INFO 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 04:05:52,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 04:05:52,780 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 04:05:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:52,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1186258659, now seen corresponding path program 6 times [2022-12-13 04:05:52,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:52,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433433539] [2022-12-13 04:05:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:53,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433433539] [2022-12-13 04:05:53,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433433539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:53,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:53,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655007644] [2022-12-13 04:05:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:53,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:05:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:05:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:05:53,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:53,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 173 transitions, 2497 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:53,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:53,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:53,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:53,470 INFO L130 PetriNetUnfolder]: 841/1250 cut-off events. [2022-12-13 04:05:53,470 INFO L131 PetriNetUnfolder]: For 591/891 co-relation queries the response was YES. [2022-12-13 04:05:53,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10083 conditions, 1250 events. 841/1250 cut-off events. For 591/891 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5009 event pairs, 23 based on Foata normal form. 29/912 useless extension candidates. Maximal degree in co-relation 9412. Up to 1245 conditions per place. [2022-12-13 04:05:53,478 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 147 selfloop transitions, 14 changer transitions 10/172 dead transitions. [2022-12-13 04:05:53,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 172 transitions, 2825 flow [2022-12-13 04:05:53,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:05:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:05:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-13 04:05:53,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2022-12-13 04:05:53,479 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-13 04:05:53,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 172 transitions, 2825 flow [2022-12-13 04:05:53,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 162 transitions, 2656 flow [2022-12-13 04:05:53,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:53,494 INFO L89 Accepts]: Start accepts. Operand has 55 places, 162 transitions, 2656 flow [2022-12-13 04:05:53,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:53,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:53,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 162 transitions, 2656 flow [2022-12-13 04:05:53,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 162 transitions, 2656 flow [2022-12-13 04:05:53,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-13 04:05:53,501 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:53,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 04:05:53,502 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 162 transitions, 2656 flow [2022-12-13 04:05:53,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:53,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:53,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:53,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 04:05:53,502 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 04:05:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash -421217724, now seen corresponding path program 1 times [2022-12-13 04:05:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:53,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119249234] [2022-12-13 04:05:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:53,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:53,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119249234] [2022-12-13 04:05:53,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119249234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:53,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:53,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:53,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659499699] [2022-12-13 04:05:53,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:53,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:53,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:53,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:53,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:53,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 162 transitions, 2656 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:53,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:53,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:53,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:53,785 INFO L130 PetriNetUnfolder]: 1022/1534 cut-off events. [2022-12-13 04:05:53,785 INFO L131 PetriNetUnfolder]: For 1183/1397 co-relation queries the response was YES. [2022-12-13 04:05:53,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13756 conditions, 1534 events. 1022/1534 cut-off events. For 1183/1397 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6476 event pairs, 0 based on Foata normal form. 8/1117 useless extension candidates. Maximal degree in co-relation 12959. Up to 1509 conditions per place. [2022-12-13 04:05:53,796 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 245 selfloop transitions, 17 changer transitions 0/263 dead transitions. [2022-12-13 04:05:53,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 263 transitions, 4847 flow [2022-12-13 04:05:53,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:05:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:05:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-13 04:05:53,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-13 04:05:53,799 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-13 04:05:53,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 263 transitions, 4847 flow [2022-12-13 04:05:53,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 263 transitions, 4847 flow [2022-12-13 04:05:53,822 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:53,822 INFO L89 Accepts]: Start accepts. Operand has 58 places, 263 transitions, 4847 flow [2022-12-13 04:05:53,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:53,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:53,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 263 transitions, 4847 flow [2022-12-13 04:05:53,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 263 transitions, 4847 flow [2022-12-13 04:05:53,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 04:05:53,834 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:53,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 04:05:53,836 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 263 transitions, 4847 flow [2022-12-13 04:05:53,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:53,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:53,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:53,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 04:05:53,837 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 04:05:53,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash 572077640, now seen corresponding path program 2 times [2022-12-13 04:05:53,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:53,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956266020] [2022-12-13 04:05:53,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:53,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:53,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956266020] [2022-12-13 04:05:53,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956266020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:53,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:53,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853001534] [2022-12-13 04:05:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:53,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:53,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:53,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:53,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:53,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 263 transitions, 4847 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:53,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:53,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:53,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:54,141 INFO L130 PetriNetUnfolder]: 988/1508 cut-off events. [2022-12-13 04:05:54,142 INFO L131 PetriNetUnfolder]: For 1787/2065 co-relation queries the response was YES. [2022-12-13 04:05:54,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14933 conditions, 1508 events. 988/1508 cut-off events. For 1787/2065 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6474 event pairs, 0 based on Foata normal form. 34/1151 useless extension candidates. Maximal degree in co-relation 14071. Up to 1475 conditions per place. [2022-12-13 04:05:54,153 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 261 selfloop transitions, 18 changer transitions 0/280 dead transitions. [2022-12-13 04:05:54,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 280 transitions, 5720 flow [2022-12-13 04:05:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:05:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:05:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 04:05:54,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2022-12-13 04:05:54,154 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2022-12-13 04:05:54,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 280 transitions, 5720 flow [2022-12-13 04:05:54,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 280 transitions, 5720 flow [2022-12-13 04:05:54,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:54,178 INFO L89 Accepts]: Start accepts. Operand has 61 places, 280 transitions, 5720 flow [2022-12-13 04:05:54,180 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:54,180 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:54,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 280 transitions, 5720 flow [2022-12-13 04:05:54,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 280 transitions, 5720 flow [2022-12-13 04:05:54,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:05:54,190 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:54,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 04:05:54,191 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 280 transitions, 5720 flow [2022-12-13 04:05:54,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:54,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:54,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:54,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 04:05:54,192 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 04:05:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1178585992, now seen corresponding path program 1 times [2022-12-13 04:05:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:54,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860137326] [2022-12-13 04:05:54,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:54,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860137326] [2022-12-13 04:05:54,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860137326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:54,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:54,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874893609] [2022-12-13 04:05:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:54,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:54,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:54,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:54,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 280 transitions, 5720 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:54,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:54,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:54,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:54,544 INFO L130 PetriNetUnfolder]: 978/1498 cut-off events. [2022-12-13 04:05:54,545 INFO L131 PetriNetUnfolder]: For 2101/2323 co-relation queries the response was YES. [2022-12-13 04:05:54,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16298 conditions, 1498 events. 978/1498 cut-off events. For 2101/2323 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6496 event pairs, 2 based on Foata normal form. 26/1133 useless extension candidates. Maximal degree in co-relation 15375. Up to 1465 conditions per place. [2022-12-13 04:05:54,573 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 257 selfloop transitions, 16 changer transitions 11/285 dead transitions. [2022-12-13 04:05:54,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 285 transitions, 6388 flow [2022-12-13 04:05:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:05:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:05:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-13 04:05:54,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2022-12-13 04:05:54,575 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2022-12-13 04:05:54,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 285 transitions, 6388 flow [2022-12-13 04:05:54,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 274 transitions, 6137 flow [2022-12-13 04:05:54,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:54,602 INFO L89 Accepts]: Start accepts. Operand has 65 places, 274 transitions, 6137 flow [2022-12-13 04:05:54,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:54,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:54,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 274 transitions, 6137 flow [2022-12-13 04:05:54,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 274 transitions, 6137 flow [2022-12-13 04:05:54,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:05:54,615 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:54,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 04:05:54,616 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 274 transitions, 6137 flow [2022-12-13 04:05:54,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:54,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:54,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:54,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 04:05:54,616 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 04:05:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash -254114890, now seen corresponding path program 3 times [2022-12-13 04:05:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:54,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795567465] [2022-12-13 04:05:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:54,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:54,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795567465] [2022-12-13 04:05:54,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795567465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:54,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:54,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504708515] [2022-12-13 04:05:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:54,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:54,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:54,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:54,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:54,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 274 transitions, 6137 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:54,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:54,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:54,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:54,931 INFO L130 PetriNetUnfolder]: 895/1355 cut-off events. [2022-12-13 04:05:54,932 INFO L131 PetriNetUnfolder]: For 2088/2382 co-relation queries the response was YES. [2022-12-13 04:05:54,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16121 conditions, 1355 events. 895/1355 cut-off events. For 2088/2382 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5611 event pairs, 2 based on Foata normal form. 28/1034 useless extension candidates. Maximal degree in co-relation 15192. Up to 1330 conditions per place. [2022-12-13 04:05:54,942 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 235 selfloop transitions, 15 changer transitions 7/258 dead transitions. [2022-12-13 04:05:54,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 258 transitions, 6290 flow [2022-12-13 04:05:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:05:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:05:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-13 04:05:54,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2022-12-13 04:05:54,944 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2022-12-13 04:05:54,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 258 transitions, 6290 flow [2022-12-13 04:05:54,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 251 transitions, 6119 flow [2022-12-13 04:05:54,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:54,964 INFO L89 Accepts]: Start accepts. Operand has 68 places, 251 transitions, 6119 flow [2022-12-13 04:05:54,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:54,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:54,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 251 transitions, 6119 flow [2022-12-13 04:05:54,971 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 251 transitions, 6119 flow [2022-12-13 04:05:54,971 INFO L226 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-13 04:05:54,976 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:54,976 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 04:05:54,977 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 251 transitions, 6119 flow [2022-12-13 04:05:54,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:54,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:54,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:54,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 04:05:54,977 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 04:05:54,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1656803726, now seen corresponding path program 2 times [2022-12-13 04:05:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:54,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402437102] [2022-12-13 04:05:54,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:55,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:55,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402437102] [2022-12-13 04:05:55,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402437102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:55,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:55,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104578010] [2022-12-13 04:05:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:55,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:55,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:55,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:55,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:55,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:55,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 251 transitions, 6119 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:55,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:55,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:55,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:55,301 INFO L130 PetriNetUnfolder]: 948/1438 cut-off events. [2022-12-13 04:05:55,301 INFO L131 PetriNetUnfolder]: For 2488/2782 co-relation queries the response was YES. [2022-12-13 04:05:55,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18536 conditions, 1438 events. 948/1438 cut-off events. For 2488/2782 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6031 event pairs, 0 based on Foata normal form. 4/1077 useless extension candidates. Maximal degree in co-relation 17399. Up to 1413 conditions per place. [2022-12-13 04:05:55,311 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 262 selfloop transitions, 16 changer transitions 0/279 dead transitions. [2022-12-13 04:05:55,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 279 transitions, 7362 flow [2022-12-13 04:05:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:05:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:05:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 04:05:55,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2022-12-13 04:05:55,313 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2022-12-13 04:05:55,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 279 transitions, 7362 flow [2022-12-13 04:05:55,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 279 transitions, 7362 flow [2022-12-13 04:05:55,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:55,335 INFO L89 Accepts]: Start accepts. Operand has 71 places, 279 transitions, 7362 flow [2022-12-13 04:05:55,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:55,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:55,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 279 transitions, 7362 flow [2022-12-13 04:05:55,343 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 279 transitions, 7362 flow [2022-12-13 04:05:55,343 INFO L226 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-13 04:05:55,347 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:55,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 04:05:55,348 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 279 transitions, 7362 flow [2022-12-13 04:05:55,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:55,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:55,349 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:55,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 04:05:55,349 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 04:05:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1502119418, now seen corresponding path program 4 times [2022-12-13 04:05:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:55,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046113928] [2022-12-13 04:05:55,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:55,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:55,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:55,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046113928] [2022-12-13 04:05:55,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046113928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:55,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:55,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:55,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959675038] [2022-12-13 04:05:55,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:55,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:55,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:55,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:55,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:55,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 279 transitions, 7362 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:55,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:55,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:55,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:55,680 INFO L130 PetriNetUnfolder]: 956/1460 cut-off events. [2022-12-13 04:05:55,680 INFO L131 PetriNetUnfolder]: For 3134/3580 co-relation queries the response was YES. [2022-12-13 04:05:55,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20231 conditions, 1460 events. 956/1460 cut-off events. For 3134/3580 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6248 event pairs, 0 based on Foata normal form. 28/1117 useless extension candidates. Maximal degree in co-relation 19009. Up to 1433 conditions per place. [2022-12-13 04:05:55,690 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 264 selfloop transitions, 10 changer transitions 13/288 dead transitions. [2022-12-13 04:05:55,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 288 transitions, 8170 flow [2022-12-13 04:05:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:05:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:05:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 04:05:55,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2022-12-13 04:05:55,692 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-13 04:05:55,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 288 transitions, 8170 flow [2022-12-13 04:05:55,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 275 transitions, 7806 flow [2022-12-13 04:05:55,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:55,713 INFO L89 Accepts]: Start accepts. Operand has 74 places, 275 transitions, 7806 flow [2022-12-13 04:05:55,717 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:55,717 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:55,717 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 275 transitions, 7806 flow [2022-12-13 04:05:55,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 275 transitions, 7806 flow [2022-12-13 04:05:55,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 04:05:55,728 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:55,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 04:05:55,729 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 275 transitions, 7806 flow [2022-12-13 04:05:55,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:55,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:55,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:55,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 04:05:55,729 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 04:05:55,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash 62495068, now seen corresponding path program 3 times [2022-12-13 04:05:55,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:55,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548111837] [2022-12-13 04:05:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:55,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:55,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548111837] [2022-12-13 04:05:55,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548111837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:55,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:55,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:55,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958025952] [2022-12-13 04:05:55,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:55,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:55,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:55,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:55,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:55,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:55,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 275 transitions, 7806 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:55,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:55,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:55,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:56,067 INFO L130 PetriNetUnfolder]: 840/1266 cut-off events. [2022-12-13 04:05:56,068 INFO L131 PetriNetUnfolder]: For 2735/3069 co-relation queries the response was YES. [2022-12-13 04:05:56,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18855 conditions, 1266 events. 840/1266 cut-off events. For 2735/3069 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5107 event pairs, 0 based on Foata normal form. 22/973 useless extension candidates. Maximal degree in co-relation 17793. Up to 1247 conditions per place. [2022-12-13 04:05:56,077 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 221 selfloop transitions, 6 changer transitions 18/246 dead transitions. [2022-12-13 04:05:56,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 246 transitions, 7466 flow [2022-12-13 04:05:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:05:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:05:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-13 04:05:56,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-13 04:05:56,079 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 40 predicate places. [2022-12-13 04:05:56,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 246 transitions, 7466 flow [2022-12-13 04:05:56,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 228 transitions, 6914 flow [2022-12-13 04:05:56,097 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:56,097 INFO L89 Accepts]: Start accepts. Operand has 78 places, 228 transitions, 6914 flow [2022-12-13 04:05:56,099 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:56,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:56,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 228 transitions, 6914 flow [2022-12-13 04:05:56,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 228 transitions, 6914 flow [2022-12-13 04:05:56,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 04:05:56,107 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:56,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 04:05:56,108 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 228 transitions, 6914 flow [2022-12-13 04:05:56,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:56,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:56,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:56,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 04:05:56,110 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 04:05:56,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1631450724, now seen corresponding path program 4 times [2022-12-13 04:05:56,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:56,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900943468] [2022-12-13 04:05:56,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:56,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900943468] [2022-12-13 04:05:56,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900943468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:56,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:56,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443965792] [2022-12-13 04:05:56,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:56,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:56,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:56,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:56,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:56,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:56,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 228 transitions, 6914 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:56,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:56,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:56,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:56,380 INFO L130 PetriNetUnfolder]: 792/1172 cut-off events. [2022-12-13 04:05:56,380 INFO L131 PetriNetUnfolder]: For 3208/3610 co-relation queries the response was YES. [2022-12-13 04:05:56,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18584 conditions, 1172 events. 792/1172 cut-off events. For 3208/3610 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4471 event pairs, 0 based on Foata normal form. 8/885 useless extension candidates. Maximal degree in co-relation 17649. Up to 1153 conditions per place. [2022-12-13 04:05:56,390 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 204 selfloop transitions, 2 changer transitions 8/215 dead transitions. [2022-12-13 04:05:56,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 215 transitions, 6943 flow [2022-12-13 04:05:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:05:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:05:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 04:05:56,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-13 04:05:56,391 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2022-12-13 04:05:56,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 215 transitions, 6943 flow [2022-12-13 04:05:56,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 207 transitions, 6684 flow [2022-12-13 04:05:56,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:56,409 INFO L89 Accepts]: Start accepts. Operand has 78 places, 207 transitions, 6684 flow [2022-12-13 04:05:56,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:56,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:56,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 207 transitions, 6684 flow [2022-12-13 04:05:56,417 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 207 transitions, 6684 flow [2022-12-13 04:05:56,417 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 04:05:56,419 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:56,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 04:05:56,421 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 207 transitions, 6684 flow [2022-12-13 04:05:56,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:56,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:56,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:56,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 04:05:56,421 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 04:05:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2007308404, now seen corresponding path program 5 times [2022-12-13 04:05:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:56,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018868587] [2022-12-13 04:05:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:56,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018868587] [2022-12-13 04:05:56,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018868587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:56,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:56,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:56,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818129041] [2022-12-13 04:05:56,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:56,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:56,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:56,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 04:05:56,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 207 transitions, 6684 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:56,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:56,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 04:05:56,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:56,677 INFO L130 PetriNetUnfolder]: 743/1093 cut-off events. [2022-12-13 04:05:56,678 INFO L131 PetriNetUnfolder]: For 3736/4206 co-relation queries the response was YES. [2022-12-13 04:05:56,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18387 conditions, 1093 events. 743/1093 cut-off events. For 3736/4206 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4087 event pairs, 0 based on Foata normal form. 4/838 useless extension candidates. Maximal degree in co-relation 17568. Up to 1074 conditions per place. [2022-12-13 04:05:56,687 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 195 selfloop transitions, 11 changer transitions 0/207 dead transitions. [2022-12-13 04:05:56,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 207 transitions, 7093 flow [2022-12-13 04:05:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:05:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:05:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 04:05:56,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2022-12-13 04:05:56,689 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-13 04:05:56,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 207 transitions, 7093 flow [2022-12-13 04:05:56,698 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 207 transitions, 7093 flow [2022-12-13 04:05:56,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:56,707 INFO L89 Accepts]: Start accepts. Operand has 74 places, 207 transitions, 7093 flow [2022-12-13 04:05:56,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:56,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:56,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 207 transitions, 7093 flow [2022-12-13 04:05:56,713 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 207 transitions, 7093 flow [2022-12-13 04:05:56,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 04:05:56,716 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:56,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 04:05:56,717 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 207 transitions, 7093 flow [2022-12-13 04:05:56,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:56,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:56,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:56,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 04:05:56,717 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 04:05:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:56,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2041875942, now seen corresponding path program 5 times [2022-12-13 04:05:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:56,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770582989] [2022-12-13 04:05:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:56,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:56,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770582989] [2022-12-13 04:05:56,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770582989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:56,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:56,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:05:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152667788] [2022-12-13 04:05:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:56,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:05:56,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:56,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:05:56,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:05:56,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-13 04:05:56,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 207 transitions, 7093 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:56,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:56,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-13 04:05:56,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:56,959 INFO L130 PetriNetUnfolder]: 683/997 cut-off events. [2022-12-13 04:05:56,959 INFO L131 PetriNetUnfolder]: For 4322/4860 co-relation queries the response was YES. [2022-12-13 04:05:56,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17727 conditions, 997 events. 683/997 cut-off events. For 4322/4860 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3643 event pairs, 0 based on Foata normal form. 12/774 useless extension candidates. Maximal degree in co-relation 16935. Up to 978 conditions per place. [2022-12-13 04:05:56,967 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 181 selfloop transitions, 0 changer transitions 9/191 dead transitions. [2022-12-13 04:05:56,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 191 transitions, 6920 flow [2022-12-13 04:05:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:05:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:05:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-13 04:05:56,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3382352941176471 [2022-12-13 04:05:56,969 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2022-12-13 04:05:56,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 191 transitions, 6920 flow [2022-12-13 04:05:56,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 182 transitions, 6596 flow [2022-12-13 04:05:56,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:56,986 INFO L89 Accepts]: Start accepts. Operand has 68 places, 182 transitions, 6596 flow [2022-12-13 04:05:56,988 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:56,988 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:56,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 182 transitions, 6596 flow [2022-12-13 04:05:56,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 182 transitions, 6596 flow [2022-12-13 04:05:56,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 04:05:56,995 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:56,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 04:05:56,996 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 182 transitions, 6596 flow [2022-12-13 04:05:56,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:56,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:56,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:56,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 04:05:56,996 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 04:05:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash 553585205, now seen corresponding path program 1 times [2022-12-13 04:05:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:56,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259627059] [2022-12-13 04:05:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:57,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:57,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259627059] [2022-12-13 04:05:57,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259627059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:57,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:57,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:05:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346717783] [2022-12-13 04:05:57,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:57,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:05:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:05:57,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:05:57,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-13 04:05:57,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 182 transitions, 6596 flow. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:05:57,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:57,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-13 04:05:57,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:58,156 INFO L130 PetriNetUnfolder]: 1287/1890 cut-off events. [2022-12-13 04:05:58,156 INFO L131 PetriNetUnfolder]: For 8290/9048 co-relation queries the response was YES. [2022-12-13 04:05:58,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35484 conditions, 1890 events. 1287/1890 cut-off events. For 8290/9048 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8063 event pairs, 0 based on Foata normal form. 15/1507 useless extension candidates. Maximal degree in co-relation 17507. Up to 1855 conditions per place. [2022-12-13 04:05:58,173 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 280 selfloop transitions, 34 changer transitions 39/354 dead transitions. [2022-12-13 04:05:58,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 354 transitions, 13572 flow [2022-12-13 04:05:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:05:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:05:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-13 04:05:58,174 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2022-12-13 04:05:58,175 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2022-12-13 04:05:58,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 354 transitions, 13572 flow [2022-12-13 04:05:58,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 315 transitions, 12063 flow [2022-12-13 04:05:58,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:58,213 INFO L89 Accepts]: Start accepts. Operand has 75 places, 315 transitions, 12063 flow [2022-12-13 04:05:58,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:58,217 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:58,217 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 315 transitions, 12063 flow [2022-12-13 04:05:58,223 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 315 transitions, 12063 flow [2022-12-13 04:05:58,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 04:06:11,678 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 04:06:11,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13466 [2022-12-13 04:06:11,678 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 312 transitions, 11949 flow [2022-12-13 04:06:11,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:11,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:11,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:11,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 04:06:11,679 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 04:06:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1647858795, now seen corresponding path program 1 times [2022-12-13 04:06:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:11,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931225024] [2022-12-13 04:06:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:11,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:11,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931225024] [2022-12-13 04:06:11,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931225024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:11,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:11,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:06:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449622017] [2022-12-13 04:06:11,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:11,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:06:11,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:11,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:06:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:06:11,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 04:06:11,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 312 transitions, 11949 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:11,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:11,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 04:06:11,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:12,756 INFO L130 PetriNetUnfolder]: 3187/4626 cut-off events. [2022-12-13 04:06:12,756 INFO L131 PetriNetUnfolder]: For 18340/18944 co-relation queries the response was YES. [2022-12-13 04:06:12,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91310 conditions, 4626 events. 3187/4626 cut-off events. For 18340/18944 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22129 event pairs, 0 based on Foata normal form. 6/3615 useless extension candidates. Maximal degree in co-relation 18890. Up to 4537 conditions per place. [2022-12-13 04:06:12,796 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 487 selfloop transitions, 3 changer transitions 473/964 dead transitions. [2022-12-13 04:06:12,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 964 transitions, 38921 flow [2022-12-13 04:06:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:06:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:06:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2022-12-13 04:06:12,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-13 04:06:12,798 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2022-12-13 04:06:12,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 964 transitions, 38921 flow [2022-12-13 04:06:12,837 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 491 transitions, 19809 flow [2022-12-13 04:06:12,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:12,882 INFO L89 Accepts]: Start accepts. Operand has 75 places, 491 transitions, 19809 flow [2022-12-13 04:06:12,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:12,892 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:12,892 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 491 transitions, 19809 flow [2022-12-13 04:06:12,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 491 transitions, 19809 flow [2022-12-13 04:06:12,920 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 04:06:13,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:06:13,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 373 [2022-12-13 04:06:13,254 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 490 transitions, 19769 flow [2022-12-13 04:06:13,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:13,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:13,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:13,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 04:06:13,254 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 04:06:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash 550725996, now seen corresponding path program 1 times [2022-12-13 04:06:13,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:13,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108316608] [2022-12-13 04:06:13,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:13,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:13,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:13,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108316608] [2022-12-13 04:06:13,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108316608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:13,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:13,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:06:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912946648] [2022-12-13 04:06:13,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:13,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:06:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:06:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:06:13,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 04:06:13,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 490 transitions, 19769 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:13,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:13,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 04:06:13,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:14,652 INFO L130 PetriNetUnfolder]: 2515/3666 cut-off events. [2022-12-13 04:06:14,653 INFO L131 PetriNetUnfolder]: For 16946/17634 co-relation queries the response was YES. [2022-12-13 04:06:14,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75964 conditions, 3666 events. 2515/3666 cut-off events. For 16946/17634 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17188 event pairs, 0 based on Foata normal form. 5/2888 useless extension candidates. Maximal degree in co-relation 22361. Up to 3595 conditions per place. [2022-12-13 04:06:14,794 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 625 selfloop transitions, 22 changer transitions 53/701 dead transitions. [2022-12-13 04:06:14,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 701 transitions, 29720 flow [2022-12-13 04:06:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:06:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:06:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-13 04:06:14,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2022-12-13 04:06:14,795 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2022-12-13 04:06:14,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 701 transitions, 29720 flow [2022-12-13 04:06:14,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 648 transitions, 27458 flow [2022-12-13 04:06:14,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:14,973 INFO L89 Accepts]: Start accepts. Operand has 78 places, 648 transitions, 27458 flow [2022-12-13 04:06:14,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:14,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:14,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 648 transitions, 27458 flow [2022-12-13 04:06:15,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 648 transitions, 27458 flow [2022-12-13 04:06:15,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 04:06:15,028 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:15,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 04:06:15,029 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 648 transitions, 27458 flow [2022-12-13 04:06:15,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:15,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:15,029 INFO 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 04:06:15,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 04:06:15,029 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 04:06:15,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:15,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1769497444, now seen corresponding path program 2 times [2022-12-13 04:06:15,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:15,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571173022] [2022-12-13 04:06:15,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:15,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:15,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:15,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571173022] [2022-12-13 04:06:15,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571173022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:15,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:15,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:06:15,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322957673] [2022-12-13 04:06:15,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:15,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:06:15,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:15,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:06:15,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:06:15,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 04:06:15,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 648 transitions, 27458 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:15,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:15,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 04:06:15,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:16,415 INFO L130 PetriNetUnfolder]: 2693/3968 cut-off events. [2022-12-13 04:06:16,415 INFO L131 PetriNetUnfolder]: For 20967/21739 co-relation queries the response was YES. [2022-12-13 04:06:16,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85995 conditions, 3968 events. 2693/3968 cut-off events. For 20967/21739 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19348 event pairs, 0 based on Foata normal form. 5/3142 useless extension candidates. Maximal degree in co-relation 26480. Up to 3887 conditions per place. [2022-12-13 04:06:16,454 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 723 selfloop transitions, 27 changer transitions 13/764 dead transitions. [2022-12-13 04:06:16,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 764 transitions, 33907 flow [2022-12-13 04:06:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:06:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:06:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2022-12-13 04:06:16,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2022-12-13 04:06:16,457 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2022-12-13 04:06:16,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 764 transitions, 33907 flow [2022-12-13 04:06:16,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 751 transitions, 33326 flow [2022-12-13 04:06:16,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:16,550 INFO L89 Accepts]: Start accepts. Operand has 83 places, 751 transitions, 33326 flow [2022-12-13 04:06:16,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:16,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:16,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 751 transitions, 33326 flow [2022-12-13 04:06:16,585 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 751 transitions, 33326 flow [2022-12-13 04:06:16,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 04:06:16,675 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:16,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 04:06:16,678 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 751 transitions, 33326 flow [2022-12-13 04:06:16,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:16,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:16,678 INFO 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 04:06:16,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 04:06:16,678 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 04:06:16,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1896926044, now seen corresponding path program 3 times [2022-12-13 04:06:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:16,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383918118] [2022-12-13 04:06:16,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:17,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:17,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383918118] [2022-12-13 04:06:17,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383918118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:17,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:17,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:06:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967991296] [2022-12-13 04:06:17,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:17,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:06:17,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:06:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:06:17,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 04:06:17,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 751 transitions, 33326 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:17,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:17,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 04:06:17,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:18,208 INFO L130 PetriNetUnfolder]: 2679/3940 cut-off events. [2022-12-13 04:06:18,208 INFO L131 PetriNetUnfolder]: For 23174/24030 co-relation queries the response was YES. [2022-12-13 04:06:18,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89235 conditions, 3940 events. 2679/3940 cut-off events. For 23174/24030 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19160 event pairs, 0 based on Foata normal form. 5/3126 useless extension candidates. Maximal degree in co-relation 27125. Up to 3859 conditions per place. [2022-12-13 04:06:18,246 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 709 selfloop transitions, 23 changer transitions 25/758 dead transitions. [2022-12-13 04:06:18,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 758 transitions, 35151 flow [2022-12-13 04:06:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:06:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:06:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-13 04:06:18,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 04:06:18,248 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2022-12-13 04:06:18,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 758 transitions, 35151 flow [2022-12-13 04:06:18,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 733 transitions, 33986 flow [2022-12-13 04:06:18,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:18,335 INFO L89 Accepts]: Start accepts. Operand has 87 places, 733 transitions, 33986 flow [2022-12-13 04:06:18,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:18,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:18,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 733 transitions, 33986 flow [2022-12-13 04:06:18,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 733 transitions, 33986 flow [2022-12-13 04:06:18,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 04:06:18,388 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:18,388 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 04:06:18,389 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 733 transitions, 33986 flow [2022-12-13 04:06:18,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:18,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:18,389 INFO 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 04:06:18,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 04:06:18,389 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 04:06:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2025964226, now seen corresponding path program 4 times [2022-12-13 04:06:18,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:18,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039013290] [2022-12-13 04:06:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:18,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039013290] [2022-12-13 04:06:18,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039013290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:18,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:18,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:06:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266562417] [2022-12-13 04:06:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:18,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:06:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:18,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:06:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:06:18,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 04:06:18,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 733 transitions, 33986 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:18,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:18,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 04:06:18,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:20,117 INFO L130 PetriNetUnfolder]: 2581/3840 cut-off events. [2022-12-13 04:06:20,117 INFO L131 PetriNetUnfolder]: For 28042/28982 co-relation queries the response was YES. [2022-12-13 04:06:20,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90462 conditions, 3840 events. 2581/3840 cut-off events. For 28042/28982 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 18924 event pairs, 0 based on Foata normal form. 5/3110 useless extension candidates. Maximal degree in co-relation 25860. Up to 3749 conditions per place. [2022-12-13 04:06:20,153 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 696 selfloop transitions, 21 changer transitions 25/743 dead transitions. [2022-12-13 04:06:20,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 743 transitions, 35942 flow [2022-12-13 04:06:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:06:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:06:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-13 04:06:20,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-13 04:06:20,161 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 55 predicate places. [2022-12-13 04:06:20,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 743 transitions, 35942 flow [2022-12-13 04:06:20,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 718 transitions, 34727 flow [2022-12-13 04:06:20,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:20,243 INFO L89 Accepts]: Start accepts. Operand has 91 places, 718 transitions, 34727 flow [2022-12-13 04:06:20,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:20,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:20,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 718 transitions, 34727 flow [2022-12-13 04:06:20,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 718 transitions, 34727 flow [2022-12-13 04:06:20,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 04:06:20,295 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:20,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 04:06:20,295 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 718 transitions, 34727 flow [2022-12-13 04:06:20,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:20,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:20,296 INFO 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 04:06:20,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 04:06:20,296 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 04:06:20,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:20,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1520907052, now seen corresponding path program 5 times [2022-12-13 04:06:20,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:20,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108832678] [2022-12-13 04:06:20,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:20,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:20,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108832678] [2022-12-13 04:06:20,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108832678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:20,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:20,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:06:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867223952] [2022-12-13 04:06:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:20,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:06:20,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:06:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:06:20,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 04:06:20,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 718 transitions, 34727 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:20,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:20,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 04:06:20,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:21,690 INFO L130 PetriNetUnfolder]: 2617/3894 cut-off events. [2022-12-13 04:06:21,690 INFO L131 PetriNetUnfolder]: For 30743/31767 co-relation queries the response was YES. [2022-12-13 04:06:21,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95562 conditions, 3894 events. 2617/3894 cut-off events. For 30743/31767 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19296 event pairs, 0 based on Foata normal form. 5/3150 useless extension candidates. Maximal degree in co-relation 28384. Up to 3803 conditions per place. [2022-12-13 04:06:21,736 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 710 selfloop transitions, 23 changer transitions 13/747 dead transitions. [2022-12-13 04:06:21,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 747 transitions, 37623 flow [2022-12-13 04:06:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:06:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:06:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-13 04:06:21,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 04:06:21,738 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 59 predicate places. [2022-12-13 04:06:21,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 747 transitions, 37623 flow [2022-12-13 04:06:21,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 734 transitions, 36964 flow [2022-12-13 04:06:21,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:21,908 INFO L89 Accepts]: Start accepts. Operand has 96 places, 734 transitions, 36964 flow [2022-12-13 04:06:21,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:21,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:21,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 734 transitions, 36964 flow [2022-12-13 04:06:21,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 734 transitions, 36964 flow [2022-12-13 04:06:21,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 04:06:21,965 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:21,966 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 04:06:21,966 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 734 transitions, 36964 flow [2022-12-13 04:06:21,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:21,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:21,966 INFO 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 04:06:21,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 04:06:21,966 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 04:06:21,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:21,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1898535626, now seen corresponding path program 6 times [2022-12-13 04:06:21,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:21,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961272895] [2022-12-13 04:06:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:21,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:22,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961272895] [2022-12-13 04:06:22,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961272895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:22,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:22,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:06:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322626843] [2022-12-13 04:06:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:22,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:06:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:22,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:06:22,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:06:22,388 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 04:06:22,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 734 transitions, 36964 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:22,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:22,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 04:06:22,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:23,506 INFO L130 PetriNetUnfolder]: 2603/3866 cut-off events. [2022-12-13 04:06:23,506 INFO L131 PetriNetUnfolder]: For 33568/34676 co-relation queries the response was YES. [2022-12-13 04:06:23,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98634 conditions, 3866 events. 2603/3866 cut-off events. For 33568/34676 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19032 event pairs, 0 based on Foata normal form. 5/3134 useless extension candidates. Maximal degree in co-relation 28889. Up to 3775 conditions per place. [2022-12-13 04:06:23,545 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 696 selfloop transitions, 23 changer transitions 13/733 dead transitions. [2022-12-13 04:06:23,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 733 transitions, 38378 flow [2022-12-13 04:06:23,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:06:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:06:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-13 04:06:23,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-13 04:06:23,552 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2022-12-13 04:06:23,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 733 transitions, 38378 flow [2022-12-13 04:06:23,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 720 transitions, 37693 flow [2022-12-13 04:06:23,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:23,640 INFO L89 Accepts]: Start accepts. Operand has 100 places, 720 transitions, 37693 flow [2022-12-13 04:06:23,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:23,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:23,649 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 720 transitions, 37693 flow [2022-12-13 04:06:23,671 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 720 transitions, 37693 flow [2022-12-13 04:06:23,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 04:06:23,689 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:23,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 04:06:23,690 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 720 transitions, 37693 flow [2022-12-13 04:06:23,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:23,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:23,690 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:23,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 04:06:23,690 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 04:06:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash -998947982, now seen corresponding path program 1 times [2022-12-13 04:06:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768375154] [2022-12-13 04:06:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:23,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:23,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768375154] [2022-12-13 04:06:23,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768375154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:23,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:23,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:06:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603524081] [2022-12-13 04:06:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:23,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:06:23,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:06:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:06:23,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 04:06:23,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 720 transitions, 37693 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:23,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:23,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 04:06:23,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:24,852 INFO L130 PetriNetUnfolder]: 2664/3975 cut-off events. [2022-12-13 04:06:24,852 INFO L131 PetriNetUnfolder]: For 36563/37755 co-relation queries the response was YES. [2022-12-13 04:06:24,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105372 conditions, 3975 events. 2664/3975 cut-off events. For 36563/37755 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 19783 event pairs, 0 based on Foata normal form. 5/3231 useless extension candidates. Maximal degree in co-relation 29346. Up to 3884 conditions per place. [2022-12-13 04:06:24,940 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 583 selfloop transitions, 0 changer transitions 239/823 dead transitions. [2022-12-13 04:06:24,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 823 transitions, 44741 flow [2022-12-13 04:06:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:06:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:06:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 04:06:24,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2022-12-13 04:06:24,941 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-13 04:06:24,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 823 transitions, 44741 flow [2022-12-13 04:06:24,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 584 transitions, 31739 flow [2022-12-13 04:06:25,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:25,035 INFO L89 Accepts]: Start accepts. Operand has 101 places, 584 transitions, 31739 flow [2022-12-13 04:06:25,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:25,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:25,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 584 transitions, 31739 flow [2022-12-13 04:06:25,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 584 transitions, 31739 flow [2022-12-13 04:06:25,064 INFO L226 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-13 04:06:25,080 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:25,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 04:06:25,081 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 584 transitions, 31739 flow [2022-12-13 04:06:25,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:25,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:25,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:25,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 04:06:25,081 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 04:06:25,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:25,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1006871647, now seen corresponding path program 1 times [2022-12-13 04:06:25,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:25,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346331541] [2022-12-13 04:06:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:25,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346331541] [2022-12-13 04:06:25,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346331541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:25,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:25,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:06:25,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936937139] [2022-12-13 04:06:25,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:25,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:06:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:25,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:06:25,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:06:25,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 04:06:25,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 584 transitions, 31739 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:25,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:25,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 04:06:25,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:25,649 INFO L130 PetriNetUnfolder]: 1164/1761 cut-off events. [2022-12-13 04:06:25,649 INFO L131 PetriNetUnfolder]: For 33689/33689 co-relation queries the response was YES. [2022-12-13 04:06:25,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48190 conditions, 1761 events. 1164/1761 cut-off events. For 33689/33689 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7432 event pairs, 34 based on Foata normal form. 134/1583 useless extension candidates. Maximal degree in co-relation 29187. Up to 1710 conditions per place. [2022-12-13 04:06:25,667 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 182 selfloop transitions, 0 changer transitions 228/410 dead transitions. [2022-12-13 04:06:25,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 410 transitions, 23097 flow [2022-12-13 04:06:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:06:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:06:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-13 04:06:25,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-13 04:06:25,669 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-13 04:06:25,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 410 transitions, 23097 flow [2022-12-13 04:06:25,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 182 transitions, 10218 flow [2022-12-13 04:06:25,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:25,708 INFO L89 Accepts]: Start accepts. Operand has 80 places, 182 transitions, 10218 flow [2022-12-13 04:06:25,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:25,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:25,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 182 transitions, 10218 flow [2022-12-13 04:06:25,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 182 transitions, 10218 flow [2022-12-13 04:06:25,719 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:25,782 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:06:25,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 04:06:25,782 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 182 transitions, 10218 flow [2022-12-13 04:06:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:25,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:25,782 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:25,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 04:06:25,783 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 04:06:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash -110897545, now seen corresponding path program 1 times [2022-12-13 04:06:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:25,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798071753] [2022-12-13 04:06:25,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:25,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:25,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798071753] [2022-12-13 04:06:25,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798071753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:25,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:25,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:06:25,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308488125] [2022-12-13 04:06:25,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:25,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:06:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:25,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:06:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:06:25,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 04:06:25,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 182 transitions, 10218 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:25,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:25,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 04:06:25,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:26,232 INFO L130 PetriNetUnfolder]: 1160/1645 cut-off events. [2022-12-13 04:06:26,233 INFO L131 PetriNetUnfolder]: For 29887/29887 co-relation queries the response was YES. [2022-12-13 04:06:26,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45851 conditions, 1645 events. 1160/1645 cut-off events. For 29887/29887 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6076 event pairs, 4 based on Foata normal form. 0/1317 useless extension candidates. Maximal degree in co-relation 44292. Up to 1646 conditions per place. [2022-12-13 04:06:26,248 INFO L137 encePairwiseOnDemand]: 31/38 looper letters, 244 selfloop transitions, 22 changer transitions 0/267 dead transitions. [2022-12-13 04:06:26,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 267 transitions, 15528 flow [2022-12-13 04:06:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:06:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:06:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-13 04:06:26,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2850877192982456 [2022-12-13 04:06:26,250 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2022-12-13 04:06:26,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 267 transitions, 15528 flow [2022-12-13 04:06:26,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 267 transitions, 15528 flow [2022-12-13 04:06:26,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:26,280 INFO L89 Accepts]: Start accepts. Operand has 85 places, 267 transitions, 15528 flow [2022-12-13 04:06:26,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:26,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:26,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 267 transitions, 15528 flow [2022-12-13 04:06:26,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 267 transitions, 15528 flow [2022-12-13 04:06:26,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:27,136 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:06:27,137 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 857 [2022-12-13 04:06:27,137 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 266 transitions, 15470 flow [2022-12-13 04:06:27,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:27,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:27,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:27,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 04:06:27,137 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 04:06:27,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1694444385, now seen corresponding path program 1 times [2022-12-13 04:06:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:27,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364069035] [2022-12-13 04:06:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:27,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364069035] [2022-12-13 04:06:27,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364069035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:27,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:27,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:06:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984938369] [2022-12-13 04:06:27,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:27,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:06:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:27,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:06:27,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:06:27,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-13 04:06:27,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 266 transitions, 15470 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:27,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:27,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-13 04:06:27,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:28,592 INFO L130 PetriNetUnfolder]: 2344/3343 cut-off events. [2022-12-13 04:06:28,592 INFO L131 PetriNetUnfolder]: For 64229/64229 co-relation queries the response was YES. [2022-12-13 04:06:28,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96404 conditions, 3343 events. 2344/3343 cut-off events. For 64229/64229 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14485 event pairs, 10 based on Foata normal form. 1/2687 useless extension candidates. Maximal degree in co-relation 47431. Up to 3344 conditions per place. [2022-12-13 04:06:28,633 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 430 selfloop transitions, 72 changer transitions 74/577 dead transitions. [2022-12-13 04:06:28,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 577 transitions, 34777 flow [2022-12-13 04:06:28,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:06:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:06:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 171 transitions. [2022-12-13 04:06:28,634 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-13 04:06:28,635 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2022-12-13 04:06:28,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 577 transitions, 34777 flow [2022-12-13 04:06:28,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 503 transitions, 30295 flow [2022-12-13 04:06:28,720 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:28,720 INFO L89 Accepts]: Start accepts. Operand has 93 places, 503 transitions, 30295 flow [2022-12-13 04:06:28,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:28,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:28,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 503 transitions, 30295 flow [2022-12-13 04:06:28,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 503 transitions, 30295 flow [2022-12-13 04:06:28,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:29,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:06:29,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1103 [2022-12-13 04:06:29,823 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 502 transitions, 30235 flow [2022-12-13 04:06:29,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:29,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:29,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:29,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 04:06:29,824 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 04:06:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2065674983, now seen corresponding path program 1 times [2022-12-13 04:06:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:29,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827153644] [2022-12-13 04:06:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:29,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:30,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:30,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827153644] [2022-12-13 04:06:30,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827153644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:30,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:30,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:06:30,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350347692] [2022-12-13 04:06:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:30,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:06:30,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:30,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:06:30,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:06:30,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 04:06:30,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 502 transitions, 30235 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:30,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:30,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 04:06:30,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:32,172 INFO L130 PetriNetUnfolder]: 4753/6799 cut-off events. [2022-12-13 04:06:32,172 INFO L131 PetriNetUnfolder]: For 137666/137666 co-relation queries the response was YES. [2022-12-13 04:06:32,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202644 conditions, 6799 events. 4753/6799 cut-off events. For 137666/137666 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33503 event pairs, 18 based on Foata normal form. 1/5519 useless extension candidates. Maximal degree in co-relation 59179. Up to 6800 conditions per place. [2022-12-13 04:06:32,389 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 1083 selfloop transitions, 43 changer transitions 20/1147 dead transitions. [2022-12-13 04:06:32,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 1147 transitions, 71458 flow [2022-12-13 04:06:32,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:06:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:06:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2022-12-13 04:06:32,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 04:06:32,390 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 61 predicate places. [2022-12-13 04:06:32,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 1147 transitions, 71458 flow [2022-12-13 04:06:32,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 1127 transitions, 70209 flow [2022-12-13 04:06:32,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:32,525 INFO L89 Accepts]: Start accepts. Operand has 98 places, 1127 transitions, 70209 flow [2022-12-13 04:06:32,547 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:32,547 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:32,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 1127 transitions, 70209 flow [2022-12-13 04:06:32,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 1127 transitions, 70209 flow [2022-12-13 04:06:32,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:32,587 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:32,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 04:06:32,587 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 1127 transitions, 70209 flow [2022-12-13 04:06:32,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:32,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:32,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:32,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 04:06:32,588 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 04:06:32,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:32,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2090764163, now seen corresponding path program 2 times [2022-12-13 04:06:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:32,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974657767] [2022-12-13 04:06:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:32,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974657767] [2022-12-13 04:06:32,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974657767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:32,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:32,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:06:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452485363] [2022-12-13 04:06:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:32,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:06:32,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:32,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:06:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:06:32,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 04:06:32,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 1127 transitions, 70209 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:32,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:32,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 04:06:32,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:35,920 INFO L130 PetriNetUnfolder]: 5056/7289 cut-off events. [2022-12-13 04:06:35,920 INFO L131 PetriNetUnfolder]: For 147245/147245 co-relation queries the response was YES. [2022-12-13 04:06:35,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224860 conditions, 7289 events. 5056/7289 cut-off events. For 147245/147245 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 36998 event pairs, 18 based on Foata normal form. 2/5940 useless extension candidates. Maximal degree in co-relation 61078. Up to 7290 conditions per place. [2022-12-13 04:06:36,002 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 1169 selfloop transitions, 82 changer transitions 34/1286 dead transitions. [2022-12-13 04:06:36,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 1286 transitions, 82703 flow [2022-12-13 04:06:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:06:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:06:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2022-12-13 04:06:36,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43125 [2022-12-13 04:06:36,003 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 67 predicate places. [2022-12-13 04:06:36,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 1286 transitions, 82703 flow [2022-12-13 04:06:36,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 1252 transitions, 80509 flow [2022-12-13 04:06:36,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:36,211 INFO L89 Accepts]: Start accepts. Operand has 103 places, 1252 transitions, 80509 flow [2022-12-13 04:06:36,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:36,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:36,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 1252 transitions, 80509 flow [2022-12-13 04:06:36,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 1252 transitions, 80509 flow [2022-12-13 04:06:36,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:36,263 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:36,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 04:06:36,264 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 1252 transitions, 80509 flow [2022-12-13 04:06:36,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:36,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:36,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:36,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 04:06:36,264 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:06:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1086201363, now seen corresponding path program 3 times [2022-12-13 04:06:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:36,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109217217] [2022-12-13 04:06:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:36,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109217217] [2022-12-13 04:06:36,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109217217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:36,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:36,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:06:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576522596] [2022-12-13 04:06:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:36,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:06:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:06:36,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:06:36,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 04:06:36,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 1252 transitions, 80509 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:36,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:36,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 04:06:36,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:40,120 INFO L130 PetriNetUnfolder]: 5004/7321 cut-off events. [2022-12-13 04:06:40,120 INFO L131 PetriNetUnfolder]: For 157111/157111 co-relation queries the response was YES. [2022-12-13 04:06:40,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232908 conditions, 7321 events. 5004/7321 cut-off events. For 157111/157111 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 38479 event pairs, 16 based on Foata normal form. 2/6132 useless extension candidates. Maximal degree in co-relation 63640. Up to 7322 conditions per place. [2022-12-13 04:06:40,253 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 1160 selfloop transitions, 161 changer transitions 34/1356 dead transitions. [2022-12-13 04:06:40,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 1356 transitions, 89923 flow [2022-12-13 04:06:40,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:06:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 04:06:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2022-12-13 04:06:40,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3795454545454545 [2022-12-13 04:06:40,254 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 75 predicate places. [2022-12-13 04:06:40,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 1356 transitions, 89923 flow [2022-12-13 04:06:40,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 1322 transitions, 87661 flow [2022-12-13 04:06:40,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:40,417 INFO L89 Accepts]: Start accepts. Operand has 112 places, 1322 transitions, 87661 flow [2022-12-13 04:06:40,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:40,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:40,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 1322 transitions, 87661 flow [2022-12-13 04:06:40,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 1322 transitions, 87661 flow [2022-12-13 04:06:40,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:40,477 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:40,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 04:06:40,478 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 1322 transitions, 87661 flow [2022-12-13 04:06:40,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:40,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:40,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:40,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 04:06:40,478 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:06:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1834297381, now seen corresponding path program 4 times [2022-12-13 04:06:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:40,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944648680] [2022-12-13 04:06:40,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:40,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:40,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944648680] [2022-12-13 04:06:40,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944648680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:40,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:40,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:06:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097399589] [2022-12-13 04:06:40,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:40,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:06:40,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:40,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:06:40,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:06:40,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 04:06:40,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 1322 transitions, 87661 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:40,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:40,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 04:06:40,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:44,347 INFO L130 PetriNetUnfolder]: 4976/7293 cut-off events. [2022-12-13 04:06:44,348 INFO L131 PetriNetUnfolder]: For 167281/167281 co-relation queries the response was YES. [2022-12-13 04:06:44,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238974 conditions, 7293 events. 4976/7293 cut-off events. For 167281/167281 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 38445 event pairs, 16 based on Foata normal form. 2/6132 useless extension candidates. Maximal degree in co-relation 65083. Up to 7294 conditions per place. [2022-12-13 04:06:44,432 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 1210 selfloop transitions, 73 changer transitions 66/1350 dead transitions. [2022-12-13 04:06:44,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1350 transitions, 92225 flow [2022-12-13 04:06:44,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:06:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:06:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2022-12-13 04:06:44,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 04:06:44,433 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 81 predicate places. [2022-12-13 04:06:44,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 1350 transitions, 92225 flow [2022-12-13 04:06:44,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 1284 transitions, 87707 flow [2022-12-13 04:06:44,604 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:44,604 INFO L89 Accepts]: Start accepts. Operand has 118 places, 1284 transitions, 87707 flow [2022-12-13 04:06:44,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:44,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:44,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 1284 transitions, 87707 flow [2022-12-13 04:06:44,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 1284 transitions, 87707 flow [2022-12-13 04:06:44,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:44,722 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:44,723 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 04:06:44,723 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 1284 transitions, 87707 flow [2022-12-13 04:06:44,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:44,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:44,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:44,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 04:06:44,723 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:06:44,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:44,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1961725981, now seen corresponding path program 5 times [2022-12-13 04:06:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:44,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690876827] [2022-12-13 04:06:44,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:44,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:45,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690876827] [2022-12-13 04:06:45,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690876827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:06:45,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:06:45,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:06:45,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563586553] [2022-12-13 04:06:45,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:45,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:06:45,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:45,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:06:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:06:45,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 04:06:45,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 1284 transitions, 87707 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:45,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:45,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 04:06:45,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:48,708 INFO L130 PetriNetUnfolder]: 4892/7141 cut-off events. [2022-12-13 04:06:48,708 INFO L131 PetriNetUnfolder]: For 177747/177747 co-relation queries the response was YES. [2022-12-13 04:06:48,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240634 conditions, 7141 events. 4892/7141 cut-off events. For 177747/177747 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 37214 event pairs, 16 based on Foata normal form. 2/6016 useless extension candidates. Maximal degree in co-relation 64606. Up to 7142 conditions per place. [2022-12-13 04:06:48,803 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 1091 selfloop transitions, 156 changer transitions 34/1282 dead transitions. [2022-12-13 04:06:48,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 1282 transitions, 90133 flow [2022-12-13 04:06:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:06:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:06:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2022-12-13 04:06:48,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3770833333333333 [2022-12-13 04:06:48,804 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 91 predicate places. [2022-12-13 04:06:48,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 1282 transitions, 90133 flow [2022-12-13 04:06:48,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 1248 transitions, 87735 flow [2022-12-13 04:06:48,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:48,973 INFO L89 Accepts]: Start accepts. Operand has 127 places, 1248 transitions, 87735 flow [2022-12-13 04:06:48,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:48,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:48,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 1248 transitions, 87735 flow [2022-12-13 04:06:49,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 1248 transitions, 87735 flow [2022-12-13 04:06:49,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:49,048 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:49,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 04:06:49,049 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 1248 transitions, 87735 flow [2022-12-13 04:06:49,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:49,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:49,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:49,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 04:06:49,049 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:06:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1091708462, now seen corresponding path program 1 times [2022-12-13 04:06:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:49,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453828756] [2022-12-13 04:06:49,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:49,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453828756] [2022-12-13 04:06:49,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453828756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:06:49,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795711117] [2022-12-13 04:06:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:49,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:06:49,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:06:49,171 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 04:06:49,178 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 04:06:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:49,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 04:06:49,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:06:49,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:06:49,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 82 [2022-12-13 04:06:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:49,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:06:50,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:06:50,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-12-13 04:06:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 04:06:51,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795711117] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 04:06:51,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 04:06:51,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 9] total 22 [2022-12-13 04:06:51,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877994409] [2022-12-13 04:06:51,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:06:51,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:06:51,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:51,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:06:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-12-13 04:06:51,263 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 04:06:51,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 1248 transitions, 87735 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:51,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:51,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 04:06:51,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:55,819 INFO L130 PetriNetUnfolder]: 5142/7554 cut-off events. [2022-12-13 04:06:55,820 INFO L131 PetriNetUnfolder]: For 188644/188644 co-relation queries the response was YES. [2022-12-13 04:06:55,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261445 conditions, 7554 events. 5142/7554 cut-off events. For 188644/188644 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 40240 event pairs, 28 based on Foata normal form. 1/6404 useless extension candidates. Maximal degree in co-relation 73665. Up to 7555 conditions per place. [2022-12-13 04:06:55,918 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 1375 selfloop transitions, 194 changer transitions 13/1583 dead transitions. [2022-12-13 04:06:55,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1583 transitions, 114466 flow [2022-12-13 04:06:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 04:06:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 04:06:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2022-12-13 04:06:55,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38958333333333334 [2022-12-13 04:06:55,920 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 100 predicate places. [2022-12-13 04:06:55,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 1583 transitions, 114466 flow [2022-12-13 04:06:56,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 1570 transitions, 113515 flow [2022-12-13 04:06:56,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:56,136 INFO L89 Accepts]: Start accepts. Operand has 136 places, 1570 transitions, 113515 flow [2022-12-13 04:06:56,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:56,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:56,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 1570 transitions, 113515 flow [2022-12-13 04:06:56,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 1570 transitions, 113515 flow [2022-12-13 04:06:56,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:56,253 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:06:56,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 04:06:56,253 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 1570 transitions, 113515 flow [2022-12-13 04:06:56,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:56,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:56,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:56,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 04:06:56,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 04:06:56,458 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:06:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:56,459 INFO L85 PathProgramCache]: Analyzing trace with hash -500747360, now seen corresponding path program 2 times [2022-12-13 04:06:56,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:56,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605899605] [2022-12-13 04:06:56,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:56,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:56,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605899605] [2022-12-13 04:06:56,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605899605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:06:56,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557306393] [2022-12-13 04:06:56,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:06:56,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:06:56,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:06:56,601 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 04:06:56,603 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 04:06:56,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:06:56,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:06:56,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 04:06:56,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:06:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:57,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:06:57,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:06:57,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-12-13 04:06:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:06:58,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557306393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:06:58,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:06:58,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 22 [2022-12-13 04:06:58,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8593074] [2022-12-13 04:06:58,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:06:58,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 04:06:58,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 04:06:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2022-12-13 04:06:58,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 04:06:58,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 1570 transitions, 113515 flow. Second operand has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:58,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:58,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 04:06:58,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:07:07,293 INFO L130 PetriNetUnfolder]: 8207/11917 cut-off events. [2022-12-13 04:07:07,293 INFO L131 PetriNetUnfolder]: For 299640/299640 co-relation queries the response was YES. [2022-12-13 04:07:07,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423467 conditions, 11917 events. 8207/11917 cut-off events. For 299640/299640 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66859 event pairs, 28 based on Foata normal form. 4/9963 useless extension candidates. Maximal degree in co-relation 98097. Up to 11918 conditions per place. [2022-12-13 04:07:07,431 INFO L137 encePairwiseOnDemand]: 27/42 looper letters, 1333 selfloop transitions, 191 changer transitions 892/2417 dead transitions. [2022-12-13 04:07:07,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 2417 transitions, 179604 flow [2022-12-13 04:07:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 04:07:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-13 04:07:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 475 transitions. [2022-12-13 04:07:07,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3427128427128427 [2022-12-13 04:07:07,433 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 130 predicate places. [2022-12-13 04:07:07,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 2417 transitions, 179604 flow [2022-12-13 04:07:07,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 1525 transitions, 113287 flow [2022-12-13 04:07:07,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:07:07,699 INFO L89 Accepts]: Start accepts. Operand has 150 places, 1525 transitions, 113287 flow [2022-12-13 04:07:07,731 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:07:07,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:07:07,731 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 1525 transitions, 113287 flow [2022-12-13 04:07:07,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 1525 transitions, 113287 flow [2022-12-13 04:07:07,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:07:19,777 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:07:19,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12079 [2022-12-13 04:07:19,778 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 1524 transitions, 113213 flow [2022-12-13 04:07:19,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:19,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:07:19,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:07:19,785 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 04:07:19,983 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,SelfDestructingSolverStorable35 [2022-12-13 04:07:19,984 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:07:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:07:19,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1009098085, now seen corresponding path program 1 times [2022-12-13 04:07:19,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:07:19,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028177384] [2022-12-13 04:07:19,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:07:19,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:07:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:07:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:07:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:07:20,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028177384] [2022-12-13 04:07:20,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028177384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:07:20,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:07:20,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:07:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485668341] [2022-12-13 04:07:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:07:20,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:07:20,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:07:20,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:07:20,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:07:20,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:07:20,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 1524 transitions, 113213 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:20,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:07:20,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:07:20,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:07:26,087 INFO L130 PetriNetUnfolder]: 8264/11910 cut-off events. [2022-12-13 04:07:26,087 INFO L131 PetriNetUnfolder]: For 349396/349396 co-relation queries the response was YES. [2022-12-13 04:07:26,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433554 conditions, 11910 events. 8264/11910 cut-off events. For 349396/349396 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 65257 event pairs, 22 based on Foata normal form. 0/9850 useless extension candidates. Maximal degree in co-relation 103181. Up to 11911 conditions per place. [2022-12-13 04:07:26,245 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 2156 selfloop transitions, 61 changer transitions 0/2217 dead transitions. [2022-12-13 04:07:26,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 2217 transitions, 169038 flow [2022-12-13 04:07:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:07:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:07:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-12-13 04:07:26,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-13 04:07:26,246 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 114 predicate places. [2022-12-13 04:07:26,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 2217 transitions, 169038 flow [2022-12-13 04:07:26,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 2217 transitions, 169038 flow [2022-12-13 04:07:26,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:07:26,660 INFO L89 Accepts]: Start accepts. Operand has 152 places, 2217 transitions, 169038 flow [2022-12-13 04:07:26,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:07:26,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:07:26,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 2217 transitions, 169038 flow [2022-12-13 04:07:26,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 2217 transitions, 169038 flow [2022-12-13 04:07:26,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:07:26,759 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:07:26,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 04:07:26,760 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 2217 transitions, 169038 flow [2022-12-13 04:07:26,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:26,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:07:26,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:07:26,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 04:07:26,760 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:07:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:07:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1956817278, now seen corresponding path program 1 times [2022-12-13 04:07:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:07:26,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948196496] [2022-12-13 04:07:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:07:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:07:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:07:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:07:26,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:07:26,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948196496] [2022-12-13 04:07:26,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948196496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:07:26,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:07:26,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:07:26,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321090341] [2022-12-13 04:07:26,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:07:26,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:07:26,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:07:26,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:07:26,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:07:26,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 04:07:26,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 2217 transitions, 169038 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:26,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:07:26,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 04:07:26,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:07:36,061 INFO L130 PetriNetUnfolder]: 8265/11911 cut-off events. [2022-12-13 04:07:36,061 INFO L131 PetriNetUnfolder]: For 369436/369436 co-relation queries the response was YES. [2022-12-13 04:07:36,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444926 conditions, 11911 events. 8265/11911 cut-off events. For 369436/369436 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 65192 event pairs, 22 based on Foata normal form. 1/9851 useless extension candidates. Maximal degree in co-relation 105877. Up to 11912 conditions per place. [2022-12-13 04:07:36,193 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 1900 selfloop transitions, 0 changer transitions 336/2239 dead transitions. [2022-12-13 04:07:36,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 2239 transitions, 175188 flow [2022-12-13 04:07:36,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:07:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:07:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-12-13 04:07:36,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-13 04:07:36,195 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 119 predicate places. [2022-12-13 04:07:36,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 2239 transitions, 175188 flow [2022-12-13 04:07:36,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 1903 transitions, 148863 flow [2022-12-13 04:07:36,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:07:36,500 INFO L89 Accepts]: Start accepts. Operand has 153 places, 1903 transitions, 148863 flow [2022-12-13 04:07:36,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:07:36,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:07:36,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 1903 transitions, 148863 flow [2022-12-13 04:07:36,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 1903 transitions, 148863 flow [2022-12-13 04:07:36,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:07:36,602 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:07:36,603 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 04:07:36,603 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 1903 transitions, 148863 flow [2022-12-13 04:07:36,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:36,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:07:36,603 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:07:36,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 04:07:36,603 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:07:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:07:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1888244091, now seen corresponding path program 1 times [2022-12-13 04:07:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:07:36,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816868974] [2022-12-13 04:07:36,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:07:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:07:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:07:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:07:36,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:07:36,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816868974] [2022-12-13 04:07:36,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816868974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:07:36,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:07:36,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:07:36,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387576416] [2022-12-13 04:07:36,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:07:36,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:07:36,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:07:36,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:07:36,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:07:36,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 04:07:36,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 1903 transitions, 148863 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:36,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:07:36,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 04:07:36,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:07:42,213 INFO L130 PetriNetUnfolder]: 5583/8114 cut-off events. [2022-12-13 04:07:42,213 INFO L131 PetriNetUnfolder]: For 263854/263854 co-relation queries the response was YES. [2022-12-13 04:07:42,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311766 conditions, 8114 events. 5583/8114 cut-off events. For 263854/263854 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 42276 event pairs, 12 based on Foata normal form. 212/6889 useless extension candidates. Maximal degree in co-relation 108725. Up to 8115 conditions per place. [2022-12-13 04:07:42,345 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 1322 selfloop transitions, 0 changer transitions 300/1622 dead transitions. [2022-12-13 04:07:42,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1622 transitions, 130141 flow [2022-12-13 04:07:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:07:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:07:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 04:07:42,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2022-12-13 04:07:42,346 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 115 predicate places. [2022-12-13 04:07:42,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 1622 transitions, 130141 flow [2022-12-13 04:07:42,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 1322 transitions, 106015 flow [2022-12-13 04:07:42,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:07:42,535 INFO L89 Accepts]: Start accepts. Operand has 112 places, 1322 transitions, 106015 flow [2022-12-13 04:07:42,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:07:42,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:07:42,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 1322 transitions, 106015 flow [2022-12-13 04:07:42,600 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 1322 transitions, 106015 flow [2022-12-13 04:07:42,600 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:07:42,603 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:07:42,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 04:07:42,604 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 1322 transitions, 106015 flow [2022-12-13 04:07:42,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:42,604 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:07:42,604 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:07:42,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 04:07:42,604 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:07:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:07:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash -957500886, now seen corresponding path program 1 times [2022-12-13 04:07:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:07:42,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082322062] [2022-12-13 04:07:42,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:07:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:07:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:07:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:07:42,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:07:42,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082322062] [2022-12-13 04:07:42,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082322062] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:07:42,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435557526] [2022-12-13 04:07:42,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:07:42,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:07:42,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:07:42,741 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 04:07:42,743 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 04:07:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:07:42,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 04:07:42,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:07:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:07:42,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:07:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:07:42,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435557526] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:07:42,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:07:42,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 04:07:42,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449650945] [2022-12-13 04:07:42,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:07:42,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:07:42,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:07:42,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:07:42,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:07:42,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-13 04:07:42,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 1322 transitions, 106015 flow. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:42,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:07:42,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-13 04:07:42,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:07:46,813 INFO L130 PetriNetUnfolder]: 5604/7980 cut-off events. [2022-12-13 04:07:46,814 INFO L131 PetriNetUnfolder]: For 296589/296589 co-relation queries the response was YES. [2022-12-13 04:07:46,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313092 conditions, 7980 events. 5604/7980 cut-off events. For 296589/296589 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 39538 event pairs, 4 based on Foata normal form. 0/6510 useless extension candidates. Maximal degree in co-relation 111421. Up to 7981 conditions per place. [2022-12-13 04:07:46,944 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 1661 selfloop transitions, 210 changer transitions 0/1874 dead transitions. [2022-12-13 04:07:46,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1874 transitions, 154073 flow [2022-12-13 04:07:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:07:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:07:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2022-12-13 04:07:46,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.483974358974359 [2022-12-13 04:07:46,946 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 81 predicate places. [2022-12-13 04:07:46,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 1874 transitions, 154073 flow [2022-12-13 04:07:47,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 1874 transitions, 154073 flow [2022-12-13 04:07:47,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:07:47,254 INFO L89 Accepts]: Start accepts. Operand has 119 places, 1874 transitions, 154073 flow [2022-12-13 04:07:47,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:07:47,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:07:47,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 1874 transitions, 154073 flow [2022-12-13 04:07:47,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 1874 transitions, 154073 flow [2022-12-13 04:07:47,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:07:47,350 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:07:47,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 04:07:47,351 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 1874 transitions, 154073 flow [2022-12-13 04:07:47,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:47,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:07:47,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:07:47,356 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 04:07:47,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 04:07:47,553 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:07:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:07:47,553 INFO L85 PathProgramCache]: Analyzing trace with hash 580703970, now seen corresponding path program 1 times [2022-12-13 04:07:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:07:47,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761138556] [2022-12-13 04:07:47,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:07:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:07:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:07:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:07:47,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:07:47,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761138556] [2022-12-13 04:07:47,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761138556] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:07:47,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236053162] [2022-12-13 04:07:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:07:47,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:07:47,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:07:47,979 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 04:07:47,980 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 04:07:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:07:48,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 04:07:48,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:07:48,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:07:48,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-13 04:07:48,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:07:48,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:07:48,164 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 04:07:48,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-13 04:07:48,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 04:07:48,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:07:48,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:07:48,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:07:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:07:48,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:07:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:07:49,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236053162] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 04:07:49,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 04:07:49,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10, 12] total 32 [2022-12-13 04:07:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123011478] [2022-12-13 04:07:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:07:49,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 04:07:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:07:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 04:07:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=810, Unknown=9, NotChecked=0, Total=1056 [2022-12-13 04:07:49,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 04:07:49,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 1874 transitions, 154073 flow. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:07:49,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:07:49,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 04:07:49,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:07:59,006 INFO L130 PetriNetUnfolder]: 8931/12714 cut-off events. [2022-12-13 04:07:59,007 INFO L131 PetriNetUnfolder]: For 411181/411181 co-relation queries the response was YES. [2022-12-13 04:07:59,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511007 conditions, 12714 events. 8931/12714 cut-off events. For 411181/411181 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 68214 event pairs, 22 based on Foata normal form. 0/10249 useless extension candidates. Maximal degree in co-relation 262582. Up to 12715 conditions per place. [2022-12-13 04:07:59,178 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 3027 selfloop transitions, 150 changer transitions 0/3177 dead transitions. [2022-12-13 04:07:59,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 3177 transitions, 266737 flow [2022-12-13 04:07:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:07:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:07:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 211 transitions. [2022-12-13 04:07:59,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4161735700197239 [2022-12-13 04:07:59,180 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2022-12-13 04:07:59,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 3177 transitions, 266737 flow [2022-12-13 04:07:59,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 3177 transitions, 266737 flow [2022-12-13 04:07:59,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:07:59,546 INFO L89 Accepts]: Start accepts. Operand has 131 places, 3177 transitions, 266737 flow [2022-12-13 04:07:59,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:07:59,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:07:59,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 3177 transitions, 266737 flow [2022-12-13 04:07:59,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 3177 transitions, 266737 flow [2022-12-13 04:07:59,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:08:07,571 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:08:07,572 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8026 [2022-12-13 04:08:07,572 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 3176 transitions, 266653 flow [2022-12-13 04:08:07,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:08:07,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:08:07,572 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:08:07,579 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 04:08:07,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:08:07,774 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:08:07,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:08:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1231274843, now seen corresponding path program 1 times [2022-12-13 04:08:07,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:08:07,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537402209] [2022-12-13 04:08:07,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:08:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:08:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:08:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:08:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:08:09,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537402209] [2022-12-13 04:08:09,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537402209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:08:09,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767569318] [2022-12-13 04:08:09,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:08:09,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:08:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:08:09,576 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 04:08:09,576 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 04:08:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:08:09,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 04:08:09,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:08:09,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:09,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:09,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:09,820 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-12-13 04:08:09,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 326 [2022-12-13 04:08:09,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 354 [2022-12-13 04:08:09,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 04:08:09,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 04:08:09,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 04:08:10,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:10,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:08:10,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:08:10,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:08:10,070 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-12-13 04:08:10,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 123 [2022-12-13 04:08:10,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 04:08:10,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:10,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:10,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:08:10,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:08:10,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:08:10,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 113 [2022-12-13 04:08:10,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 04:08:10,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:10,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:10,176 INFO L321 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-12-13 04:08:10,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 120 [2022-12-13 04:08:10,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2022-12-13 04:08:10,232 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:08:10,233 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 159 [2022-12-13 04:08:10,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:10,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:10,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:10,517 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-13 04:08:10,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 213 treesize of output 197 [2022-12-13 04:08:10,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 04:08:10,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:10,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 04:08:11,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:08:11,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 141 [2022-12-13 04:08:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:08:11,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:08:12,437 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 04:08:12,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767569318] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 04:08:12,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 04:08:12,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 33 [2022-12-13 04:08:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031101984] [2022-12-13 04:08:12,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:08:12,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 04:08:12,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:08:12,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 04:08:12,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1028, Unknown=17, NotChecked=0, Total=1190 [2022-12-13 04:08:12,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:08:12,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 3176 transitions, 266653 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:08:12,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:08:12,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:08:12,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:08:31,693 INFO L130 PetriNetUnfolder]: 10351/14771 cut-off events. [2022-12-13 04:08:31,693 INFO L131 PetriNetUnfolder]: For 491979/491979 co-relation queries the response was YES. [2022-12-13 04:08:31,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608399 conditions, 14771 events. 10351/14771 cut-off events. For 491979/491979 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 81467 event pairs, 16 based on Foata normal form. 1/11831 useless extension candidates. Maximal degree in co-relation 336134. Up to 14772 conditions per place. [2022-12-13 04:08:32,009 INFO L137 encePairwiseOnDemand]: 19/40 looper letters, 3435 selfloop transitions, 312 changer transitions 10/3757 dead transitions. [2022-12-13 04:08:32,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 3757 transitions, 321452 flow [2022-12-13 04:08:32,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:08:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:08:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-12-13 04:08:32,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.303125 [2022-12-13 04:08:32,033 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2022-12-13 04:08:32,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 3757 transitions, 321452 flow [2022-12-13 04:08:32,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 3747 transitions, 320580 flow [2022-12-13 04:08:32,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:08:32,614 INFO L89 Accepts]: Start accepts. Operand has 145 places, 3747 transitions, 320580 flow [2022-12-13 04:08:32,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:08:32,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:08:32,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 3747 transitions, 320580 flow [2022-12-13 04:08:32,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 3747 transitions, 320580 flow [2022-12-13 04:08:32,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:08:32,959 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:08:32,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-13 04:08:32,960 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 3747 transitions, 320580 flow [2022-12-13 04:08:32,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:08:32,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:08:32,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:08:32,966 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 04:08:33,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:08:33,166 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:08:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:08:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash -372215347, now seen corresponding path program 1 times [2022-12-13 04:08:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:08:33,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016362820] [2022-12-13 04:08:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:08:33,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:08:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:08:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:08:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:08:34,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016362820] [2022-12-13 04:08:34,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016362820] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:08:34,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594164375] [2022-12-13 04:08:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:08:34,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:08:34,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:08:34,597 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 04:08:34,598 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 04:08:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:08:34,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 04:08:34,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:08:34,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:34,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:34,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:34,918 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-12-13 04:08:34,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 274 [2022-12-13 04:08:34,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 426 [2022-12-13 04:08:34,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 04:08:34,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 04:08:34,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 04:08:35,121 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:08:35,122 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 417 [2022-12-13 04:08:35,267 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:08:35,269 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 225 [2022-12-13 04:08:35,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:35,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:35,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:08:35,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:35,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:35,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:35,292 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 04:08:35,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 86 [2022-12-13 04:08:35,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 04:08:35,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 04:08:35,361 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:08:35,362 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 852 [2022-12-13 04:08:35,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:35,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:35,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 385 [2022-12-13 04:08:35,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 04:08:36,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:36,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:37,071 INFO L321 Elim1Store]: treesize reduction 112, result has 43.1 percent of original size [2022-12-13 04:08:37,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 4413 treesize of output 3796 [2022-12-13 04:08:37,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 04:08:37,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 04:08:37,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 04:08:37,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 04:08:37,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 04:08:37,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:08:37,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 04:08:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:08:38,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:08:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:08:38,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594164375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:08:38,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:08:38,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-13 04:08:38,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530772937] [2022-12-13 04:08:38,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:08:38,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 04:08:38,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:08:38,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 04:08:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=833, Unknown=22, NotChecked=0, Total=992 [2022-12-13 04:08:39,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:08:39,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 3747 transitions, 320580 flow. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 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 04:08:39,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:08:39,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:08:39,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:09:03,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:09:05,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:09:10,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:09:49,054 INFO L130 PetriNetUnfolder]: 15829/22599 cut-off events. [2022-12-13 04:09:49,054 INFO L131 PetriNetUnfolder]: For 734692/734692 co-relation queries the response was YES. [2022-12-13 04:09:49,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952047 conditions, 22599 events. 15829/22599 cut-off events. For 734692/734692 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 133711 event pairs, 12 based on Foata normal form. 0/17888 useless extension candidates. Maximal degree in co-relation 532539. Up to 22600 conditions per place. [2022-12-13 04:09:49,471 INFO L137 encePairwiseOnDemand]: 21/40 looper letters, 5367 selfloop transitions, 436 changer transitions 0/5803 dead transitions. [2022-12-13 04:09:49,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 5803 transitions, 506392 flow [2022-12-13 04:09:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 04:09:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-13 04:09:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 564 transitions. [2022-12-13 04:09:49,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3525 [2022-12-13 04:09:49,473 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 146 predicate places. [2022-12-13 04:09:49,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 5803 transitions, 506392 flow [2022-12-13 04:09:49,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 5803 transitions, 506392 flow [2022-12-13 04:09:50,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:09:50,361 INFO L89 Accepts]: Start accepts. Operand has 184 places, 5803 transitions, 506392 flow [2022-12-13 04:09:50,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:09:50,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:09:50,552 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 5803 transitions, 506392 flow [2022-12-13 04:09:50,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 5803 transitions, 506392 flow [2022-12-13 04:09:50,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:09:50,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [836] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 0) (= v_~count1~0_17 v_~count2~0_15) (= v_thread1Thread1of1ForFork0_~stop~0_17 0)) InVars {~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17} OutVars{~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] and [826] L120-4-->L121-3: Formula: (and (= |v_#pthreadsForks_20| (+ |v_#pthreadsForks_21| 1)) (= |v_#pthreadsForks_21| |v_ULTIMATE.start_main_#t~pre27#1_13|) (= (store |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre27#1_13|)) |v_#memory_int_50|)) InVars {#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_13|, #memory_int=|v_#memory_int_50|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_13|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre25#1, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet26#1] [2022-12-13 04:09:50,963 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] L49-6-->L50-1: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_21 v_~n1~0_10) (< v_thread1Thread1of1ForFork0_~i~0_21 v_~n2~0_10) (= (select (select |v_#memory_int_30| v_~get1~0.base_7) (+ v_~get1~0.offset_7 (* v_thread1Thread1of1ForFork0_~i~0_21 4))) |v_thread1Thread1of1ForFork0_#t~mem2_13|)) InVars {~n2~0=v_~n2~0_10, ~n1~0=v_~n1~0_10, #memory_int=|v_#memory_int_30|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_21, ~get1~0.offset=v_~get1~0.offset_7, ~get1~0.base=v_~get1~0.base_7} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_13|, ~n2~0=v_~n2~0_10, ~n1~0=v_~n1~0_10, #memory_int=|v_#memory_int_30|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_21, ~get1~0.offset=v_~get1~0.offset_7, ~get1~0.base=v_~get1~0.base_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2] and [826] L120-4-->L121-3: Formula: (and (= |v_#pthreadsForks_20| (+ |v_#pthreadsForks_21| 1)) (= |v_#pthreadsForks_21| |v_ULTIMATE.start_main_#t~pre27#1_13|) (= (store |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre27#1_13|)) |v_#memory_int_50|)) InVars {#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_13|, #memory_int=|v_#memory_int_50|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_13|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre25#1, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet26#1] [2022-12-13 04:09:51,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [836] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 0) (= v_~count1~0_17 v_~count2~0_15) (= v_thread1Thread1of1ForFork0_~stop~0_17 0)) InVars {~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17} OutVars{~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] and [826] L120-4-->L121-3: Formula: (and (= |v_#pthreadsForks_20| (+ |v_#pthreadsForks_21| 1)) (= |v_#pthreadsForks_21| |v_ULTIMATE.start_main_#t~pre27#1_13|) (= (store |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre27#1_13|)) |v_#memory_int_50|)) InVars {#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_13|, #memory_int=|v_#memory_int_50|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_13|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre25#1, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet26#1] [2022-12-13 04:09:51,121 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1113] $Ultimate##0-->L50-1: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_116 0) (= (select (select |v_#memory_int_509| v_~get1~0.base_126) (+ v_~get1~0.offset_126 (* v_thread1Thread1of1ForFork0_~i~0_116 4))) |v_thread1Thread1of1ForFork0_#t~mem2_76|) (= v_thread1Thread1of1ForFork0_~stop~0_49 0) (= v_~count1~0_91 v_~count2~0_87) (< v_thread1Thread1of1ForFork0_~i~0_116 v_~n1~0_108) (< v_thread1Thread1of1ForFork0_~i~0_116 v_~n2~0_128)) InVars {~n2~0=v_~n2~0_128, ~n1~0=v_~n1~0_108, ~count2~0=v_~count2~0_87, ~count1~0=v_~count1~0_91, #memory_int=|v_#memory_int_509|, ~get1~0.offset=v_~get1~0.offset_126, ~get1~0.base=v_~get1~0.base_126} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_76|, ~n2~0=v_~n2~0_128, ~n1~0=v_~n1~0_108, ~count2~0=v_~count2~0_87, ~count1~0=v_~count1~0_91, #memory_int=|v_#memory_int_509|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_116, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_49, ~get1~0.offset=v_~get1~0.offset_126, ~get1~0.base=v_~get1~0.base_126} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] and [826] L120-4-->L121-3: Formula: (and (= |v_#pthreadsForks_20| (+ |v_#pthreadsForks_21| 1)) (= |v_#pthreadsForks_21| |v_ULTIMATE.start_main_#t~pre27#1_13|) (= (store |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre27#1_13|)) |v_#memory_int_50|)) InVars {#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_13|, #memory_int=|v_#memory_int_50|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_13|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre25#1, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet26#1] [2022-12-13 04:09:51,236 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 04:09:51,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 877 [2022-12-13 04:09:51,237 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 5799 transitions, 506048 flow [2022-12-13 04:09:51,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 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 04:09:51,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:09:51,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:09:51,247 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 04:09:51,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:09:51,445 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:09:51,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:09:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash 159830455, now seen corresponding path program 2 times [2022-12-13 04:09:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:09:51,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857298657] [2022-12-13 04:09:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:09:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:09:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:09:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:09:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:09:52,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857298657] [2022-12-13 04:09:52,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857298657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:09:52,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827119336] [2022-12-13 04:09:52,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:09:52,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:09:52,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:09:52,841 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 04:09:52,848 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 04:09:53,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:09:53,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:09:53,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-13 04:09:53,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:09:53,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:09:53,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:09:53,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:09:53,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:09:53,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:09:53,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:09:53,076 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-13 04:09:53,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 32 [2022-12-13 04:09:53,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 04:09:53,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:09:53,092 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 04:09:53,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 350 [2022-12-13 04:09:53,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:09:53,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 04:09:54,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:09:54,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 141 [2022-12-13 04:09:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:09:54,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:09:55,833 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 04:09:55,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827119336] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 04:09:55,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 04:09:55,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 32 [2022-12-13 04:09:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613129826] [2022-12-13 04:09:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:09:55,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 04:09:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:09:55,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 04:09:55,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=943, Unknown=18, NotChecked=0, Total=1122 [2022-12-13 04:09:55,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 04:09:55,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 5799 transitions, 506048 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:09:55,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:09:55,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 04:09:55,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:11:08,793 INFO L130 PetriNetUnfolder]: 20485/28958 cut-off events. [2022-12-13 04:11:08,794 INFO L131 PetriNetUnfolder]: For 992824/992824 co-relation queries the response was YES. [2022-12-13 04:11:08,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248478 conditions, 28958 events. 20485/28958 cut-off events. For 992824/992824 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 173343 event pairs, 12 based on Foata normal form. 1/22894 useless extension candidates. Maximal degree in co-relation 581527. Up to 28959 conditions per place. [2022-12-13 04:11:09,293 INFO L137 encePairwiseOnDemand]: 21/46 looper letters, 6557 selfloop transitions, 862 changer transitions 22/7441 dead transitions. [2022-12-13 04:11:09,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 7441 transitions, 662754 flow [2022-12-13 04:11:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 04:11:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 04:11:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 253 transitions. [2022-12-13 04:11:09,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-13 04:11:09,295 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 161 predicate places. [2022-12-13 04:11:09,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 7441 transitions, 662754 flow [2022-12-13 04:11:10,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 7419 transitions, 660762 flow [2022-12-13 04:11:10,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:11:10,785 INFO L89 Accepts]: Start accepts. Operand has 198 places, 7419 transitions, 660762 flow [2022-12-13 04:11:11,405 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:11:11,405 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:11:11,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 7419 transitions, 660762 flow [2022-12-13 04:11:11,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 7419 transitions, 660762 flow [2022-12-13 04:11:11,842 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:11:11,858 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:11:11,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1074 [2022-12-13 04:11:11,858 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 7419 transitions, 660762 flow [2022-12-13 04:11:11,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:11,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:11:11,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:11,867 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 04:11:12,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:12,064 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:11:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:11:12,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1914545986, now seen corresponding path program 1 times [2022-12-13 04:11:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:11:12,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276297339] [2022-12-13 04:11:12,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:12,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:11:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:11:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:11:13,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:11:13,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276297339] [2022-12-13 04:11:13,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276297339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:11:13,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:11:13,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:11:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89100416] [2022-12-13 04:11:13,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:11:13,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:11:13,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:11:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:11:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:11:13,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 04:11:13,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 7419 transitions, 660762 flow. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:13,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:11:13,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 04:11:13,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:13:16,556 INFO L130 PetriNetUnfolder]: 21864/30951 cut-off events. [2022-12-13 04:13:16,556 INFO L131 PetriNetUnfolder]: For 1029164/1029164 co-relation queries the response was YES. [2022-12-13 04:13:16,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365568 conditions, 30951 events. 21864/30951 cut-off events. For 1029164/1029164 co-relation queries the response was YES. Maximal size of possible extension queue 1304. Compared 187895 event pairs, 16 based on Foata normal form. 2/24415 useless extension candidates. Maximal degree in co-relation 663697. Up to 30952 conditions per place. [2022-12-13 04:13:17,142 INFO L137 encePairwiseOnDemand]: 31/46 looper letters, 7857 selfloop transitions, 153 changer transitions 44/8054 dead transitions. [2022-12-13 04:13:17,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 8054 transitions, 733416 flow [2022-12-13 04:13:17,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 04:13:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 04:13:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 263 transitions. [2022-12-13 04:13:17,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38115942028985506 [2022-12-13 04:13:17,148 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 174 predicate places. [2022-12-13 04:13:17,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 8054 transitions, 733416 flow [2022-12-13 04:13:17,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 8010 transitions, 729344 flow [2022-12-13 04:13:18,483 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:13:18,483 INFO L89 Accepts]: Start accepts. Operand has 208 places, 8010 transitions, 729344 flow [2022-12-13 04:13:19,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:13:19,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:13:19,161 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 8010 transitions, 729344 flow [2022-12-13 04:13:19,652 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 8010 transitions, 729344 flow [2022-12-13 04:13:19,652 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:13:19,670 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:13:19,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1187 [2022-12-13 04:13:19,670 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 8010 transitions, 729344 flow [2022-12-13 04:13:19,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:13:19,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:13:19,671 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:13:19,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 04:13:19,671 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:13:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:13:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash -730764336, now seen corresponding path program 1 times [2022-12-13 04:13:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:13:19,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108426665] [2022-12-13 04:13:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:13:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:13:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:13:20,472 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 04:13:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:13:20,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108426665] [2022-12-13 04:13:20,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108426665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:13:20,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:13:20,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:13:20,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302731213] [2022-12-13 04:13:20,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:13:20,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:13:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:13:20,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:13:20,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:13:20,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 04:13:20,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 8010 transitions, 729344 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:13:20,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:13:20,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 04:13:20,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:15:18,266 INFO L130 PetriNetUnfolder]: 22204/31425 cut-off events. [2022-12-13 04:15:18,266 INFO L131 PetriNetUnfolder]: For 1065383/1065383 co-relation queries the response was YES. [2022-12-13 04:15:18,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418816 conditions, 31425 events. 22204/31425 cut-off events. For 1065383/1065383 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 190889 event pairs, 24 based on Foata normal form. 0/24759 useless extension candidates. Maximal degree in co-relation 695671. Up to 31426 conditions per place. [2022-12-13 04:15:18,924 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 7982 selfloop transitions, 202 changer transitions 0/8184 dead transitions. [2022-12-13 04:15:18,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 8184 transitions, 761762 flow [2022-12-13 04:15:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:15:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:15:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 255 transitions. [2022-12-13 04:15:18,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42642140468227424 [2022-12-13 04:15:18,925 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 182 predicate places. [2022-12-13 04:15:18,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 8184 transitions, 761762 flow [2022-12-13 04:15:19,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 8184 transitions, 761762 flow [2022-12-13 04:15:20,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:15:20,258 INFO L89 Accepts]: Start accepts. Operand has 220 places, 8184 transitions, 761762 flow [2022-12-13 04:15:20,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:15:20,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:15:20,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 8184 transitions, 761762 flow [2022-12-13 04:15:20,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 8184 transitions, 761762 flow [2022-12-13 04:15:20,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:15:20,981 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:15:20,982 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 725 [2022-12-13 04:15:20,982 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 8184 transitions, 761762 flow [2022-12-13 04:15:20,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:20,982 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:15:20,982 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:15:20,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 04:15:20,982 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:15:20,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:15:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 288481680, now seen corresponding path program 2 times [2022-12-13 04:15:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:15:20,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481589373] [2022-12-13 04:15:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:15:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:15:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:15:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:15:21,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:15:21,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481589373] [2022-12-13 04:15:21,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481589373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:15:21,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:15:21,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:15:21,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025335235] [2022-12-13 04:15:21,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:15:21,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:15:21,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:15:21,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:15:21,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:15:21,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 04:15:21,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 8184 transitions, 761762 flow. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:15:21,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:15:21,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 04:15:21,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:17:31,736 INFO L130 PetriNetUnfolder]: 22262/31549 cut-off events. [2022-12-13 04:17:31,736 INFO L131 PetriNetUnfolder]: For 1068963/1068963 co-relation queries the response was YES. [2022-12-13 04:17:31,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456210 conditions, 31549 events. 22262/31549 cut-off events. For 1068963/1068963 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 192157 event pairs, 30 based on Foata normal form. 2/24853 useless extension candidates. Maximal degree in co-relation 714829. Up to 31550 conditions per place. [2022-12-13 04:17:32,364 INFO L137 encePairwiseOnDemand]: 31/46 looper letters, 8021 selfloop transitions, 189 changer transitions 24/8234 dead transitions. [2022-12-13 04:17:32,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 8234 transitions, 782966 flow [2022-12-13 04:17:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 04:17:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 04:17:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 271 transitions. [2022-12-13 04:17:32,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3927536231884058 [2022-12-13 04:17:32,366 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 196 predicate places. [2022-12-13 04:17:32,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 8234 transitions, 782966 flow [2022-12-13 04:17:33,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 8210 transitions, 780644 flow [2022-12-13 04:17:33,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:17:33,827 INFO L89 Accepts]: Start accepts. Operand has 232 places, 8210 transitions, 780644 flow [2022-12-13 04:17:34,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:17:34,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:17:34,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 8210 transitions, 780644 flow [2022-12-13 04:17:34,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 8210 transitions, 780644 flow [2022-12-13 04:17:34,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:17:34,616 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:17:34,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 790 [2022-12-13 04:17:34,617 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 8210 transitions, 780644 flow [2022-12-13 04:17:34,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:34,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:17:34,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:17:34,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 04:17:34,617 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:17:34,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:17:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash -803903855, now seen corresponding path program 1 times [2022-12-13 04:17:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:17:34,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507155579] [2022-12-13 04:17:34,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:17:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:17:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:17:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:17:35,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:17:35,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507155579] [2022-12-13 04:17:35,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507155579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:17:35,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:17:35,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:17:35,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646766064] [2022-12-13 04:17:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:17:35,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 04:17:35,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:17:35,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 04:17:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 04:17:35,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 04:17:35,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 8210 transitions, 780644 flow. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:17:35,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:17:35,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 04:17:35,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 04:18:53,819 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 04:18:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:18:53,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 04:18:53,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 04:18:53,834 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 950412 conditions, 19973 events (14245/19972 cut-off events. For 635959/635959 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 124230 event pairs, 9 based on Foata normal form. 0/16651 useless extension candidates. Maximal degree in co-relation 559761. Up to 19973 conditions per place.). [2022-12-13 04:18:53,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 04:18:53,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 04:18:53,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 04:18:53,836 INFO L445 BasicCegarLoop]: Path program histogram: [6, 6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:18:53,838 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:18:53,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:18:53,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:18:53 BasicIcfg [2022-12-13 04:18:53,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:18:53,839 INFO L158 Benchmark]: Toolchain (without parser) took 795867.96ms. Allocated memory was 194.0MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 171.3MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-13 04:18:53,839 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 171.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:18:53,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.14ms. Allocated memory is still 194.0MB. Free memory was 170.9MB in the beginning and 158.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 04:18:53,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.48ms. Allocated memory is still 194.0MB. Free memory was 158.7MB in the beginning and 156.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:18:53,840 INFO L158 Benchmark]: Boogie Preprocessor took 40.89ms. Allocated memory is still 194.0MB. Free memory was 156.7MB in the beginning and 154.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:18:53,840 INFO L158 Benchmark]: RCFGBuilder took 505.19ms. Allocated memory is still 194.0MB. Free memory was 154.6MB in the beginning and 131.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 04:18:53,840 INFO L158 Benchmark]: TraceAbstraction took 794971.80ms. Allocated memory was 194.0MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 130.0MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-13 04:18:53,841 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 171.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 292.14ms. Allocated memory is still 194.0MB. Free memory was 170.9MB in the beginning and 158.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.48ms. Allocated memory is still 194.0MB. Free memory was 158.7MB in the beginning and 156.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.89ms. Allocated memory is still 194.0MB. Free memory was 156.7MB in the beginning and 154.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 505.19ms. Allocated memory is still 194.0MB. Free memory was 154.6MB in the beginning and 131.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 794971.80ms. Allocated memory was 194.0MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 130.0MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 256 PlacesBefore, 38 PlacesAfterwards, 275 TransitionsBefore, 39 TransitionsAfterwards, 7560 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 143 TrivialYvCompositions, 75 ConcurrentYvCompositions, 17 ChoiceCompositions, 235 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 5189, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 0, independent unconditional: 5189, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 0, independent unconditional: 5189, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 0, independent unconditional: 5189, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4551, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4551, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5253, independent: 680, independent conditional: 0, independent unconditional: 680, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 4551, unknown conditional: 0, unknown unconditional: 4551] , Statistics on independence cache: Total cache size (in pairs): 7944, Positive cache size: 7902, Positive conditional cache size: 0, Positive unconditional cache size: 7902, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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, 35 TransitionsBefore, 35 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 66 TransitionsBefore, 66 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 30, independent conditional: 15, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 30, independent conditional: 6, independent unconditional: 24, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 30, independent conditional: 6, independent unconditional: 24, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 17, independent conditional: 4, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 14, unknown conditional: 2, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 56, independent conditional: 49, independent unconditional: 7, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 149 TransitionsBefore, 149 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 99, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 99, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 173 TransitionsBefore, 173 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 182, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 182, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 162 TransitionsBefore, 162 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 221, independent: 208, independent conditional: 195, independent unconditional: 13, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 234, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 234, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 26, dependent conditional: 0, dependent unconditional: 26, 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: 234, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 221, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 263 TransitionsBefore, 263 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 102, independent conditional: 17, independent unconditional: 85, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 102, independent conditional: 17, independent unconditional: 85, dependent: 51, dependent conditional: 0, dependent unconditional: 51, 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: 153, independent: 102, independent conditional: 17, independent unconditional: 85, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 136, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 280 TransitionsBefore, 280 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 54, dependent conditional: 0, dependent unconditional: 54, 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: 126, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 126, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 274 TransitionsBefore, 274 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 126, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 72, dependent conditional: 0, dependent unconditional: 72, 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: 180, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 180, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 251 TransitionsBefore, 251 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 68, dependent conditional: 0, dependent unconditional: 68, 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: 153, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 153, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 279 TransitionsBefore, 279 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 85, dependent conditional: 0, dependent unconditional: 85, 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: 187, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 187, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 275 TransitionsBefore, 275 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 176, independent: 80, independent conditional: 16, independent unconditional: 64, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 80, independent conditional: 16, independent unconditional: 64, dependent: 96, dependent conditional: 0, dependent unconditional: 96, 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: 176, independent: 80, independent conditional: 16, independent unconditional: 64, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 160, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 228 TransitionsBefore, 228 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 45, independent conditional: 30, independent unconditional: 15, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 45, independent conditional: 30, independent unconditional: 15, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 45, independent conditional: 30, independent unconditional: 15, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 165, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 225, independent: 120, independent conditional: 30, independent unconditional: 90, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 225, independent: 120, independent conditional: 30, independent unconditional: 90, dependent: 105, dependent conditional: 0, dependent unconditional: 105, 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: 225, independent: 120, independent conditional: 30, independent unconditional: 90, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 195, Maximal queried relation: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 182 TransitionsBefore, 182 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 204, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 204, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 192, independent conditional: 48, independent unconditional: 144, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 192, independent conditional: 48, independent unconditional: 144, dependent: 84, dependent conditional: 0, dependent unconditional: 84, 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: 276, independent: 192, independent conditional: 48, independent unconditional: 144, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 228, Maximal queried relation: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.5s, 75 PlacesBefore, 72 PlacesAfterwards, 315 TransitionsBefore, 312 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1248, independent: 1200, independent conditional: 1200, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1248, independent: 1200, independent conditional: 1200, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1584, independent: 1200, independent conditional: 288, independent unconditional: 912, dependent: 384, dependent conditional: 0, dependent unconditional: 384, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1584, independent: 1200, independent conditional: 288, independent unconditional: 912, dependent: 384, dependent conditional: 0, dependent unconditional: 384, 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: 1584, independent: 1200, independent conditional: 288, independent unconditional: 912, dependent: 384, dependent conditional: 0, dependent unconditional: 384, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1296, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 75 PlacesBefore, 74 PlacesAfterwards, 491 TransitionsBefore, 490 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 864, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 864, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1368, independent: 792, independent conditional: 144, independent unconditional: 648, dependent: 576, dependent conditional: 0, dependent unconditional: 576, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1368, independent: 792, independent conditional: 144, independent unconditional: 648, dependent: 576, dependent conditional: 0, dependent unconditional: 576, 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: 1368, independent: 792, independent conditional: 144, independent unconditional: 648, dependent: 576, dependent conditional: 0, dependent unconditional: 576, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1224, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 648 TransitionsBefore, 648 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1276, independent: 1232, independent conditional: 1232, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1276, independent: 1232, independent conditional: 1232, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1584, independent: 1232, independent conditional: 88, independent unconditional: 1144, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1584, independent: 1232, independent conditional: 88, independent unconditional: 1144, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1584, independent: 1230, independent conditional: 88, independent unconditional: 1142, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1496, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 83 PlacesBefore, 83 PlacesAfterwards, 751 TransitionsBefore, 751 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1404, independent: 1350, independent conditional: 1350, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1404, independent: 1350, independent conditional: 1350, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1782, independent: 1350, independent conditional: 270, independent unconditional: 1080, dependent: 432, dependent conditional: 0, dependent unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1782, independent: 1350, independent conditional: 270, independent unconditional: 1080, dependent: 432, dependent conditional: 0, dependent unconditional: 432, 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: 1782, independent: 1350, independent conditional: 270, independent unconditional: 1080, dependent: 432, dependent conditional: 0, dependent unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1512, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 733 TransitionsBefore, 733 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1458, independent: 1404, independent conditional: 1404, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1458, independent: 1404, independent conditional: 1404, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1836, independent: 1404, independent conditional: 270, independent unconditional: 1134, dependent: 432, dependent conditional: 0, dependent unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1836, independent: 1404, independent conditional: 270, independent unconditional: 1134, dependent: 432, dependent conditional: 0, dependent unconditional: 432, 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: 1836, independent: 1404, independent conditional: 270, independent unconditional: 1134, dependent: 432, dependent conditional: 0, dependent unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1566, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 718 TransitionsBefore, 718 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1456, independent: 1404, independent conditional: 1404, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1456, independent: 1404, independent conditional: 1404, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1820, independent: 1404, independent conditional: 260, independent unconditional: 1144, dependent: 416, dependent conditional: 0, dependent unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1820, independent: 1404, independent conditional: 260, independent unconditional: 1144, dependent: 416, dependent conditional: 0, dependent unconditional: 416, 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: 1820, independent: 1404, independent conditional: 260, independent unconditional: 1144, dependent: 416, dependent conditional: 0, dependent unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1560, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 734 TransitionsBefore, 734 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 560, independent: 504, independent conditional: 504, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 560, independent: 504, independent conditional: 504, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 952, independent: 504, independent conditional: 112, independent unconditional: 392, dependent: 448, dependent conditional: 0, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 952, independent: 504, independent conditional: 112, independent unconditional: 392, dependent: 448, dependent conditional: 0, dependent unconditional: 448, 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: 952, independent: 504, independent conditional: 112, independent unconditional: 392, dependent: 448, dependent conditional: 0, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 840, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 720 TransitionsBefore, 720 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 728, independent: 672, independent conditional: 672, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 728, independent: 672, independent conditional: 672, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1120, independent: 672, independent conditional: 112, independent unconditional: 560, dependent: 448, dependent conditional: 0, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1120, independent: 672, independent conditional: 112, independent unconditional: 560, dependent: 448, dependent conditional: 0, dependent unconditional: 448, 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: 1120, independent: 672, independent conditional: 112, independent unconditional: 560, dependent: 448, dependent conditional: 0, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1008, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 584 TransitionsBefore, 584 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1144, independent: 792, independent conditional: 220, independent unconditional: 572, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1144, independent: 792, independent conditional: 220, independent unconditional: 572, dependent: 352, dependent conditional: 0, dependent unconditional: 352, 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: 1144, independent: 792, independent conditional: 220, independent unconditional: 572, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 924, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 80 PlacesBefore, 80 PlacesAfterwards, 182 TransitionsBefore, 182 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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.8s, 85 PlacesBefore, 84 PlacesAfterwards, 267 TransitionsBefore, 266 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 93 PlacesBefore, 92 PlacesAfterwards, 503 TransitionsBefore, 502 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 1127 TransitionsBefore, 1127 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 103 PlacesBefore, 103 PlacesAfterwards, 1252 TransitionsBefore, 1252 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 112 PlacesBefore, 112 PlacesAfterwards, 1322 TransitionsBefore, 1322 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 118 PlacesBefore, 118 PlacesAfterwards, 1284 TransitionsBefore, 1284 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 127 PlacesBefore, 127 PlacesAfterwards, 1248 TransitionsBefore, 1248 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 136 PlacesBefore, 136 PlacesAfterwards, 1570 TransitionsBefore, 1570 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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: 12.0s, 150 PlacesBefore, 149 PlacesAfterwards, 1525 TransitionsBefore, 1524 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 152 PlacesBefore, 152 PlacesAfterwards, 2217 TransitionsBefore, 2217 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 153 PlacesBefore, 153 PlacesAfterwards, 1903 TransitionsBefore, 1903 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 112 PlacesBefore, 112 PlacesAfterwards, 1322 TransitionsBefore, 1322 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 119 PlacesBefore, 119 PlacesAfterwards, 1874 TransitionsBefore, 1874 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 131 PlacesBefore, 130 PlacesAfterwards, 3177 TransitionsBefore, 3176 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 145 PlacesBefore, 145 PlacesAfterwards, 3747 TransitionsBefore, 3747 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 184 PlacesBefore, 179 PlacesAfterwards, 5803 TransitionsBefore, 5799 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 198 PlacesBefore, 198 PlacesAfterwards, 7419 TransitionsBefore, 7419 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 208 PlacesBefore, 208 PlacesAfterwards, 8010 TransitionsBefore, 8010 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 220 PlacesBefore, 220 PlacesAfterwards, 8184 TransitionsBefore, 8184 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 232 PlacesBefore, 232 PlacesAfterwards, 8210 TransitionsBefore, 8210 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 950412 conditions, 19973 events (14245/19972 cut-off events. For 635959/635959 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 124230 event pairs, 9 based on Foata normal form. 0/16651 useless extension candidates. Maximal degree in co-relation 559761. Up to 19973 conditions per place.). - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 950412 conditions, 19973 events (14245/19972 cut-off events. For 635959/635959 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 124230 event pairs, 9 based on Foata normal form. 0/16651 useless extension candidates. Maximal degree in co-relation 559761. Up to 19973 conditions per place.). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 950412 conditions, 19973 events (14245/19972 cut-off events. For 635959/635959 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 124230 event pairs, 9 based on Foata normal form. 0/16651 useless extension candidates. Maximal degree in co-relation 559761. Up to 19973 conditions per place.). - TimeoutResultAtElement [Line: 122]: 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 (11states, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 950412 conditions, 19973 events (14245/19972 cut-off events. For 635959/635959 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 124230 event pairs, 9 based on Foata normal form. 0/16651 useless extension candidates. Maximal degree in co-relation 559761. Up to 19973 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 341 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: 794.9s, OverallIterations: 48, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 695.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 633 mSolverCounterUnknown, 6661 SdHoareTripleChecker+Valid, 27.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6661 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 25.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 283 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21662 IncrementalHoareTripleChecker+Invalid, 22578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 283 mSolverCounterUnsat, 4 mSDtfsCounter, 21662 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 255 SyntacticMatches, 5 SemanticMatches, 564 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4008 ImplicationChecksByTransitivity, 39.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780644occurred in iteration=47, InterpolantAutomatonStates: 412, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 31.6s InterpolantComputationTime, 1189 NumberOfCodeBlocks, 1189 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1290 ConstructedInterpolants, 52 QuantifiedInterpolants, 33152 SizeOfPredicates, 200 NumberOfNonLiveVariables, 2106 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 62 InterpolantComputations, 45 PerfectInterpolantSequences, 22/43 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