fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903718200649
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldPPPt-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10121.907 2046109.00 2152070.00 117.40 ??TF???????????? normal

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-167903718200649.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 ShieldPPPt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718200649
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 569K 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 ShieldPPPt-PT-030B-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679527467395

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=ShieldPPPt-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:24:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 23:24:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:24:30] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-22 23:24:30] [INFO ] Transformed 2343 places.
[2023-03-22 23:24:30] [INFO ] Transformed 2133 transitions.
[2023-03-22 23:24:30] [INFO ] Found NUPN structural information;
[2023-03-22 23:24:30] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
FORMULA ShieldPPPt-PT-030B-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 161 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 288 place count 2055 transition count 1845
Iterating global reduction 0 with 288 rules applied. Total rules applied 576 place count 2055 transition count 1845
Applied a total of 576 rules in 622 ms. Remains 2055 /2343 variables (removed 288) and now considering 1845/2133 (removed 288) transitions.
// Phase 1: matrix 1845 rows 2055 cols
[2023-03-22 23:24:31] [INFO ] Computed 331 place invariants in 42 ms
[2023-03-22 23:24:32] [INFO ] Implicit Places using invariants in 1446 ms returned []
[2023-03-22 23:24:32] [INFO ] Invariant cache hit.
[2023-03-22 23:24:36] [INFO ] Implicit Places using invariants and state equation in 3266 ms returned []
Implicit Place search using SMT with State Equation took 4791 ms to find 0 implicit places.
[2023-03-22 23:24:36] [INFO ] Invariant cache hit.
[2023-03-22 23:24:40] [INFO ] Dead Transitions using invariants and state equation in 4629 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2055/2343 places, 1845/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10049 ms. Remains : 2055/2343 places, 1845/2133 transitions.
Support contains 161 out of 2055 places after structural reductions.
[2023-03-22 23:24:41] [INFO ] Flatten gal took : 191 ms
[2023-03-22 23:24:41] [INFO ] Flatten gal took : 72 ms
[2023-03-22 23:24:41] [INFO ] Input system was already deterministic with 1845 transitions.
Support contains 156 out of 2055 places (down from 161) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 678 ms. (steps per millisecond=14 ) properties (out of 92) seen :40
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 52) 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 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 52) seen :0
Running SMT prover for 52 properties.
[2023-03-22 23:24:42] [INFO ] Invariant cache hit.
[2023-03-22 23:24:46] [INFO ] After 3352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2023-03-22 23:24:49] [INFO ] [Nat]Absence check using 331 positive place invariants in 343 ms returned sat
[2023-03-22 23:24:58] [INFO ] After 5974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :52
[2023-03-22 23:24:59] [INFO ] Deduced a trap composed of 17 places in 870 ms of which 29 ms to minimize.
[2023-03-22 23:24:59] [INFO ] Deduced a trap composed of 26 places in 491 ms of which 1 ms to minimize.
[2023-03-22 23:25:00] [INFO ] Deduced a trap composed of 17 places in 888 ms of which 4 ms to minimize.
[2023-03-22 23:25:01] [INFO ] Deduced a trap composed of 25 places in 656 ms of which 14 ms to minimize.
[2023-03-22 23:25:01] [INFO ] Deduced a trap composed of 26 places in 507 ms of which 1 ms to minimize.
[2023-03-22 23:25:02] [INFO ] Deduced a trap composed of 28 places in 447 ms of which 1 ms to minimize.
[2023-03-22 23:25:03] [INFO ] Deduced a trap composed of 21 places in 787 ms of which 14 ms to minimize.
[2023-03-22 23:25:04] [INFO ] Deduced a trap composed of 21 places in 1446 ms of which 2 ms to minimize.
[2023-03-22 23:25:05] [INFO ] Deduced a trap composed of 20 places in 597 ms of which 14 ms to minimize.
[2023-03-22 23:25:05] [INFO ] Deduced a trap composed of 22 places in 371 ms of which 1 ms to minimize.
[2023-03-22 23:25:06] [INFO ] Deduced a trap composed of 23 places in 475 ms of which 1 ms to minimize.
[2023-03-22 23:25:07] [INFO ] Deduced a trap composed of 20 places in 671 ms of which 2 ms to minimize.
[2023-03-22 23:25:07] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 2 ms to minimize.
[2023-03-22 23:25:08] [INFO ] Deduced a trap composed of 26 places in 379 ms of which 1 ms to minimize.
[2023-03-22 23:25:08] [INFO ] Deduced a trap composed of 24 places in 495 ms of which 1 ms to minimize.
[2023-03-22 23:25:09] [INFO ] Deduced a trap composed of 35 places in 348 ms of which 1 ms to minimize.
[2023-03-22 23:25:10] [INFO ] Deduced a trap composed of 23 places in 646 ms of which 1 ms to minimize.
[2023-03-22 23:25:10] [INFO ] Deduced a trap composed of 26 places in 493 ms of which 1 ms to minimize.
[2023-03-22 23:25:11] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 1 ms to minimize.
[2023-03-22 23:25:11] [INFO ] Deduced a trap composed of 18 places in 279 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 23:25:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 23:25:11] [INFO ] After 25211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:52
Fused 52 Parikh solutions to 51 different solutions.
Parikh walk visited 0 properties in 6814 ms.
Support contains 90 out of 2055 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Drop transitions removed 366 transitions
Trivial Post-agglo rules discarded 366 transitions
Performed 366 trivial Post agglomeration. Transition count delta: 366
Iterating post reduction 0 with 366 rules applied. Total rules applied 366 place count 2055 transition count 1479
Reduce places removed 366 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 368 rules applied. Total rules applied 734 place count 1689 transition count 1477
Reduce places removed 1 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 22 rules applied. Total rules applied 756 place count 1688 transition count 1456
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 777 place count 1667 transition count 1456
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 207 Pre rules applied. Total rules applied 777 place count 1667 transition count 1249
Deduced a syphon composed of 207 places in 3 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 4 with 414 rules applied. Total rules applied 1191 place count 1460 transition count 1249
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1208 place count 1443 transition count 1232
Iterating global reduction 4 with 17 rules applied. Total rules applied 1225 place count 1443 transition count 1232
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 1225 place count 1443 transition count 1217
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 1255 place count 1428 transition count 1217
Performed 501 Post agglomeration using F-continuation condition.Transition count delta: 501
Deduced a syphon composed of 501 places in 2 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 4 with 1002 rules applied. Total rules applied 2257 place count 927 transition count 716
Renaming transitions due to excessive name length > 1024 char.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2411 place count 850 transition count 716
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 2416 place count 850 transition count 711
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2421 place count 845 transition count 711
Partial Free-agglomeration rule applied 73 times.
Drop transitions removed 73 transitions
Iterating global reduction 5 with 73 rules applied. Total rules applied 2494 place count 845 transition count 711
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2495 place count 844 transition count 710
Applied a total of 2495 rules in 831 ms. Remains 844 /2055 variables (removed 1211) and now considering 710/1845 (removed 1135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 831 ms. Remains : 844/2055 places, 710/1845 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 52) seen :10
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Running SMT prover for 42 properties.
// Phase 1: matrix 710 rows 844 cols
[2023-03-22 23:25:20] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 23:25:20] [INFO ] After 925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:42
[2023-03-22 23:25:21] [INFO ] [Nat]Absence check using 331 positive place invariants in 95 ms returned sat
[2023-03-22 23:25:24] [INFO ] After 2007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :42
[2023-03-22 23:25:24] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-22 23:25:27] [INFO ] After 2620ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :42
[2023-03-22 23:25:27] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 0 ms to minimize.
[2023-03-22 23:25:28] [INFO ] Deduced a trap composed of 6 places in 719 ms of which 17 ms to minimize.
[2023-03-22 23:25:28] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-22 23:25:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1199 ms
[2023-03-22 23:25:29] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 1 ms to minimize.
[2023-03-22 23:25:29] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 0 ms to minimize.
[2023-03-22 23:25:29] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 14 ms to minimize.
[2023-03-22 23:25:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 997 ms
[2023-03-22 23:25:30] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2023-03-22 23:25:30] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-22 23:25:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2023-03-22 23:25:31] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-22 23:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-22 23:25:31] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-22 23:25:32] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-22 23:25:32] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 0 ms to minimize.
[2023-03-22 23:25:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 838 ms
[2023-03-22 23:25:33] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 27 ms to minimize.
[2023-03-22 23:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-22 23:25:33] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 18 ms to minimize.
[2023-03-22 23:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-22 23:25:34] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-22 23:25:34] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2023-03-22 23:25:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 387 ms
[2023-03-22 23:25:35] [INFO ] After 11046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :42
Attempting to minimize the solution found.
Minimization took 2590 ms.
[2023-03-22 23:25:38] [INFO ] After 17110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :42
Parikh walk visited 0 properties in 1092 ms.
Support contains 75 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 710/710 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 844 transition count 706
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 840 transition count 706
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 840 transition count 704
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 12 place count 838 transition count 704
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 837 transition count 703
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 837 transition count 703
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 830 transition count 696
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 830 transition count 696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 829 transition count 695
Applied a total of 30 rules in 190 ms. Remains 829 /844 variables (removed 15) and now considering 695/710 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 829/844 places, 695/710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 42) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
// Phase 1: matrix 695 rows 829 cols
[2023-03-22 23:25:40] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 23:25:40] [INFO ] After 602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:35
[2023-03-22 23:25:41] [INFO ] [Nat]Absence check using 331 positive place invariants in 94 ms returned sat
[2023-03-22 23:25:44] [INFO ] After 2662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :35
[2023-03-22 23:25:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-22 23:25:46] [INFO ] After 1761ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :35
[2023-03-22 23:25:46] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 0 ms to minimize.
[2023-03-22 23:25:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-22 23:25:47] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 4 ms to minimize.
[2023-03-22 23:25:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-22 23:25:48] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 30 ms to minimize.
[2023-03-22 23:25:48] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2023-03-22 23:25:48] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
[2023-03-22 23:25:48] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2023-03-22 23:25:49] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-22 23:25:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1283 ms
[2023-03-22 23:25:49] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-22 23:25:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-22 23:25:50] [INFO ] Deduced a trap composed of 5 places in 515 ms of which 0 ms to minimize.
[2023-03-22 23:25:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 574 ms
[2023-03-22 23:25:50] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2023-03-22 23:25:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-22 23:25:51] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 27 ms to minimize.
[2023-03-22 23:25:51] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-03-22 23:25:51] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-22 23:25:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 592 ms
[2023-03-22 23:25:51] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 13 ms to minimize.
[2023-03-22 23:25:51] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2023-03-22 23:25:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 455 ms
[2023-03-22 23:25:52] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 0 ms to minimize.
[2023-03-22 23:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-22 23:25:52] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2023-03-22 23:25:53] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2023-03-22 23:25:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 426 ms
[2023-03-22 23:25:53] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 24 ms to minimize.
[2023-03-22 23:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-22 23:25:53] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2023-03-22 23:25:53] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-22 23:25:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2023-03-22 23:25:54] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 1 ms to minimize.
[2023-03-22 23:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-22 23:25:54] [INFO ] After 9968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :35
Attempting to minimize the solution found.
Minimization took 1687 ms.
[2023-03-22 23:25:56] [INFO ] After 15584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :35
Fused 35 Parikh solutions to 34 different solutions.
Parikh walk visited 0 properties in 1066 ms.
Support contains 64 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 695/695 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 829 transition count 691
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 825 transition count 691
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 821 transition count 687
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 820 transition count 687
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 820 transition count 686
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 819 transition count 686
Applied a total of 20 rules in 96 ms. Remains 819 /829 variables (removed 10) and now considering 686/695 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 819/829 places, 686/695 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Interrupted probabilistic random walk after 65914 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65914 steps, saw 46400 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 35 properties.
// Phase 1: matrix 686 rows 819 cols
[2023-03-22 23:26:01] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 23:26:01] [INFO ] After 688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:35
[2023-03-22 23:26:03] [INFO ] [Nat]Absence check using 331 positive place invariants in 190 ms returned sat
[2023-03-22 23:26:05] [INFO ] After 1920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :35
[2023-03-22 23:26:05] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-22 23:26:07] [INFO ] After 1776ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :35
[2023-03-22 23:26:07] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-22 23:26:07] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-22 23:26:08] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 1 ms to minimize.
[2023-03-22 23:26:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 793 ms
[2023-03-22 23:26:08] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 24 ms to minimize.
[2023-03-22 23:26:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-22 23:26:09] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2023-03-22 23:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-22 23:26:09] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 15 ms to minimize.
[2023-03-22 23:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-22 23:26:10] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 52 ms to minimize.
[2023-03-22 23:26:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-22 23:26:10] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 0 ms to minimize.
[2023-03-22 23:26:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-22 23:26:11] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 13 ms to minimize.
[2023-03-22 23:26:11] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 22 ms to minimize.
[2023-03-22 23:26:11] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-22 23:26:11] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-22 23:26:11] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-22 23:26:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 947 ms
[2023-03-22 23:26:12] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2023-03-22 23:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-22 23:26:13] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2023-03-22 23:26:13] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2023-03-22 23:26:13] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 1 ms to minimize.
[2023-03-22 23:26:13] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2023-03-22 23:26:14] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-22 23:26:14] [INFO ] Deduced a trap composed of 4 places in 745 ms of which 1 ms to minimize.
[2023-03-22 23:26:15] [INFO ] Deduced a trap composed of 5 places in 590 ms of which 0 ms to minimize.
[2023-03-22 23:26:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2725 ms
[2023-03-22 23:26:16] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 1 ms to minimize.
[2023-03-22 23:26:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2023-03-22 23:26:16] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2023-03-22 23:26:17] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 1 ms to minimize.
[2023-03-22 23:26:17] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-22 23:26:17] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2023-03-22 23:26:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1198 ms
[2023-03-22 23:26:17] [INFO ] After 12002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :35
Attempting to minimize the solution found.
Minimization took 1943 ms.
[2023-03-22 23:26:19] [INFO ] After 17750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :35
Parikh walk visited 0 properties in 949 ms.
Support contains 64 out of 819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 819/819 places, 686/686 transitions.
Applied a total of 0 rules in 17 ms. Remains 819 /819 variables (removed 0) and now considering 686/686 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 819/819 places, 686/686 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 819/819 places, 686/686 transitions.
Applied a total of 0 rules in 18 ms. Remains 819 /819 variables (removed 0) and now considering 686/686 (removed 0) transitions.
[2023-03-22 23:26:20] [INFO ] Invariant cache hit.
[2023-03-22 23:26:21] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2023-03-22 23:26:21] [INFO ] Invariant cache hit.
[2023-03-22 23:26:22] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-22 23:26:23] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 3028 ms to find 0 implicit places.
[2023-03-22 23:26:23] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-22 23:26:23] [INFO ] Invariant cache hit.
[2023-03-22 23:26:24] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3523 ms. Remains : 819/819 places, 686/686 transitions.
[2023-03-22 23:26:24] [INFO ] Flatten gal took : 76 ms
[2023-03-22 23:26:24] [INFO ] Flatten gal took : 74 ms
[2023-03-22 23:26:24] [INFO ] Input system was already deterministic with 1845 transitions.
Computed a total of 485 stabilizing places and 485 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 415 transitions
Trivial Post-agglo rules discarded 415 transitions
Performed 415 trivial Post agglomeration. Transition count delta: 415
Iterating post reduction 0 with 415 rules applied. Total rules applied 415 place count 2054 transition count 1429
Reduce places removed 415 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 417 rules applied. Total rules applied 832 place count 1639 transition count 1427
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 835 place count 1638 transition count 1425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 837 place count 1636 transition count 1425
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 215 Pre rules applied. Total rules applied 837 place count 1636 transition count 1210
Deduced a syphon composed of 215 places in 1 ms
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 4 with 430 rules applied. Total rules applied 1267 place count 1421 transition count 1210
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1303 place count 1385 transition count 1174
Iterating global reduction 4 with 36 rules applied. Total rules applied 1339 place count 1385 transition count 1174
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 1339 place count 1385 transition count 1144
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1399 place count 1355 transition count 1144
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 475
Deduced a syphon composed of 475 places in 0 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 4 with 950 rules applied. Total rules applied 2349 place count 880 transition count 669
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2351 place count 878 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2352 place count 877 transition count 667
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2352 place count 877 transition count 665
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2356 place count 875 transition count 665
Applied a total of 2356 rules in 393 ms. Remains 875 /2055 variables (removed 1180) and now considering 665/1845 (removed 1180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 393 ms. Remains : 875/2055 places, 665/1845 transitions.
[2023-03-22 23:26:25] [INFO ] Flatten gal took : 22 ms
[2023-03-22 23:26:25] [INFO ] Flatten gal took : 22 ms
[2023-03-22 23:26:25] [INFO ] Input system was already deterministic with 665 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2018 transition count 1808
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2018 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 2017 transition count 1807
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 2017 transition count 1807
Applied a total of 76 rules in 370 ms. Remains 2017 /2055 variables (removed 38) and now considering 1807/1845 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 2017/2055 places, 1807/1845 transitions.
[2023-03-22 23:26:25] [INFO ] Flatten gal took : 68 ms
[2023-03-22 23:26:25] [INFO ] Flatten gal took : 47 ms
[2023-03-22 23:26:25] [INFO ] Input system was already deterministic with 1807 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2054 transition count 1423
Reduce places removed 421 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 423 rules applied. Total rules applied 844 place count 1633 transition count 1421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 845 place count 1632 transition count 1421
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 215 Pre rules applied. Total rules applied 845 place count 1632 transition count 1206
Deduced a syphon composed of 215 places in 2 ms
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 3 with 430 rules applied. Total rules applied 1275 place count 1417 transition count 1206
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1310 place count 1382 transition count 1171
Iterating global reduction 3 with 35 rules applied. Total rules applied 1345 place count 1382 transition count 1171
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1345 place count 1382 transition count 1142
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1403 place count 1353 transition count 1142
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 1 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 3 with 960 rules applied. Total rules applied 2363 place count 873 transition count 662
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 2365 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2366 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2366 place count 870 transition count 658
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2370 place count 868 transition count 658
Applied a total of 2370 rules in 336 ms. Remains 868 /2055 variables (removed 1187) and now considering 658/1845 (removed 1187) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 336 ms. Remains : 868/2055 places, 658/1845 transitions.
[2023-03-22 23:26:26] [INFO ] Flatten gal took : 19 ms
[2023-03-22 23:26:26] [INFO ] Flatten gal took : 21 ms
[2023-03-22 23:26:26] [INFO ] Input system was already deterministic with 658 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
FORMULA ShieldPPPt-PT-030B-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2014 transition count 1804
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2014 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 2013 transition count 1803
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 2013 transition count 1803
Applied a total of 84 rules in 336 ms. Remains 2013 /2055 variables (removed 42) and now considering 1803/1845 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 2013/2055 places, 1803/1845 transitions.
[2023-03-22 23:26:26] [INFO ] Flatten gal took : 43 ms
[2023-03-22 23:26:26] [INFO ] Flatten gal took : 45 ms
[2023-03-22 23:26:26] [INFO ] Input system was already deterministic with 1803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2014 transition count 1804
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2014 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 2013 transition count 1803
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 2013 transition count 1803
Applied a total of 84 rules in 350 ms. Remains 2013 /2055 variables (removed 42) and now considering 1803/1845 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 2013/2055 places, 1803/1845 transitions.
[2023-03-22 23:26:27] [INFO ] Flatten gal took : 42 ms
[2023-03-22 23:26:27] [INFO ] Flatten gal took : 54 ms
[2023-03-22 23:26:27] [INFO ] Input system was already deterministic with 1803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2016 transition count 1806
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2016 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 2015 transition count 1805
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 2015 transition count 1805
Applied a total of 80 rules in 326 ms. Remains 2015 /2055 variables (removed 40) and now considering 1805/1845 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 2015/2055 places, 1805/1845 transitions.
[2023-03-22 23:26:27] [INFO ] Flatten gal took : 37 ms
[2023-03-22 23:26:27] [INFO ] Flatten gal took : 42 ms
[2023-03-22 23:26:27] [INFO ] Input system was already deterministic with 1805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2016 transition count 1806
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2016 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 2015 transition count 1805
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 2015 transition count 1805
Applied a total of 80 rules in 324 ms. Remains 2015 /2055 variables (removed 40) and now considering 1805/1845 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 2015/2055 places, 1805/1845 transitions.
[2023-03-22 23:26:28] [INFO ] Flatten gal took : 116 ms
[2023-03-22 23:26:28] [INFO ] Flatten gal took : 70 ms
[2023-03-22 23:26:28] [INFO ] Input system was already deterministic with 1805 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 423 rules applied. Total rules applied 423 place count 2054 transition count 1421
Reduce places removed 423 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 425 rules applied. Total rules applied 848 place count 1631 transition count 1419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 849 place count 1630 transition count 1419
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 214 Pre rules applied. Total rules applied 849 place count 1630 transition count 1205
Deduced a syphon composed of 214 places in 3 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 428 rules applied. Total rules applied 1277 place count 1416 transition count 1205
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1313 place count 1380 transition count 1169
Iterating global reduction 3 with 36 rules applied. Total rules applied 1349 place count 1380 transition count 1169
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 1349 place count 1380 transition count 1139
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1409 place count 1350 transition count 1139
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 1 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 2365 place count 872 transition count 661
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 2367 place count 870 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2368 place count 869 transition count 659
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2368 place count 869 transition count 657
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2372 place count 867 transition count 657
Applied a total of 2372 rules in 311 ms. Remains 867 /2055 variables (removed 1188) and now considering 657/1845 (removed 1188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 312 ms. Remains : 867/2055 places, 657/1845 transitions.
[2023-03-22 23:26:28] [INFO ] Flatten gal took : 17 ms
[2023-03-22 23:26:28] [INFO ] Flatten gal took : 18 ms
[2023-03-22 23:26:28] [INFO ] Input system was already deterministic with 657 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 2019 transition count 1809
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 2019 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 2018 transition count 1808
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 2018 transition count 1808
Applied a total of 74 rules in 414 ms. Remains 2018 /2055 variables (removed 37) and now considering 1808/1845 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 2018/2055 places, 1808/1845 transitions.
[2023-03-22 23:26:29] [INFO ] Flatten gal took : 38 ms
[2023-03-22 23:26:29] [INFO ] Flatten gal took : 40 ms
[2023-03-22 23:26:29] [INFO ] Input system was already deterministic with 1808 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2014 transition count 1804
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2014 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 2013 transition count 1803
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 2013 transition count 1803
Applied a total of 84 rules in 344 ms. Remains 2013 /2055 variables (removed 42) and now considering 1803/1845 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 2013/2055 places, 1803/1845 transitions.
[2023-03-22 23:26:29] [INFO ] Flatten gal took : 35 ms
[2023-03-22 23:26:29] [INFO ] Flatten gal took : 36 ms
[2023-03-22 23:26:30] [INFO ] Input system was already deterministic with 1803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2014 transition count 1804
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2014 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 2013 transition count 1803
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 2013 transition count 1803
Applied a total of 84 rules in 393 ms. Remains 2013 /2055 variables (removed 42) and now considering 1803/1845 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 2013/2055 places, 1803/1845 transitions.
[2023-03-22 23:26:30] [INFO ] Flatten gal took : 39 ms
[2023-03-22 23:26:30] [INFO ] Flatten gal took : 41 ms
[2023-03-22 23:26:30] [INFO ] Input system was already deterministic with 1803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2016 transition count 1806
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2016 transition count 1806
Applied a total of 78 rules in 276 ms. Remains 2016 /2055 variables (removed 39) and now considering 1806/1845 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 2016/2055 places, 1806/1845 transitions.
[2023-03-22 23:26:30] [INFO ] Flatten gal took : 37 ms
[2023-03-22 23:26:30] [INFO ] Flatten gal took : 53 ms
[2023-03-22 23:26:31] [INFO ] Input system was already deterministic with 1806 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2054 transition count 1422
Reduce places removed 422 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 424 rules applied. Total rules applied 846 place count 1632 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 847 place count 1631 transition count 1420
Performed 213 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 213 Pre rules applied. Total rules applied 847 place count 1631 transition count 1207
Deduced a syphon composed of 213 places in 3 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 3 with 426 rules applied. Total rules applied 1273 place count 1418 transition count 1207
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1306 place count 1385 transition count 1174
Iterating global reduction 3 with 33 rules applied. Total rules applied 1339 place count 1385 transition count 1174
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 1339 place count 1385 transition count 1146
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1395 place count 1357 transition count 1146
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 1 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 3 with 954 rules applied. Total rules applied 2349 place count 880 transition count 669
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 2351 place count 878 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2352 place count 877 transition count 667
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2352 place count 877 transition count 665
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2356 place count 875 transition count 665
Applied a total of 2356 rules in 304 ms. Remains 875 /2055 variables (removed 1180) and now considering 665/1845 (removed 1180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 304 ms. Remains : 875/2055 places, 665/1845 transitions.
[2023-03-22 23:26:31] [INFO ] Flatten gal took : 17 ms
[2023-03-22 23:26:31] [INFO ] Flatten gal took : 18 ms
[2023-03-22 23:26:31] [INFO ] Input system was already deterministic with 665 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2054 transition count 1423
Reduce places removed 421 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 423 rules applied. Total rules applied 844 place count 1633 transition count 1421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 845 place count 1632 transition count 1421
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 215 Pre rules applied. Total rules applied 845 place count 1632 transition count 1206
Deduced a syphon composed of 215 places in 1 ms
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 3 with 430 rules applied. Total rules applied 1275 place count 1417 transition count 1206
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1310 place count 1382 transition count 1171
Iterating global reduction 3 with 35 rules applied. Total rules applied 1345 place count 1382 transition count 1171
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1345 place count 1382 transition count 1142
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1403 place count 1353 transition count 1142
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 475
Deduced a syphon composed of 475 places in 1 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 3 with 950 rules applied. Total rules applied 2353 place count 878 transition count 667
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 2355 place count 876 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2356 place count 875 transition count 665
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2356 place count 875 transition count 663
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2360 place count 873 transition count 663
Applied a total of 2360 rules in 332 ms. Remains 873 /2055 variables (removed 1182) and now considering 663/1845 (removed 1182) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 332 ms. Remains : 873/2055 places, 663/1845 transitions.
[2023-03-22 23:26:31] [INFO ] Flatten gal took : 17 ms
[2023-03-22 23:26:31] [INFO ] Flatten gal took : 19 ms
[2023-03-22 23:26:31] [INFO ] Input system was already deterministic with 663 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2055/2055 places, 1845/1845 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 423 rules applied. Total rules applied 423 place count 2054 transition count 1421
Reduce places removed 423 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 425 rules applied. Total rules applied 848 place count 1631 transition count 1419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 849 place count 1630 transition count 1419
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 214 Pre rules applied. Total rules applied 849 place count 1630 transition count 1205
Deduced a syphon composed of 214 places in 1 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 428 rules applied. Total rules applied 1277 place count 1416 transition count 1205
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1312 place count 1381 transition count 1170
Iterating global reduction 3 with 35 rules applied. Total rules applied 1347 place count 1381 transition count 1170
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1347 place count 1381 transition count 1141
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1405 place count 1352 transition count 1141
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 1 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 3 with 958 rules applied. Total rules applied 2363 place count 873 transition count 662
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 2365 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2366 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2366 place count 870 transition count 658
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2370 place count 868 transition count 658
Applied a total of 2370 rules in 299 ms. Remains 868 /2055 variables (removed 1187) and now considering 658/1845 (removed 1187) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 299 ms. Remains : 868/2055 places, 658/1845 transitions.
[2023-03-22 23:26:32] [INFO ] Flatten gal took : 17 ms
[2023-03-22 23:26:32] [INFO ] Flatten gal took : 18 ms
[2023-03-22 23:26:32] [INFO ] Input system was already deterministic with 658 transitions.
[2023-03-22 23:26:32] [INFO ] Flatten gal took : 60 ms
[2023-03-22 23:26:32] [INFO ] Flatten gal took : 53 ms
[2023-03-22 23:26:32] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 16 ms.
[2023-03-22 23:26:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2055 places, 1845 transitions and 4770 arcs took 9 ms.
Total runtime 122316 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: 2055 NrTr: 1845 NrArc: 4770)

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

net check time: 0m 0.000sec

init dd package: 0m 3.219sec


before gc: list nodes free: 1985839

after gc: idd nodes used:51449637, unused:12550363; list nodes free:56301905

RS generation: 31m25.913sec


-> last computed set: #nodes 51447584 (5.1e+07) #states 19,491,435,027,535,152,518,140,668 (25)


CANNOT_COMPUTE


BK_STOP 1679529513504

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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.010sec

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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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-167903718200649"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 ;