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.r394-oct2-167903717500137.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-040B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 675K Mar 5 18:23 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 ShieldIIPs-PT-040B-CTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-040B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679493364409

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:56:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:56:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:56:07] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2023-03-22 13:56:07] [INFO ] Transformed 2403 places.
[2023-03-22 13:56:07] [INFO ] Transformed 2363 transitions.
[2023-03-22 13:56:07] [INFO ] Found NUPN structural information;
[2023-03-22 13:56:07] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 132 out of 2403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Discarding 249 places :
Symmetric choice reduction at 0 with 249 rule applications. Total rules 249 place count 2154 transition count 2114
Iterating global reduction 0 with 249 rules applied. Total rules applied 498 place count 2154 transition count 2114
Applied a total of 498 rules in 475 ms. Remains 2154 /2403 variables (removed 249) and now considering 2114/2363 (removed 249) transitions.
// Phase 1: matrix 2114 rows 2154 cols
[2023-03-22 13:56:08] [INFO ] Computed 361 place invariants in 34 ms
[2023-03-22 13:56:10] [INFO ] Implicit Places using invariants in 2013 ms returned []
[2023-03-22 13:56:10] [INFO ] Invariant cache hit.
[2023-03-22 13:56:14] [INFO ] Implicit Places using invariants and state equation in 3940 ms returned []
Implicit Place search using SMT with State Equation took 5990 ms to find 0 implicit places.
[2023-03-22 13:56:14] [INFO ] Invariant cache hit.
[2023-03-22 13:56:16] [INFO ] Dead Transitions using invariants and state equation in 2042 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2154/2403 places, 2114/2363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8512 ms. Remains : 2154/2403 places, 2114/2363 transitions.
Support contains 132 out of 2154 places after structural reductions.
[2023-03-22 13:56:16] [INFO ] Flatten gal took : 208 ms
[2023-03-22 13:56:17] [INFO ] Flatten gal took : 105 ms
[2023-03-22 13:56:17] [INFO ] Input system was already deterministic with 2114 transitions.
Support contains 125 out of 2154 places (down from 132) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=15 ) properties (out of 68) seen :47
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2023-03-22 13:56:18] [INFO ] Invariant cache hit.
[2023-03-22 13:56:20] [INFO ] [Real]Absence check using 361 positive place invariants in 201 ms returned sat
[2023-03-22 13:56:20] [INFO ] After 1995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-22 13:56:21] [INFO ] [Nat]Absence check using 361 positive place invariants in 218 ms returned sat
[2023-03-22 13:56:27] [INFO ] After 4361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-22 13:56:28] [INFO ] Deduced a trap composed of 22 places in 873 ms of which 18 ms to minimize.
[2023-03-22 13:56:30] [INFO ] Deduced a trap composed of 19 places in 1339 ms of which 2 ms to minimize.
[2023-03-22 13:56:30] [INFO ] Deduced a trap composed of 28 places in 786 ms of which 2 ms to minimize.
[2023-03-22 13:56:31] [INFO ] Deduced a trap composed of 26 places in 592 ms of which 20 ms to minimize.
[2023-03-22 13:56:32] [INFO ] Deduced a trap composed of 24 places in 651 ms of which 7 ms to minimize.
[2023-03-22 13:56:33] [INFO ] Deduced a trap composed of 28 places in 811 ms of which 1 ms to minimize.
[2023-03-22 13:56:33] [INFO ] Deduced a trap composed of 15 places in 505 ms of which 2 ms to minimize.
[2023-03-22 13:56:34] [INFO ] Deduced a trap composed of 34 places in 660 ms of which 2 ms to minimize.
[2023-03-22 13:56:35] [INFO ] Deduced a trap composed of 20 places in 619 ms of which 2 ms to minimize.
[2023-03-22 13:56:35] [INFO ] Deduced a trap composed of 19 places in 615 ms of which 1 ms to minimize.
[2023-03-22 13:56:36] [INFO ] Deduced a trap composed of 16 places in 559 ms of which 2 ms to minimize.
[2023-03-22 13:56:37] [INFO ] Deduced a trap composed of 22 places in 942 ms of which 13 ms to minimize.
[2023-03-22 13:56:38] [INFO ] Deduced a trap composed of 25 places in 523 ms of which 1 ms to minimize.
[2023-03-22 13:56:38] [INFO ] Deduced a trap composed of 22 places in 524 ms of which 1 ms to minimize.
[2023-03-22 13:56:39] [INFO ] Deduced a trap composed of 34 places in 428 ms of which 1 ms to minimize.
[2023-03-22 13:56:39] [INFO ] Deduced a trap composed of 17 places in 485 ms of which 2 ms to minimize.
[2023-03-22 13:56:40] [INFO ] Deduced a trap composed of 27 places in 513 ms of which 1 ms to minimize.
[2023-03-22 13:56:41] [INFO ] Deduced a trap composed of 29 places in 436 ms of which 1 ms to minimize.
[2023-03-22 13:56:41] [INFO ] Deduced a trap composed of 22 places in 445 ms of which 2 ms to minimize.
[2023-03-22 13:56:42] [INFO ] Deduced a trap composed of 31 places in 419 ms of which 1 ms to minimize.
[2023-03-22 13:56:42] [INFO ] Deduced a trap composed of 30 places in 535 ms of which 2 ms to minimize.
[2023-03-22 13:56:43] [INFO ] Deduced a trap composed of 25 places in 492 ms of which 2 ms to minimize.
[2023-03-22 13:56:44] [INFO ] Deduced a trap composed of 45 places in 549 ms of which 1 ms to minimize.
[2023-03-22 13:56:44] [INFO ] Deduced a trap composed of 32 places in 576 ms of which 2 ms to minimize.
[2023-03-22 13:56:45] [INFO ] Deduced a trap composed of 37 places in 613 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 13:56:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 13:56:45] [INFO ] After 25307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Parikh walk visited 1 properties in 2578 ms.
Support contains 46 out of 2154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 2154 transition count 1925
Reduce places removed 189 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 192 rules applied. Total rules applied 381 place count 1965 transition count 1922
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 384 place count 1962 transition count 1922
Performed 195 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 195 Pre rules applied. Total rules applied 384 place count 1962 transition count 1727
Deduced a syphon composed of 195 places in 3 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 3 with 390 rules applied. Total rules applied 774 place count 1767 transition count 1727
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 792 place count 1749 transition count 1709
Iterating global reduction 3 with 18 rules applied. Total rules applied 810 place count 1749 transition count 1709
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 810 place count 1749 transition count 1699
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 830 place count 1739 transition count 1699
Performed 688 Post agglomeration using F-continuation condition.Transition count delta: 688
Deduced a syphon composed of 688 places in 7 ms
Reduce places removed 688 places and 0 transitions.
Iterating global reduction 3 with 1376 rules applied. Total rules applied 2206 place count 1051 transition count 1011
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions removed 267 transitions
Iterating global reduction 3 with 267 rules applied. Total rules applied 2473 place count 1051 transition count 1011
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2474 place count 1050 transition count 1010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2475 place count 1049 transition count 1010
Applied a total of 2475 rules in 624 ms. Remains 1049 /2154 variables (removed 1105) and now considering 1010/2114 (removed 1104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 625 ms. Remains : 1049/2154 places, 1010/2114 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1010 rows 1049 cols
[2023-03-22 13:56:49] [INFO ] Computed 360 place invariants in 54 ms
[2023-03-22 13:56:50] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 13:56:50] [INFO ] [Nat]Absence check using 355 positive place invariants in 114 ms returned sat
[2023-03-22 13:56:50] [INFO ] [Nat]Absence check using 355 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 13:56:51] [INFO ] After 844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 13:56:51] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-22 13:56:51] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2023-03-22 13:56:51] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 14 ms to minimize.
[2023-03-22 13:56:52] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 1 ms to minimize.
[2023-03-22 13:56:52] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2023-03-22 13:56:52] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2023-03-22 13:56:52] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-22 13:56:53] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2023-03-22 13:56:53] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 18 ms to minimize.
[2023-03-22 13:56:53] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-22 13:56:53] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 0 ms to minimize.
[2023-03-22 13:56:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2478 ms
[2023-03-22 13:56:54] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2023-03-22 13:56:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 13:56:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2023-03-22 13:56:54] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 1 ms to minimize.
[2023-03-22 13:56:55] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 10 ms to minimize.
[2023-03-22 13:56:55] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2023-03-22 13:56:55] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2023-03-22 13:56:55] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 13 ms to minimize.
[2023-03-22 13:56:55] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 0 ms to minimize.
[2023-03-22 13:56:56] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2023-03-22 13:56:56] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2023-03-22 13:56:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1817 ms
[2023-03-22 13:56:56] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2023-03-22 13:56:57] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2023-03-22 13:56:57] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 0 ms to minimize.
[2023-03-22 13:56:57] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2023-03-22 13:56:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1043 ms
[2023-03-22 13:56:57] [INFO ] After 6991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 412 ms.
[2023-03-22 13:56:58] [INFO ] After 8001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 110 ms.
Support contains 20 out of 1049 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1049/1049 places, 1010/1010 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1049 transition count 1008
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1047 transition count 1008
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 1047 transition count 1005
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1044 transition count 1005
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 48 place count 1025 transition count 986
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 57 place count 1025 transition count 986
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 1021 transition count 982
Applied a total of 61 rules in 249 ms. Remains 1021 /1049 variables (removed 28) and now considering 982/1010 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 1021/1049 places, 982/1010 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 982 rows 1021 cols
[2023-03-22 13:56:59] [INFO ] Computed 360 place invariants in 20 ms
[2023-03-22 13:56:59] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 13:56:59] [INFO ] [Nat]Absence check using 357 positive place invariants in 73 ms returned sat
[2023-03-22 13:56:59] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-22 13:57:00] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 13:57:00] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2023-03-22 13:57:00] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 1 ms to minimize.
[2023-03-22 13:57:01] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 0 ms to minimize.
[2023-03-22 13:57:01] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-22 13:57:01] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 13 ms to minimize.
[2023-03-22 13:57:01] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-22 13:57:01] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2023-03-22 13:57:02] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2023-03-22 13:57:02] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 0 ms to minimize.
[2023-03-22 13:57:02] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 1 ms to minimize.
[2023-03-22 13:57:02] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-22 13:57:03] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 14 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 5 places in 455 ms of which 3 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 2 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-22 13:57:04] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 12 ms to minimize.
[2023-03-22 13:57:05] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 14 ms to minimize.
[2023-03-22 13:57:05] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-22 13:57:05] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-22 13:57:05] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 0 ms to minimize.
[2023-03-22 13:57:06] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2023-03-22 13:57:06] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2023-03-22 13:57:06] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 1 ms to minimize.
[2023-03-22 13:57:06] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 1 ms to minimize.
[2023-03-22 13:57:07] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2023-03-22 13:57:07] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-22 13:57:07] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2023-03-22 13:57:07] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-22 13:57:08] [INFO ] Deduced a trap composed of 14 places in 386 ms of which 0 ms to minimize.
[2023-03-22 13:57:08] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-22 13:57:08] [INFO ] Deduced a trap composed of 11 places in 473 ms of which 1 ms to minimize.
[2023-03-22 13:57:08] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2023-03-22 13:57:08] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 8771 ms
[2023-03-22 13:57:09] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 0 ms to minimize.
[2023-03-22 13:57:09] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2023-03-22 13:57:09] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 1 ms to minimize.
[2023-03-22 13:57:10] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 0 ms to minimize.
[2023-03-22 13:57:10] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-22 13:57:10] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 0 ms to minimize.
[2023-03-22 13:57:10] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 1 ms to minimize.
[2023-03-22 13:57:11] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2023-03-22 13:57:11] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2023-03-22 13:57:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2144 ms
[2023-03-22 13:57:11] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-22 13:57:11] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
[2023-03-22 13:57:11] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 0 ms to minimize.
[2023-03-22 13:57:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 527 ms
[2023-03-22 13:57:11] [INFO ] After 12397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 235 ms.
[2023-03-22 13:57:12] [INFO ] After 12958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 108 ms.
Support contains 15 out of 1021 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1021/1021 places, 982/982 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1021 transition count 980
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1019 transition count 980
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1019 transition count 979
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 6 place count 1018 transition count 979
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 1016 transition count 977
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 1016 transition count 977
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 1014 transition count 975
Applied a total of 13 rules in 184 ms. Remains 1014 /1021 variables (removed 7) and now considering 975/982 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 1014/1021 places, 975/982 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 137532 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 137532 steps, saw 125891 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 975 rows 1014 cols
[2023-03-22 13:57:16] [INFO ] Computed 360 place invariants in 15 ms
[2023-03-22 13:57:16] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:57:16] [INFO ] [Nat]Absence check using 358 positive place invariants in 142 ms returned sat
[2023-03-22 13:57:16] [INFO ] [Nat]Absence check using 358 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-22 13:57:17] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:57:17] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2023-03-22 13:57:17] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2023-03-22 13:57:17] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-22 13:57:17] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:57:17] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-22 13:57:18] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2023-03-22 13:57:18] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-22 13:57:18] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 1 ms to minimize.
[2023-03-22 13:57:19] [INFO ] Deduced a trap composed of 17 places in 577 ms of which 0 ms to minimize.
[2023-03-22 13:57:19] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-22 13:57:19] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-22 13:57:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2491 ms
[2023-03-22 13:57:19] [INFO ] After 2976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-22 13:57:19] [INFO ] After 3478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 1014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1014/1014 places, 975/975 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1014 transition count 973
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1012 transition count 973
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1012 transition count 972
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 6 place count 1011 transition count 972
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 1007 transition count 968
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 1007 transition count 968
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 1005 transition count 966
Applied a total of 18 rules in 124 ms. Remains 1005 /1014 variables (removed 9) and now considering 966/975 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 1005/1014 places, 966/975 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 178419 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178419 steps, saw 157728 distinct states, run finished after 3003 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 966 rows 1005 cols
[2023-03-22 13:57:22] [INFO ] Computed 360 place invariants in 6 ms
[2023-03-22 13:57:23] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:57:23] [INFO ] [Nat]Absence check using 359 positive place invariants in 105 ms returned sat
[2023-03-22 13:57:23] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 13:57:24] [INFO ] After 651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:57:24] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2023-03-22 13:57:24] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2023-03-22 13:57:24] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-22 13:57:24] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-22 13:57:24] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2023-03-22 13:57:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 831 ms
[2023-03-22 13:57:24] [INFO ] After 1533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-22 13:57:25] [INFO ] After 1858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 966/966 transitions.
Applied a total of 0 rules in 27 ms. Remains 1005 /1005 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1005/1005 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 966/966 transitions.
Applied a total of 0 rules in 23 ms. Remains 1005 /1005 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-03-22 13:57:25] [INFO ] Invariant cache hit.
[2023-03-22 13:57:25] [INFO ] Implicit Places using invariants in 784 ms returned []
[2023-03-22 13:57:25] [INFO ] Invariant cache hit.
[2023-03-22 13:57:27] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 2442 ms to find 0 implicit places.
[2023-03-22 13:57:27] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-22 13:57:27] [INFO ] Invariant cache hit.
[2023-03-22 13:57:28] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3126 ms. Remains : 1005/1005 places, 966/966 transitions.
Applied a total of 0 rules in 31 ms. Remains 1005 /1005 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 13:57:28] [INFO ] Invariant cache hit.
[2023-03-22 13:57:28] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:57:28] [INFO ] [Nat]Absence check using 359 positive place invariants in 48 ms returned sat
[2023-03-22 13:57:28] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 19 ms returned sat
[2023-03-22 13:57:29] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:57:29] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-22 13:57:29] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-22 13:57:29] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-22 13:57:29] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2023-03-22 13:57:30] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-22 13:57:30] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2023-03-22 13:57:30] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:57:30] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 41 ms to minimize.
[2023-03-22 13:57:30] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 13:57:30] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-03-22 13:57:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1720 ms
[2023-03-22 13:57:30] [INFO ] After 2278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-22 13:57:30] [INFO ] After 2591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:57:31] [INFO ] Flatten gal took : 113 ms
[2023-03-22 13:57:31] [INFO ] Flatten gal took : 145 ms
[2023-03-22 13:57:31] [INFO ] Input system was already deterministic with 2114 transitions.
Computed a total of 496 stabilizing places and 496 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2123 transition count 2083
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2123 transition count 2083
Applied a total of 62 rules in 179 ms. Remains 2123 /2154 variables (removed 31) and now considering 2083/2114 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 2123/2154 places, 2083/2114 transitions.
[2023-03-22 13:57:31] [INFO ] Flatten gal took : 71 ms
[2023-03-22 13:57:31] [INFO ] Flatten gal took : 75 ms
[2023-03-22 13:57:32] [INFO ] Input system was already deterministic with 2083 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2127 transition count 2087
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2127 transition count 2087
Applied a total of 54 rules in 206 ms. Remains 2127 /2154 variables (removed 27) and now considering 2087/2114 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 2127/2154 places, 2087/2114 transitions.
[2023-03-22 13:57:32] [INFO ] Flatten gal took : 62 ms
[2023-03-22 13:57:32] [INFO ] Flatten gal took : 57 ms
[2023-03-22 13:57:32] [INFO ] Input system was already deterministic with 2087 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2123 transition count 2083
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2123 transition count 2083
Applied a total of 62 rules in 161 ms. Remains 2123 /2154 variables (removed 31) and now considering 2083/2114 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 2123/2154 places, 2083/2114 transitions.
[2023-03-22 13:57:32] [INFO ] Flatten gal took : 62 ms
[2023-03-22 13:57:32] [INFO ] Flatten gal took : 62 ms
[2023-03-22 13:57:33] [INFO ] Input system was already deterministic with 2083 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 2126 transition count 2086
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 2126 transition count 2086
Applied a total of 56 rules in 163 ms. Remains 2126 /2154 variables (removed 28) and now considering 2086/2114 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 2126/2154 places, 2086/2114 transitions.
[2023-03-22 13:57:33] [INFO ] Flatten gal took : 50 ms
[2023-03-22 13:57:33] [INFO ] Flatten gal took : 76 ms
[2023-03-22 13:57:33] [INFO ] Input system was already deterministic with 2086 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2153 transition count 1914
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1954 transition count 1914
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 398 place count 1954 transition count 1714
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 798 place count 1754 transition count 1714
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 828 place count 1724 transition count 1684
Iterating global reduction 2 with 30 rules applied. Total rules applied 858 place count 1724 transition count 1684
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 858 place count 1724 transition count 1672
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 882 place count 1712 transition count 1672
Performed 705 Post agglomeration using F-continuation condition.Transition count delta: 705
Deduced a syphon composed of 705 places in 2 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 2 with 1410 rules applied. Total rules applied 2292 place count 1007 transition count 967
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2294 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2295 place count 1004 transition count 965
Applied a total of 2295 rules in 383 ms. Remains 1004 /2154 variables (removed 1150) and now considering 965/2114 (removed 1149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 383 ms. Remains : 1004/2154 places, 965/2114 transitions.
[2023-03-22 13:57:33] [INFO ] Flatten gal took : 29 ms
[2023-03-22 13:57:34] [INFO ] Flatten gal took : 30 ms
[2023-03-22 13:57:34] [INFO ] Input system was already deterministic with 965 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2123 transition count 2083
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2123 transition count 2083
Applied a total of 62 rules in 150 ms. Remains 2123 /2154 variables (removed 31) and now considering 2083/2114 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 2123/2154 places, 2083/2114 transitions.
[2023-03-22 13:57:34] [INFO ] Flatten gal took : 48 ms
[2023-03-22 13:57:34] [INFO ] Flatten gal took : 52 ms
[2023-03-22 13:57:34] [INFO ] Input system was already deterministic with 2083 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2153 transition count 1914
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1954 transition count 1914
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 398 place count 1954 transition count 1714
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 798 place count 1754 transition count 1714
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 828 place count 1724 transition count 1684
Iterating global reduction 2 with 30 rules applied. Total rules applied 858 place count 1724 transition count 1684
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 858 place count 1724 transition count 1672
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 882 place count 1712 transition count 1672
Performed 706 Post agglomeration using F-continuation condition.Transition count delta: 706
Deduced a syphon composed of 706 places in 3 ms
Reduce places removed 706 places and 0 transitions.
Iterating global reduction 2 with 1412 rules applied. Total rules applied 2294 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2296 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2297 place count 1003 transition count 964
Applied a total of 2297 rules in 368 ms. Remains 1003 /2154 variables (removed 1151) and now considering 964/2114 (removed 1150) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 368 ms. Remains : 1003/2154 places, 964/2114 transitions.
[2023-03-22 13:57:34] [INFO ] Flatten gal took : 29 ms
[2023-03-22 13:57:34] [INFO ] Flatten gal took : 31 ms
[2023-03-22 13:57:35] [INFO ] Input system was already deterministic with 964 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2153 transition count 1914
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1954 transition count 1914
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 398 place count 1954 transition count 1713
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 800 place count 1753 transition count 1713
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 831 place count 1722 transition count 1682
Iterating global reduction 2 with 31 rules applied. Total rules applied 862 place count 1722 transition count 1682
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 862 place count 1722 transition count 1671
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 884 place count 1711 transition count 1671
Performed 703 Post agglomeration using F-continuation condition.Transition count delta: 703
Deduced a syphon composed of 703 places in 2 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 2 with 1406 rules applied. Total rules applied 2290 place count 1008 transition count 968
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2292 place count 1006 transition count 966
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2293 place count 1005 transition count 966
Applied a total of 2293 rules in 324 ms. Remains 1005 /2154 variables (removed 1149) and now considering 966/2114 (removed 1148) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 324 ms. Remains : 1005/2154 places, 966/2114 transitions.
[2023-03-22 13:57:35] [INFO ] Flatten gal took : 29 ms
[2023-03-22 13:57:35] [INFO ] Flatten gal took : 31 ms
[2023-03-22 13:57:35] [INFO ] Input system was already deterministic with 966 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2124 transition count 2084
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2124 transition count 2084
Applied a total of 60 rules in 197 ms. Remains 2124 /2154 variables (removed 30) and now considering 2084/2114 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 2124/2154 places, 2084/2114 transitions.
[2023-03-22 13:57:35] [INFO ] Flatten gal took : 51 ms
[2023-03-22 13:57:35] [INFO ] Flatten gal took : 56 ms
[2023-03-22 13:57:35] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2122 transition count 2082
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2122 transition count 2082
Applied a total of 64 rules in 199 ms. Remains 2122 /2154 variables (removed 32) and now considering 2082/2114 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 2122/2154 places, 2082/2114 transitions.
[2023-03-22 13:57:36] [INFO ] Flatten gal took : 59 ms
[2023-03-22 13:57:36] [INFO ] Flatten gal took : 63 ms
[2023-03-22 13:57:36] [INFO ] Input system was already deterministic with 2082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2124 transition count 2084
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2124 transition count 2084
Applied a total of 60 rules in 174 ms. Remains 2124 /2154 variables (removed 30) and now considering 2084/2114 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 2124/2154 places, 2084/2114 transitions.
[2023-03-22 13:57:36] [INFO ] Flatten gal took : 50 ms
[2023-03-22 13:57:36] [INFO ] Flatten gal took : 54 ms
[2023-03-22 13:57:36] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2125 transition count 2085
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2125 transition count 2085
Applied a total of 58 rules in 153 ms. Remains 2125 /2154 variables (removed 29) and now considering 2085/2114 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 2125/2154 places, 2085/2114 transitions.
[2023-03-22 13:57:37] [INFO ] Flatten gal took : 49 ms
[2023-03-22 13:57:37] [INFO ] Flatten gal took : 51 ms
[2023-03-22 13:57:37] [INFO ] Input system was already deterministic with 2085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2125 transition count 2085
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2125 transition count 2085
Applied a total of 58 rules in 129 ms. Remains 2125 /2154 variables (removed 29) and now considering 2085/2114 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 2125/2154 places, 2085/2114 transitions.
[2023-03-22 13:57:37] [INFO ] Flatten gal took : 49 ms
[2023-03-22 13:57:37] [INFO ] Flatten gal took : 54 ms
[2023-03-22 13:57:37] [INFO ] Input system was already deterministic with 2085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2122 transition count 2082
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2122 transition count 2082
Applied a total of 64 rules in 153 ms. Remains 2122 /2154 variables (removed 32) and now considering 2082/2114 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 2122/2154 places, 2082/2114 transitions.
[2023-03-22 13:57:37] [INFO ] Flatten gal took : 46 ms
[2023-03-22 13:57:37] [INFO ] Flatten gal took : 48 ms
[2023-03-22 13:57:38] [INFO ] Input system was already deterministic with 2082 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 2153 transition count 1918
Reduce places removed 195 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 196 rules applied. Total rules applied 391 place count 1958 transition count 1917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 1957 transition count 1917
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 392 place count 1957 transition count 1719
Deduced a syphon composed of 198 places in 7 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 788 place count 1759 transition count 1719
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 816 place count 1731 transition count 1691
Iterating global reduction 3 with 28 rules applied. Total rules applied 844 place count 1731 transition count 1691
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 844 place count 1731 transition count 1682
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 862 place count 1722 transition count 1682
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 700
Deduced a syphon composed of 700 places in 2 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 3 with 1400 rules applied. Total rules applied 2262 place count 1022 transition count 982
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2264 place count 1020 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2265 place count 1019 transition count 980
Applied a total of 2265 rules in 427 ms. Remains 1019 /2154 variables (removed 1135) and now considering 980/2114 (removed 1134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 427 ms. Remains : 1019/2154 places, 980/2114 transitions.
[2023-03-22 13:57:38] [INFO ] Flatten gal took : 43 ms
[2023-03-22 13:57:38] [INFO ] Flatten gal took : 32 ms
[2023-03-22 13:57:38] [INFO ] Input system was already deterministic with 980 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2154/2154 places, 2114/2114 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2124 transition count 2084
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2124 transition count 2084
Applied a total of 60 rules in 148 ms. Remains 2124 /2154 variables (removed 30) and now considering 2084/2114 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 2124/2154 places, 2084/2114 transitions.
[2023-03-22 13:57:38] [INFO ] Flatten gal took : 50 ms
[2023-03-22 13:57:38] [INFO ] Flatten gal took : 52 ms
[2023-03-22 13:57:39] [INFO ] Input system was already deterministic with 2084 transitions.
[2023-03-22 13:57:39] [INFO ] Flatten gal took : 54 ms
[2023-03-22 13:57:39] [INFO ] Flatten gal took : 80 ms
[2023-03-22 13:57:39] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-22 13:57:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2154 places, 2114 transitions and 6628 arcs took 9 ms.
Total runtime 91864 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 2154 NrTr: 2114 NrArc: 6628)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.421sec

net check time: 0m 0.001sec

init dd package: 0m 3.082sec


before gc: list nodes free: 916979

after gc: idd nodes used:48416510, unused:15583490; list nodes free:68362500

RS generation: 24m49.225sec


-> last computed set: #nodes 48414358 (4.8e+07) #states 81,750,168,806,759 (13)


CANNOT_COMPUTE


BK_STOP 1679494980090

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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 0.014sec

idd.cc:820: DD Exception: No free nodes

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="ShieldIIPs-PT-040B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldIIPs-PT-040B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717500137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;