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-167903717500106.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPs-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 332K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679490144220

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:02:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 13:02:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:02:27] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2023-03-22 13:02:27] [INFO ] Transformed 1203 places.
[2023-03-22 13:02:27] [INFO ] Transformed 1183 transitions.
[2023-03-22 13:02:27] [INFO ] Found NUPN structural information;
[2023-03-22 13:02:27] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 194 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 111 places :
Symmetric choice reduction at 0 with 111 rule applications. Total rules 111 place count 1092 transition count 1072
Iterating global reduction 0 with 111 rules applied. Total rules applied 222 place count 1092 transition count 1072
Applied a total of 222 rules in 187 ms. Remains 1092 /1203 variables (removed 111) and now considering 1072/1183 (removed 111) transitions.
// Phase 1: matrix 1072 rows 1092 cols
[2023-03-22 13:02:27] [INFO ] Computed 181 place invariants in 51 ms
[2023-03-22 13:02:29] [INFO ] Implicit Places using invariants in 1857 ms returned []
[2023-03-22 13:02:29] [INFO ] Invariant cache hit.
[2023-03-22 13:02:30] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 3486 ms to find 0 implicit places.
[2023-03-22 13:02:30] [INFO ] Invariant cache hit.
[2023-03-22 13:02:31] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1092/1203 places, 1072/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4558 ms. Remains : 1092/1203 places, 1072/1183 transitions.
Support contains 194 out of 1092 places after structural reductions.
[2023-03-22 13:02:32] [INFO ] Flatten gal took : 166 ms
[2023-03-22 13:02:32] [INFO ] Flatten gal took : 57 ms
[2023-03-22 13:02:32] [INFO ] Input system was already deterministic with 1072 transitions.
Support contains 193 out of 1092 places (down from 194) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 535 ms. (steps per millisecond=18 ) properties (out of 102) seen :85
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2023-03-22 13:02:33] [INFO ] Invariant cache hit.
[2023-03-22 13:02:33] [INFO ] [Real]Absence check using 181 positive place invariants in 246 ms returned sat
[2023-03-22 13:02:34] [INFO ] After 1189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-22 13:02:35] [INFO ] [Nat]Absence check using 181 positive place invariants in 112 ms returned sat
[2023-03-22 13:02:37] [INFO ] After 2112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-22 13:02:38] [INFO ] Deduced a trap composed of 13 places in 470 ms of which 17 ms to minimize.
[2023-03-22 13:02:38] [INFO ] Deduced a trap composed of 31 places in 394 ms of which 2 ms to minimize.
[2023-03-22 13:02:39] [INFO ] Deduced a trap composed of 22 places in 324 ms of which 1 ms to minimize.
[2023-03-22 13:02:39] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 13 ms to minimize.
[2023-03-22 13:02:40] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 2 ms to minimize.
[2023-03-22 13:02:40] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2023-03-22 13:02:40] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 13 ms to minimize.
[2023-03-22 13:02:40] [INFO ] Deduced a trap composed of 18 places in 289 ms of which 14 ms to minimize.
[2023-03-22 13:02:41] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2023-03-22 13:02:41] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 1 ms to minimize.
[2023-03-22 13:02:41] [INFO ] Deduced a trap composed of 32 places in 363 ms of which 1 ms to minimize.
[2023-03-22 13:02:41] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2023-03-22 13:02:42] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 1 ms to minimize.
[2023-03-22 13:02:42] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 1 ms to minimize.
[2023-03-22 13:02:42] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 1 ms to minimize.
[2023-03-22 13:02:43] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2023-03-22 13:02:43] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 1 ms to minimize.
[2023-03-22 13:02:43] [INFO ] Deduced a trap composed of 22 places in 393 ms of which 1 ms to minimize.
[2023-03-22 13:02:43] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 1 ms to minimize.
[2023-03-22 13:02:44] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 0 ms to minimize.
[2023-03-22 13:02:44] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 1 ms to minimize.
[2023-03-22 13:02:44] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 13 ms to minimize.
[2023-03-22 13:02:44] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2023-03-22 13:02:45] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 2 ms to minimize.
[2023-03-22 13:02:45] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2023-03-22 13:02:45] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 1 ms to minimize.
[2023-03-22 13:02:46] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 1 ms to minimize.
[2023-03-22 13:02:46] [INFO ] Deduced a trap composed of 24 places in 564 ms of which 1 ms to minimize.
[2023-03-22 13:02:48] [INFO ] Deduced a trap composed of 31 places in 1650 ms of which 1 ms to minimize.
[2023-03-22 13:02:48] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 0 ms to minimize.
[2023-03-22 13:02:48] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 0 ms to minimize.
[2023-03-22 13:02:48] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 11040 ms
[2023-03-22 13:02:49] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 0 ms to minimize.
[2023-03-22 13:02:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-22 13:02:49] [INFO ] Deduced a trap composed of 23 places in 340 ms of which 0 ms to minimize.
[2023-03-22 13:02:50] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 49 ms to minimize.
[2023-03-22 13:02:50] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 5 ms to minimize.
[2023-03-22 13:02:50] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 1 ms to minimize.
[2023-03-22 13:02:50] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2023-03-22 13:02:51] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 0 ms to minimize.
[2023-03-22 13:02:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1662 ms
[2023-03-22 13:02:51] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 2 ms to minimize.
[2023-03-22 13:02:51] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2023-03-22 13:02:52] [INFO ] Deduced a trap composed of 16 places in 336 ms of which 1 ms to minimize.
[2023-03-22 13:02:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 935 ms
[2023-03-22 13:02:52] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 0 ms to minimize.
[2023-03-22 13:02:52] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 1 ms to minimize.
[2023-03-22 13:02:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
[2023-03-22 13:02:53] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2023-03-22 13:02:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-22 13:02:53] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 0 ms to minimize.
[2023-03-22 13:02:53] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-22 13:02:54] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2023-03-22 13:02:54] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2023-03-22 13:02:54] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2023-03-22 13:02:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1166 ms
[2023-03-22 13:02:54] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2023-03-22 13:02:54] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:02:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2023-03-22 13:02:55] [INFO ] Deduced a trap composed of 34 places in 313 ms of which 0 ms to minimize.
[2023-03-22 13:02:55] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2023-03-22 13:02:56] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2023-03-22 13:02:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 921 ms
[2023-03-22 13:02:56] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 0 ms to minimize.
[2023-03-22 13:02:56] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 0 ms to minimize.
[2023-03-22 13:02:57] [INFO ] Deduced a trap composed of 31 places in 281 ms of which 2 ms to minimize.
[2023-03-22 13:02:57] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 1 ms to minimize.
[2023-03-22 13:02:57] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 1 ms to minimize.
[2023-03-22 13:02:57] [INFO ] Deduced a trap composed of 29 places in 307 ms of which 0 ms to minimize.
[2023-03-22 13:02:58] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 1 ms to minimize.
[2023-03-22 13:02:58] [INFO ] Deduced a trap composed of 25 places in 349 ms of which 13 ms to minimize.
[2023-03-22 13:02:59] [INFO ] Deduced a trap composed of 34 places in 343 ms of which 0 ms to minimize.
[2023-03-22 13:02:59] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 14 ms to minimize.
[2023-03-22 13:02:59] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 13:02:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 13:02:59] [INFO ] After 25413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 2 properties in 626 ms.
Support contains 56 out of 1092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1092 transition count 981
Reduce places removed 91 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 92 rules applied. Total rules applied 183 place count 1001 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 184 place count 1000 transition count 980
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 184 place count 1000 transition count 880
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 384 place count 900 transition count 880
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 410 place count 874 transition count 854
Iterating global reduction 3 with 26 rules applied. Total rules applied 436 place count 874 transition count 854
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 436 place count 874 transition count 842
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 460 place count 862 transition count 842
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 329
Deduced a syphon composed of 329 places in 2 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 3 with 658 rules applied. Total rules applied 1118 place count 533 transition count 513
Partial Free-agglomeration rule applied 114 times.
Drop transitions removed 114 transitions
Iterating global reduction 3 with 114 rules applied. Total rules applied 1232 place count 533 transition count 513
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1233 place count 532 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1234 place count 531 transition count 512
Applied a total of 1234 rules in 291 ms. Remains 531 /1092 variables (removed 561) and now considering 512/1072 (removed 560) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 531/1092 places, 512/1072 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 512 rows 531 cols
[2023-03-22 13:03:01] [INFO ] Computed 180 place invariants in 6 ms
[2023-03-22 13:03:01] [INFO ] [Real]Absence check using 173 positive place invariants in 37 ms returned sat
[2023-03-22 13:03:01] [INFO ] [Real]Absence check using 173 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-22 13:03:01] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 13:03:02] [INFO ] [Nat]Absence check using 173 positive place invariants in 191 ms returned sat
[2023-03-22 13:03:02] [INFO ] [Nat]Absence check using 173 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-22 13:03:02] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 13:03:02] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2023-03-22 13:03:03] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2023-03-22 13:03:03] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 3 ms to minimize.
[2023-03-22 13:03:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 406 ms
[2023-03-22 13:03:03] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-22 13:03:03] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-22 13:03:03] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-22 13:03:03] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2023-03-22 13:03:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 590 ms
[2023-03-22 13:03:04] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-22 13:03:04] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2023-03-22 13:03:04] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-22 13:03:04] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2023-03-22 13:03:04] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-22 13:03:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 768 ms
[2023-03-22 13:03:04] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2023-03-22 13:03:05] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-22 13:03:05] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2023-03-22 13:03:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
[2023-03-22 13:03:05] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2023-03-22 13:03:05] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-22 13:03:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2023-03-22 13:03:05] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-22 13:03:06] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2023-03-22 13:03:06] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-22 13:03:06] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2023-03-22 13:03:06] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-22 13:03:06] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 39 ms to minimize.
[2023-03-22 13:03:06] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2023-03-22 13:03:07] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-22 13:03:07] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-22 13:03:07] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 26 ms to minimize.
[2023-03-22 13:03:07] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2023-03-22 13:03:07] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2096 ms
[2023-03-22 13:03:07] [INFO ] After 5620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 380 ms.
[2023-03-22 13:03:08] [INFO ] After 6541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 244 ms.
Support contains 34 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 512/512 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 531 transition count 509
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 528 transition count 509
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 16 place count 523 transition count 504
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 523 transition count 504
Applied a total of 26 rules in 52 ms. Remains 523 /531 variables (removed 8) and now considering 504/512 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 523/531 places, 504/512 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 504 rows 523 cols
[2023-03-22 13:03:09] [INFO ] Computed 180 place invariants in 7 ms
[2023-03-22 13:03:09] [INFO ] [Real]Absence check using 175 positive place invariants in 21 ms returned sat
[2023-03-22 13:03:09] [INFO ] [Real]Absence check using 175 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 13:03:09] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 13:03:09] [INFO ] [Nat]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-22 13:03:09] [INFO ] [Nat]Absence check using 175 positive and 5 generalized place invariants in 42 ms returned sat
[2023-03-22 13:03:10] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 13:03:10] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2023-03-22 13:03:10] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2023-03-22 13:03:10] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2023-03-22 13:03:11] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-22 13:03:11] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:03:11] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2023-03-22 13:03:11] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2023-03-22 13:03:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1396 ms
[2023-03-22 13:03:11] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2023-03-22 13:03:12] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2023-03-22 13:03:12] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2023-03-22 13:03:12] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-22 13:03:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 689 ms
[2023-03-22 13:03:12] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-22 13:03:13] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2023-03-22 13:03:13] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 0 ms to minimize.
[2023-03-22 13:03:13] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2023-03-22 13:03:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 802 ms
[2023-03-22 13:03:13] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-22 13:03:13] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-22 13:03:14] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2023-03-22 13:03:14] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2023-03-22 13:03:14] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-22 13:03:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 642 ms
[2023-03-22 13:03:14] [INFO ] After 4365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 288 ms.
[2023-03-22 13:03:14] [INFO ] After 5088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 184 ms.
Support contains 32 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 504/504 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 521 transition count 502
Applied a total of 4 rules in 25 ms. Remains 521 /523 variables (removed 2) and now considering 502/504 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 521/523 places, 502/504 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 118340 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118340 steps, saw 84571 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 502 rows 521 cols
[2023-03-22 13:03:18] [INFO ] Computed 180 place invariants in 4 ms
[2023-03-22 13:03:18] [INFO ] [Real]Absence check using 175 positive place invariants in 23 ms returned sat
[2023-03-22 13:03:18] [INFO ] [Real]Absence check using 175 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 13:03:18] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 13:03:18] [INFO ] [Nat]Absence check using 175 positive place invariants in 26 ms returned sat
[2023-03-22 13:03:18] [INFO ] [Nat]Absence check using 175 positive and 5 generalized place invariants in 14 ms returned sat
[2023-03-22 13:03:19] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 13:03:19] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-22 13:03:19] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-22 13:03:19] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2023-03-22 13:03:19] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2023-03-22 13:03:19] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2023-03-22 13:03:20] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2023-03-22 13:03:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 954 ms
[2023-03-22 13:03:20] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2023-03-22 13:03:20] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2023-03-22 13:03:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2023-03-22 13:03:21] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2023-03-22 13:03:21] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-22 13:03:21] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2023-03-22 13:03:21] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2023-03-22 13:03:21] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-22 13:03:21] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-22 13:03:21] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2023-03-22 13:03:21] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-22 13:03:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1271 ms
[2023-03-22 13:03:22] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-22 13:03:22] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-22 13:03:22] [INFO ] Deduced a trap composed of 6 places in 381 ms of which 0 ms to minimize.
[2023-03-22 13:03:23] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2023-03-22 13:03:23] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 3 ms to minimize.
[2023-03-22 13:03:23] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2023-03-22 13:03:23] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-22 13:03:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1496 ms
[2023-03-22 13:03:23] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2023-03-22 13:03:23] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-22 13:03:23] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:03:24] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2023-03-22 13:03:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 531 ms
[2023-03-22 13:03:24] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 11 ms to minimize.
[2023-03-22 13:03:24] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2023-03-22 13:03:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2023-03-22 13:03:24] [INFO ] After 5798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 399 ms.
[2023-03-22 13:03:25] [INFO ] After 6381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 261 ms.
Support contains 32 out of 521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 502/502 transitions.
Applied a total of 0 rules in 14 ms. Remains 521 /521 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 521/521 places, 502/502 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 502/502 transitions.
Applied a total of 0 rules in 16 ms. Remains 521 /521 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-22 13:03:25] [INFO ] Invariant cache hit.
[2023-03-22 13:03:25] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-22 13:03:25] [INFO ] Invariant cache hit.
[2023-03-22 13:03:26] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2023-03-22 13:03:26] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-22 13:03:26] [INFO ] Invariant cache hit.
[2023-03-22 13:03:26] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1571 ms. Remains : 521/521 places, 502/502 transitions.
Applied a total of 0 rules in 10 ms. Remains 521 /521 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-22 13:03:26] [INFO ] Invariant cache hit.
[2023-03-22 13:03:27] [INFO ] [Real]Absence check using 175 positive place invariants in 36 ms returned sat
[2023-03-22 13:03:27] [INFO ] [Real]Absence check using 175 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 13:03:27] [INFO ] After 752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 13:03:27] [INFO ] [Nat]Absence check using 175 positive place invariants in 34 ms returned sat
[2023-03-22 13:03:27] [INFO ] [Nat]Absence check using 175 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 13:03:28] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 13:03:28] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-22 13:03:28] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2023-03-22 13:03:28] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-22 13:03:28] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2023-03-22 13:03:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 416 ms
[2023-03-22 13:03:29] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-22 13:03:29] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:03:29] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2023-03-22 13:03:29] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2023-03-22 13:03:29] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 1 ms to minimize.
[2023-03-22 13:03:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 843 ms
[2023-03-22 13:03:30] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-22 13:03:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-22 13:03:30] [INFO ] Deduced a trap composed of 14 places in 345 ms of which 0 ms to minimize.
[2023-03-22 13:03:30] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-22 13:03:30] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2023-03-22 13:03:31] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2023-03-22 13:03:31] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-22 13:03:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1029 ms
[2023-03-22 13:03:31] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-22 13:03:31] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-22 13:03:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2023-03-22 13:03:31] [INFO ] After 3808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 312 ms.
[2023-03-22 13:03:32] [INFO ] After 4411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-22 13:03:32] [INFO ] Flatten gal took : 50 ms
[2023-03-22 13:03:32] [INFO ] Flatten gal took : 63 ms
[2023-03-22 13:03:32] [INFO ] Input system was already deterministic with 1072 transitions.
Computed a total of 257 stabilizing places and 257 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1066 transition count 1046
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1066 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1065 transition count 1045
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1065 transition count 1045
Applied a total of 54 rules in 65 ms. Remains 1065 /1092 variables (removed 27) and now considering 1045/1072 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 1065/1092 places, 1045/1072 transitions.
[2023-03-22 13:03:32] [INFO ] Flatten gal took : 35 ms
[2023-03-22 13:03:32] [INFO ] Flatten gal took : 49 ms
[2023-03-22 13:03:32] [INFO ] Input system was already deterministic with 1045 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1091 transition count 970
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 990 transition count 970
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 990 transition count 869
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 889 transition count 869
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 432 place count 861 transition count 841
Iterating global reduction 2 with 28 rules applied. Total rules applied 460 place count 861 transition count 841
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 460 place count 861 transition count 826
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 490 place count 846 transition count 826
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Deduced a syphon composed of 343 places in 0 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 1176 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1178 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1179 place count 500 transition count 481
Applied a total of 1179 rules in 172 ms. Remains 500 /1092 variables (removed 592) and now considering 481/1072 (removed 591) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 172 ms. Remains : 500/1092 places, 481/1072 transitions.
[2023-03-22 13:03:32] [INFO ] Flatten gal took : 30 ms
[2023-03-22 13:03:32] [INFO ] Flatten gal took : 33 ms
[2023-03-22 13:03:32] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1091 transition count 971
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 991 transition count 971
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 991 transition count 870
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 890 transition count 870
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 431 place count 861 transition count 841
Iterating global reduction 2 with 29 rules applied. Total rules applied 460 place count 861 transition count 841
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 460 place count 861 transition count 826
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 490 place count 846 transition count 826
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 2 with 684 rules applied. Total rules applied 1174 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1176 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1177 place count 501 transition count 482
Applied a total of 1177 rules in 101 ms. Remains 501 /1092 variables (removed 591) and now considering 482/1072 (removed 590) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 501/1092 places, 482/1072 transitions.
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 18 ms
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 19 ms
[2023-03-22 13:03:33] [INFO ] Input system was already deterministic with 482 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1064 transition count 1044
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1064 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1063 transition count 1043
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1063 transition count 1043
Applied a total of 58 rules in 69 ms. Remains 1063 /1092 variables (removed 29) and now considering 1043/1072 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 1063/1092 places, 1043/1072 transitions.
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 30 ms
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 31 ms
[2023-03-22 13:03:33] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1066 transition count 1046
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1066 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1065 transition count 1045
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1065 transition count 1045
Applied a total of 54 rules in 63 ms. Remains 1065 /1092 variables (removed 27) and now considering 1045/1072 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 1065/1092 places, 1045/1072 transitions.
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 28 ms
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 30 ms
[2023-03-22 13:03:33] [INFO ] Input system was already deterministic with 1045 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1091 transition count 972
Reduce places removed 99 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 100 rules applied. Total rules applied 199 place count 992 transition count 971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 991 transition count 971
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 200 place count 991 transition count 869
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 404 place count 889 transition count 869
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 433 place count 860 transition count 840
Iterating global reduction 3 with 29 rules applied. Total rules applied 462 place count 860 transition count 840
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 462 place count 860 transition count 826
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 490 place count 846 transition count 826
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 3 with 684 rules applied. Total rules applied 1174 place count 504 transition count 484
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 1176 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1177 place count 501 transition count 482
Applied a total of 1177 rules in 100 ms. Remains 501 /1092 variables (removed 591) and now considering 482/1072 (removed 590) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 100 ms. Remains : 501/1092 places, 482/1072 transitions.
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 17 ms
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 17 ms
[2023-03-22 13:03:33] [INFO ] Input system was already deterministic with 482 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1091 transition count 970
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 990 transition count 970
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 990 transition count 869
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 889 transition count 869
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 433 place count 860 transition count 840
Iterating global reduction 2 with 29 rules applied. Total rules applied 462 place count 860 transition count 840
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 462 place count 860 transition count 825
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 492 place count 845 transition count 825
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 2 with 684 rules applied. Total rules applied 1176 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1178 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1179 place count 500 transition count 481
Applied a total of 1179 rules in 115 ms. Remains 500 /1092 variables (removed 592) and now considering 481/1072 (removed 591) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 127 ms. Remains : 500/1092 places, 481/1072 transitions.
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 16 ms
[2023-03-22 13:03:33] [INFO ] Flatten gal took : 17 ms
[2023-03-22 13:03:33] [INFO ] Input system was already deterministic with 481 transitions.
Finished random walk after 691 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=138 )
FORMULA ShieldIIPs-PT-020B-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1069 transition count 1049
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1069 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1068 transition count 1048
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1068 transition count 1048
Applied a total of 48 rules in 71 ms. Remains 1068 /1092 variables (removed 24) and now considering 1048/1072 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 1068/1092 places, 1048/1072 transitions.
[2023-03-22 13:03:34] [INFO ] Flatten gal took : 27 ms
[2023-03-22 13:03:34] [INFO ] Flatten gal took : 28 ms
[2023-03-22 13:03:34] [INFO ] Input system was already deterministic with 1048 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1064 transition count 1044
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1064 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1063 transition count 1043
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1063 transition count 1043
Applied a total of 58 rules in 64 ms. Remains 1063 /1092 variables (removed 29) and now considering 1043/1072 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 1063/1092 places, 1043/1072 transitions.
[2023-03-22 13:03:34] [INFO ] Flatten gal took : 37 ms
[2023-03-22 13:03:34] [INFO ] Flatten gal took : 27 ms
[2023-03-22 13:03:34] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1068 transition count 1048
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1068 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1067 transition count 1047
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1067 transition count 1047
Applied a total of 50 rules in 61 ms. Remains 1067 /1092 variables (removed 25) and now considering 1047/1072 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 1067/1092 places, 1047/1072 transitions.
[2023-03-22 13:03:34] [INFO ] Flatten gal took : 62 ms
[2023-03-22 13:03:34] [INFO ] Flatten gal took : 30 ms
[2023-03-22 13:03:34] [INFO ] Input system was already deterministic with 1047 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 1091 transition count 974
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 994 transition count 974
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 194 place count 994 transition count 874
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 394 place count 894 transition count 874
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 421 place count 867 transition count 847
Iterating global reduction 2 with 27 rules applied. Total rules applied 448 place count 867 transition count 847
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 448 place count 867 transition count 834
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 474 place count 854 transition count 834
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 1 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 2 with 670 rules applied. Total rules applied 1144 place count 519 transition count 499
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1146 place count 517 transition count 497
Applied a total of 1146 rules in 115 ms. Remains 517 /1092 variables (removed 575) and now considering 497/1072 (removed 575) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 115 ms. Remains : 517/1092 places, 497/1072 transitions.
[2023-03-22 13:03:34] [INFO ] Flatten gal took : 16 ms
[2023-03-22 13:03:34] [INFO ] Flatten gal took : 28 ms
[2023-03-22 13:03:34] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1066 transition count 1046
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1066 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1065 transition count 1045
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1065 transition count 1045
Applied a total of 54 rules in 121 ms. Remains 1065 /1092 variables (removed 27) and now considering 1045/1072 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 1065/1092 places, 1045/1072 transitions.
[2023-03-22 13:03:34] [INFO ] Flatten gal took : 26 ms
[2023-03-22 13:03:35] [INFO ] Flatten gal took : 26 ms
[2023-03-22 13:03:35] [INFO ] Input system was already deterministic with 1045 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1065 transition count 1045
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1065 transition count 1045
Applied a total of 54 rules in 40 ms. Remains 1065 /1092 variables (removed 27) and now considering 1045/1072 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 1065/1092 places, 1045/1072 transitions.
[2023-03-22 13:03:35] [INFO ] Flatten gal took : 27 ms
[2023-03-22 13:03:35] [INFO ] Flatten gal took : 26 ms
[2023-03-22 13:03:35] [INFO ] Input system was already deterministic with 1045 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1091 transition count 975
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 97 rules applied. Total rules applied 193 place count 995 transition count 974
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 194 place count 994 transition count 974
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 194 place count 994 transition count 873
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 396 place count 893 transition count 873
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 423 place count 866 transition count 846
Iterating global reduction 3 with 27 rules applied. Total rules applied 450 place count 866 transition count 846
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 450 place count 866 transition count 833
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 476 place count 853 transition count 833
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 1156 place count 513 transition count 493
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1158 place count 511 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1159 place count 510 transition count 491
Applied a total of 1159 rules in 151 ms. Remains 510 /1092 variables (removed 582) and now considering 491/1072 (removed 581) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 152 ms. Remains : 510/1092 places, 491/1072 transitions.
[2023-03-22 13:03:35] [INFO ] Flatten gal took : 29 ms
[2023-03-22 13:03:35] [INFO ] Flatten gal took : 21 ms
[2023-03-22 13:03:35] [INFO ] Input system was already deterministic with 491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1065 transition count 1045
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1064 transition count 1044
Applied a total of 56 rules in 70 ms. Remains 1064 /1092 variables (removed 28) and now considering 1044/1072 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 1064/1092 places, 1044/1072 transitions.
[2023-03-22 13:03:35] [INFO ] Flatten gal took : 25 ms
[2023-03-22 13:03:35] [INFO ] Flatten gal took : 63 ms
[2023-03-22 13:03:35] [INFO ] Input system was already deterministic with 1044 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1092/1092 places, 1072/1072 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1065 transition count 1045
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1064 transition count 1044
Applied a total of 56 rules in 67 ms. Remains 1064 /1092 variables (removed 28) and now considering 1044/1072 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 1064/1092 places, 1044/1072 transitions.
[2023-03-22 13:03:35] [INFO ] Flatten gal took : 29 ms
[2023-03-22 13:03:35] [INFO ] Flatten gal took : 27 ms
[2023-03-22 13:03:36] [INFO ] Input system was already deterministic with 1044 transitions.
[2023-03-22 13:03:36] [INFO ] Flatten gal took : 27 ms
[2023-03-22 13:03:36] [INFO ] Flatten gal took : 30 ms
[2023-03-22 13:03:36] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 13:03:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1092 places, 1072 transitions and 3344 arcs took 6 ms.
Total runtime 69581 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 1092 NrTr: 1072 NrArc: 3344)

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

net check time: 0m 0.000sec

init dd package: 0m 2.932sec


before gc: list nodes free: 1002797

after gc: idd nodes used:31896833, unused:32103167; list nodes free:144399341

before gc: list nodes free: 1427462

after gc: idd nodes used:45120982, unused:18879018; list nodes free:88806490

RS generation: 23m26.869sec


-> last computed set: #nodes 45119892 (4.5e+07) #states 183,276,919,754,216 (14)


CANNOT_COMPUTE


BK_STOP 1679491667930

--------------------
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:
++ 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
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.004sec

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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