Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420400522.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is LeafsetExtension-PT-S64C2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420400522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679525029222

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:43:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:43:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:43:51] [INFO ] Load time of PNML (sax parser for PT used): 511 ms
[2023-03-22 22:43:51] [INFO ] Transformed 21462 places.
[2023-03-22 22:43:51] [INFO ] Transformed 21129 transitions.
[2023-03-22 22:43:51] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 652 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 185 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4229 places and 0 transitions.
Iterating post reduction 0 with 4229 rules applied. Total rules applied 4229 place count 17233 transition count 21129
Applied a total of 4229 rules in 300 ms. Remains 17233 /21462 variables (removed 4229) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 22:43:53] [INFO ] Computed 198 place invariants in 1766 ms
[2023-03-22 22:43:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 22:43:55] [INFO ] Implicit Places using invariants in 3650 ms returned []
Implicit Place search using SMT only with invariants took 3677 ms to find 0 implicit places.
[2023-03-22 22:43:55] [INFO ] Invariant cache hit.
[2023-03-22 22:43:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 22:43:56] [INFO ] Dead Transitions using invariants and state equation in 1460 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17233/21462 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5448 ms. Remains : 17233/21462 places, 21129/21129 transitions.
Support contains 185 out of 17233 places after structural reductions.
[2023-03-22 22:43:58] [INFO ] Flatten gal took : 850 ms
[2023-03-22 22:43:58] [INFO ] Flatten gal took : 557 ms
[2023-03-22 22:43:59] [INFO ] Input system was already deterministic with 21129 transitions.
Incomplete random walk after 10000 steps, including 545 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 93) seen :41
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Running SMT prover for 40 properties.
[2023-03-22 22:44:00] [INFO ] Invariant cache hit.
[2023-03-22 22:44:10] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 367 ms returned sat
[2023-03-22 22:44:25] [INFO ] After 7036ms SMT Verify possible using state equation in real domain returned unsat :0 sat :28 real:11
[2023-03-22 22:44:25] [INFO ] After 7068ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :28 real:11
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 22:44:25] [INFO ] After 25053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :28 real:11
[2023-03-22 22:44:35] [INFO ] [Nat]Absence check using 0 positive and 198 generalized place invariants in 356 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 22:44:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:44:51] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28 real:11
Fused 40 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 84 out of 17233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 38156 edges and 17233 vertex of which 3169 are kept as prefixes of interest. Removing 14064 places using SCC suffix rule.32 ms
Discarding 14064 places :
Also discarding 10439 output transitions
Drop transitions removed 10439 transitions
Drop transitions removed 3528 transitions
Reduce isomorphic transitions removed 3528 transitions.
Drop transitions removed 972 transitions
Trivial Post-agglo rules discarded 972 transitions
Performed 972 trivial Post agglomeration. Transition count delta: 972
Iterating post reduction 0 with 4500 rules applied. Total rules applied 4501 place count 3169 transition count 6190
Reduce places removed 974 places and 0 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 991 rules applied. Total rules applied 5492 place count 2195 transition count 6173
Reduce places removed 17 places and 0 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 2 with 81 rules applied. Total rules applied 5573 place count 2178 transition count 6109
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 5637 place count 2114 transition count 6109
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 5637 place count 2114 transition count 6076
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 5703 place count 2081 transition count 6076
Discarding 660 places :
Symmetric choice reduction at 4 with 660 rule applications. Total rules 6363 place count 1421 transition count 5416
Iterating global reduction 4 with 660 rules applied. Total rules applied 7023 place count 1421 transition count 5416
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 7039 place count 1421 transition count 5400
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 7055 place count 1405 transition count 5400
Partial Free-agglomeration rule applied 406 times.
Drop transitions removed 406 transitions
Iterating global reduction 5 with 406 rules applied. Total rules applied 7461 place count 1405 transition count 5400
Applied a total of 7461 rules in 1407 ms. Remains 1405 /17233 variables (removed 15828) and now considering 5400/21129 (removed 15729) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1408 ms. Remains : 1405/17233 places, 5400/21129 transitions.
Incomplete random walk after 10000 steps, including 1242 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 40) seen :27
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-22 22:44:53] [INFO ] Flow matrix only has 2376 transitions (discarded 3024 similar events)
// Phase 1: matrix 2376 rows 1405 cols
[2023-03-22 22:44:53] [INFO ] Computed 22 place invariants in 23 ms
[2023-03-22 22:44:53] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 6 ms returned sat
[2023-03-22 22:44:55] [INFO ] After 1261ms SMT Verify possible using state equation in real domain returned unsat :1 sat :11
[2023-03-22 22:44:56] [INFO ] After 2561ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 732 ms.
[2023-03-22 22:44:57] [INFO ] After 3917ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 34 out of 1405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1405/1405 places, 5400/5400 transitions.
Graph (complete) has 5843 edges and 1405 vertex of which 607 are kept as prefixes of interest. Removing 798 places using SCC suffix rule.1 ms
Discarding 798 places :
Also discarding 66 output transitions
Drop transitions removed 66 transitions
Drop transitions removed 709 transitions
Reduce isomorphic transitions removed 709 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 710 rules applied. Total rules applied 711 place count 607 transition count 4624
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 713 place count 606 transition count 4623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 714 place count 605 transition count 4623
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 750 place count 569 transition count 4587
Iterating global reduction 3 with 36 rules applied. Total rules applied 786 place count 569 transition count 4587
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 815 place count 569 transition count 4587
Applied a total of 815 rules in 197 ms. Remains 569 /1405 variables (removed 836) and now considering 4587/5400 (removed 813) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 569/1405 places, 4587/5400 transitions.
Incomplete random walk after 10000 steps, including 1325 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 22:44:57] [INFO ] Flow matrix only has 820 transitions (discarded 3767 similar events)
// Phase 1: matrix 820 rows 569 cols
[2023-03-22 22:44:57] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-22 22:44:57] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-22 22:44:58] [INFO ] After 382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-22 22:44:58] [INFO ] After 760ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-22 22:44:58] [INFO ] After 1194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 10 ms.
Support contains 28 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 4587/4587 transitions.
Graph (complete) has 2091 edges and 569 vertex of which 531 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 531 transition count 4549
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 530 transition count 4549
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 529 transition count 4548
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 529 transition count 4548
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 529 transition count 4548
Applied a total of 39 rules in 98 ms. Remains 529 /569 variables (removed 40) and now considering 4548/4587 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 529/569 places, 4548/4587 transitions.
Incomplete random walk after 10000 steps, including 1283 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 36686 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36686 steps, saw 12571 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-22 22:45:02] [INFO ] Flow matrix only has 747 transitions (discarded 3801 similar events)
// Phase 1: matrix 747 rows 529 cols
[2023-03-22 22:45:02] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-22 22:45:02] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-22 22:45:02] [INFO ] After 375ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-22 22:45:03] [INFO ] After 712ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-22 22:45:03] [INFO ] After 1119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 9 ms.
Support contains 28 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 4548/4548 transitions.
Applied a total of 0 rules in 39 ms. Remains 529 /529 variables (removed 0) and now considering 4548/4548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 529/529 places, 4548/4548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 4548/4548 transitions.
Applied a total of 0 rules in 40 ms. Remains 529 /529 variables (removed 0) and now considering 4548/4548 (removed 0) transitions.
[2023-03-22 22:45:03] [INFO ] Flow matrix only has 747 transitions (discarded 3801 similar events)
[2023-03-22 22:45:03] [INFO ] Invariant cache hit.
[2023-03-22 22:45:03] [INFO ] Implicit Places using invariants in 438 ms returned [285]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 444 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 528/529 places, 4548/4548 transitions.
Applied a total of 0 rules in 40 ms. Remains 528 /528 variables (removed 0) and now considering 4548/4548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 524 ms. Remains : 528/529 places, 4548/4548 transitions.
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 36658 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36658 steps, saw 12571 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-22 22:45:07] [INFO ] Flow matrix only has 747 transitions (discarded 3801 similar events)
// Phase 1: matrix 747 rows 528 cols
[2023-03-22 22:45:07] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-22 22:45:07] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-22 22:45:07] [INFO ] After 393ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-22 22:45:08] [INFO ] After 734ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 224 ms.
[2023-03-22 22:45:08] [INFO ] After 1146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 7 ms.
Support contains 28 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 4548/4548 transitions.
Applied a total of 0 rules in 38 ms. Remains 528 /528 variables (removed 0) and now considering 4548/4548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 528/528 places, 4548/4548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 4548/4548 transitions.
Applied a total of 0 rules in 38 ms. Remains 528 /528 variables (removed 0) and now considering 4548/4548 (removed 0) transitions.
[2023-03-22 22:45:08] [INFO ] Flow matrix only has 747 transitions (discarded 3801 similar events)
[2023-03-22 22:45:08] [INFO ] Invariant cache hit.
[2023-03-22 22:45:08] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-22 22:45:08] [INFO ] Flow matrix only has 747 transitions (discarded 3801 similar events)
[2023-03-22 22:45:08] [INFO ] Invariant cache hit.
[2023-03-22 22:45:11] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned [6, 9, 12, 15, 20, 23, 59, 61, 64, 67, 70, 73, 76, 115, 154, 157, 160, 163, 166, 204, 206, 209, 212, 215, 218, 221, 229, 232, 235, 272, 274, 277, 280, 283, 286, 289, 292, 295, 298, 301, 340, 343, 346, 349, 352, 391, 394, 397, 400, 439, 442, 449, 485, 487, 490, 493, 496, 499, 502, 505, 508, 515, 518, 521, 524, 527]
Discarding 66 places :
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Implicit Place search using SMT with State Equation took 2565 ms to find 66 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 462/528 places, 4519/4548 transitions.
Graph (complete) has 1338 edges and 462 vertex of which 433 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 0 output transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 433 transition count 4514
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 428 transition count 4514
Discarding 233 places :
Symmetric choice reduction at 0 with 233 rule applications. Total rules 244 place count 195 transition count 4281
Iterating global reduction 0 with 233 rules applied. Total rules applied 477 place count 195 transition count 4281
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 487 place count 190 transition count 4276
Free-agglomeration rule (complex) applied 56 times.
Iterating global reduction 0 with 56 rules applied. Total rules applied 543 place count 190 transition count 4220
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 599 place count 134 transition count 4220
Applied a total of 599 rules in 272 ms. Remains 134 /462 variables (removed 328) and now considering 4220/4519 (removed 299) transitions.
[2023-03-22 22:45:11] [INFO ] Flow matrix only has 384 transitions (discarded 3836 similar events)
// Phase 1: matrix 384 rows 134 cols
[2023-03-22 22:45:11] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-22 22:45:11] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-22 22:45:11] [INFO ] Flow matrix only has 384 transitions (discarded 3836 similar events)
[2023-03-22 22:45:11] [INFO ] Invariant cache hit.
[2023-03-22 22:45:12] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 134/528 places, 4220/4548 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3629 ms. Remains : 134/528 places, 4220/4548 transitions.
Incomplete random walk after 10000 steps, including 1899 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 120236 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{1=1, 2=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 120236 steps, saw 35610 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :5
Running SMT prover for 2 properties.
[2023-03-22 22:45:15] [INFO ] Flow matrix only has 384 transitions (discarded 3836 similar events)
[2023-03-22 22:45:15] [INFO ] Invariant cache hit.
[2023-03-22 22:45:15] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-22 22:45:15] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-22 22:45:15] [INFO ] After 111ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 22:45:15] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 9 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 4220/4220 transitions.
Graph (complete) has 728 edges and 134 vertex of which 97 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Iterating post reduction 0 with 258 rules applied. Total rules applied 259 place count 97 transition count 3935
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 265 place count 97 transition count 3929
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 271 place count 91 transition count 3929
Applied a total of 271 rules in 127 ms. Remains 91 /134 variables (removed 43) and now considering 3929/4220 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 91/134 places, 3929/4220 transitions.
Incomplete random walk after 10000 steps, including 1918 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 39058 steps, run visited all 2 properties in 583 ms. (steps per millisecond=66 )
Probabilistic random walk after 39058 steps, saw 12338 distinct states, run finished after 584 ms. (steps per millisecond=66 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-22 22:45:17] [INFO ] Flatten gal took : 527 ms
[2023-03-22 22:45:17] [INFO ] Flatten gal took : 492 ms
[2023-03-22 22:45:18] [INFO ] Input system was already deterministic with 21129 transitions.
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA LeafsetExtension-PT-S64C2-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 114 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:19] [INFO ] Flatten gal took : 436 ms
[2023-03-22 22:45:19] [INFO ] Flatten gal took : 487 ms
[2023-03-22 22:45:20] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 63 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:21] [INFO ] Flatten gal took : 437 ms
[2023-03-22 22:45:21] [INFO ] Flatten gal took : 480 ms
[2023-03-22 22:45:22] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 60 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:23] [INFO ] Flatten gal took : 429 ms
[2023-03-22 22:45:23] [INFO ] Flatten gal took : 480 ms
[2023-03-22 22:45:24] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.55 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8092 transitions
Trivial Post-agglo rules discarded 8092 transitions
Performed 8092 trivial Post agglomeration. Transition count delta: 8092
Iterating post reduction 0 with 8092 rules applied. Total rules applied 8093 place count 17231 transition count 13035
Reduce places removed 8092 places and 0 transitions.
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Iterating post reduction 1 with 8316 rules applied. Total rules applied 16409 place count 9139 transition count 12811
Reduce places removed 224 places and 0 transitions.
Iterating post reduction 2 with 224 rules applied. Total rules applied 16633 place count 8915 transition count 12811
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16633 place count 8915 transition count 12682
Deduced a syphon composed of 129 places in 4 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16891 place count 8786 transition count 12682
Discarding 4027 places :
Symmetric choice reduction at 3 with 4027 rule applications. Total rules 20918 place count 4759 transition count 8655
Iterating global reduction 3 with 4027 rules applied. Total rules applied 24945 place count 4759 transition count 8655
Applied a total of 24945 rules in 2586 ms. Remains 4759 /17233 variables (removed 12474) and now considering 8655/21129 (removed 12474) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2587 ms. Remains : 4759/17233 places, 8655/21129 transitions.
[2023-03-22 22:45:27] [INFO ] Flatten gal took : 201 ms
[2023-03-22 22:45:27] [INFO ] Flatten gal took : 219 ms
[2023-03-22 22:45:28] [INFO ] Input system was already deterministic with 8655 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 60 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:28] [INFO ] Flatten gal took : 434 ms
[2023-03-22 22:45:29] [INFO ] Flatten gal took : 477 ms
[2023-03-22 22:45:29] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 60 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:30] [INFO ] Flatten gal took : 440 ms
[2023-03-22 22:45:31] [INFO ] Flatten gal took : 478 ms
[2023-03-22 22:45:31] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 58 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:32] [INFO ] Flatten gal took : 432 ms
[2023-03-22 22:45:32] [INFO ] Flatten gal took : 504 ms
[2023-03-22 22:45:33] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 60 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:34] [INFO ] Flatten gal took : 428 ms
[2023-03-22 22:45:34] [INFO ] Flatten gal took : 482 ms
[2023-03-22 22:45:35] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8286 transitions
Trivial Post-agglo rules discarded 8286 transitions
Performed 8286 trivial Post agglomeration. Transition count delta: 8286
Iterating post reduction 0 with 8286 rules applied. Total rules applied 8287 place count 17231 transition count 12841
Reduce places removed 8286 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16605 place count 8945 transition count 12809
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16637 place count 8913 transition count 12809
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16637 place count 8913 transition count 12680
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16895 place count 8784 transition count 12680
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20923 place count 4756 transition count 8652
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24951 place count 4756 transition count 8652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24951 place count 4756 transition count 8651
Deduced a syphon composed of 1 places in 28 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24953 place count 4755 transition count 8651
Applied a total of 24953 rules in 2157 ms. Remains 4755 /17233 variables (removed 12478) and now considering 8651/21129 (removed 12478) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2157 ms. Remains : 4755/17233 places, 8651/21129 transitions.
[2023-03-22 22:45:38] [INFO ] Flatten gal took : 194 ms
[2023-03-22 22:45:38] [INFO ] Flatten gal took : 216 ms
[2023-03-22 22:45:38] [INFO ] Input system was already deterministic with 8651 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 58 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:39] [INFO ] Flatten gal took : 444 ms
[2023-03-22 22:45:39] [INFO ] Flatten gal took : 465 ms
[2023-03-22 22:45:40] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 59 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:41] [INFO ] Flatten gal took : 435 ms
[2023-03-22 22:45:41] [INFO ] Flatten gal took : 477 ms
[2023-03-22 22:45:42] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8319 transitions
Trivial Post-agglo rules discarded 8319 transitions
Performed 8319 trivial Post agglomeration. Transition count delta: 8319
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8320 place count 17231 transition count 12808
Reduce places removed 8319 places and 0 transitions.
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12678
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16899 place count 8782 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 2 with 4029 rule applications. Total rules 20928 place count 4753 transition count 8649
Iterating global reduction 2 with 4029 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24957 place count 4753 transition count 8648
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24959 place count 4752 transition count 8648
Applied a total of 24959 rules in 2039 ms. Remains 4752 /17233 variables (removed 12481) and now considering 8648/21129 (removed 12481) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2039 ms. Remains : 4752/17233 places, 8648/21129 transitions.
[2023-03-22 22:45:44] [INFO ] Flatten gal took : 192 ms
[2023-03-22 22:45:44] [INFO ] Flatten gal took : 214 ms
[2023-03-22 22:45:45] [INFO ] Input system was already deterministic with 8648 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8189 transitions
Trivial Post-agglo rules discarded 8189 transitions
Performed 8189 trivial Post agglomeration. Transition count delta: 8189
Iterating post reduction 0 with 8189 rules applied. Total rules applied 8190 place count 17231 transition count 12938
Reduce places removed 8189 places and 0 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 1 with 8317 rules applied. Total rules applied 16507 place count 9042 transition count 12810
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 16635 place count 8914 transition count 12810
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16635 place count 8914 transition count 12681
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16893 place count 8785 transition count 12681
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20921 place count 4757 transition count 8653
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24949 place count 4757 transition count 8653
Applied a total of 24949 rules in 2241 ms. Remains 4757 /17233 variables (removed 12476) and now considering 8653/21129 (removed 12476) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2242 ms. Remains : 4757/17233 places, 8653/21129 transitions.
[2023-03-22 22:45:47] [INFO ] Flatten gal took : 194 ms
[2023-03-22 22:45:47] [INFO ] Flatten gal took : 218 ms
[2023-03-22 22:45:48] [INFO ] Input system was already deterministic with 8653 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 61 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:48] [INFO ] Flatten gal took : 437 ms
[2023-03-22 22:45:49] [INFO ] Flatten gal took : 481 ms
[2023-03-22 22:45:50] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 57 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-22 22:45:50] [INFO ] Flatten gal took : 432 ms
[2023-03-22 22:45:51] [INFO ] Flatten gal took : 520 ms
[2023-03-22 22:45:52] [INFO ] Input system was already deterministic with 21129 transitions.
[2023-03-22 22:45:52] [INFO ] Flatten gal took : 466 ms
[2023-03-22 22:45:53] [INFO ] Flatten gal took : 485 ms
[2023-03-22 22:45:53] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2023-03-22 22:45:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17233 places, 21129 transitions and 63509 arcs took 78 ms.
Total runtime 122707 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 17233 NrTr: 21129 NrArc: 63509)

parse formulas
formulas created successfully
place and transition orderings generation:0m36.951sec

net check time: 0m 0.011sec

init dd package: 0m 2.578sec


before gc: list nodes free: 1669991

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870408

before gc: list nodes free: 1639696

after gc: idd nodes used:15999, unused:63984001; list nodes free:257837571
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6585272 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16071380 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 1.198sec

224007 338290 516517

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S64C2"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is LeafsetExtension-PT-S64C2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420400522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C2.tgz
mv LeafsetExtension-PT-S64C2 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;