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.r393-oct2-167903717100506.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 ltsminxred
Input is ShieldPPPs-PT-050B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 888K 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 ShieldPPPs-PT-050B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679456272746

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:37:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 03:37:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:37:55] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2023-03-22 03:37:55] [INFO ] Transformed 3403 places.
[2023-03-22 03:37:55] [INFO ] Transformed 3153 transitions.
[2023-03-22 03:37:55] [INFO ] Found NUPN structural information;
[2023-03-22 03:37:55] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 141 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 3082 transition count 2832
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 3082 transition count 2832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 3081 transition count 2831
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 3081 transition count 2831
Applied a total of 644 rules in 973 ms. Remains 3081 /3403 variables (removed 322) and now considering 2831/3153 (removed 322) transitions.
// Phase 1: matrix 2831 rows 3081 cols
[2023-03-22 03:37:56] [INFO ] Computed 551 place invariants in 37 ms
[2023-03-22 03:37:57] [INFO ] Implicit Places using invariants in 1458 ms returned []
[2023-03-22 03:37:57] [INFO ] Invariant cache hit.
[2023-03-22 03:38:01] [INFO ] Implicit Places using invariants and state equation in 4088 ms returned []
Implicit Place search using SMT with State Equation took 5611 ms to find 0 implicit places.
[2023-03-22 03:38:01] [INFO ] Invariant cache hit.
[2023-03-22 03:38:03] [INFO ] Dead Transitions using invariants and state equation in 2033 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3081/3403 places, 2831/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8621 ms. Remains : 3081/3403 places, 2831/3153 transitions.
Support contains 141 out of 3081 places after structural reductions.
[2023-03-22 03:38:04] [INFO ] Flatten gal took : 181 ms
[2023-03-22 03:38:04] [INFO ] Flatten gal took : 119 ms
[2023-03-22 03:38:04] [INFO ] Input system was already deterministic with 2831 transitions.
Support contains 128 out of 3081 places (down from 141) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 81) seen :52
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Running SMT prover for 29 properties.
[2023-03-22 03:38:05] [INFO ] Invariant cache hit.
[2023-03-22 03:38:07] [INFO ] [Real]Absence check using 551 positive place invariants in 256 ms returned sat
[2023-03-22 03:38:09] [INFO ] After 3761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-22 03:38:10] [INFO ] [Nat]Absence check using 551 positive place invariants in 279 ms returned sat
[2023-03-22 03:38:17] [INFO ] After 5322ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :28
[2023-03-22 03:38:18] [INFO ] Deduced a trap composed of 19 places in 863 ms of which 5 ms to minimize.
[2023-03-22 03:38:19] [INFO ] Deduced a trap composed of 19 places in 1069 ms of which 2 ms to minimize.
[2023-03-22 03:38:20] [INFO ] Deduced a trap composed of 13 places in 1053 ms of which 3 ms to minimize.
[2023-03-22 03:38:21] [INFO ] Deduced a trap composed of 18 places in 1002 ms of which 14 ms to minimize.
[2023-03-22 03:38:22] [INFO ] Deduced a trap composed of 23 places in 961 ms of which 3 ms to minimize.
[2023-03-22 03:38:23] [INFO ] Deduced a trap composed of 23 places in 906 ms of which 2 ms to minimize.
[2023-03-22 03:38:24] [INFO ] Deduced a trap composed of 17 places in 923 ms of which 1 ms to minimize.
[2023-03-22 03:38:25] [INFO ] Deduced a trap composed of 32 places in 911 ms of which 1 ms to minimize.
[2023-03-22 03:38:26] [INFO ] Deduced a trap composed of 29 places in 895 ms of which 2 ms to minimize.
[2023-03-22 03:38:27] [INFO ] Deduced a trap composed of 18 places in 838 ms of which 2 ms to minimize.
[2023-03-22 03:38:28] [INFO ] Deduced a trap composed of 28 places in 869 ms of which 2 ms to minimize.
[2023-03-22 03:38:29] [INFO ] Deduced a trap composed of 16 places in 783 ms of which 2 ms to minimize.
[2023-03-22 03:38:30] [INFO ] Deduced a trap composed of 24 places in 779 ms of which 2 ms to minimize.
[2023-03-22 03:38:31] [INFO ] Deduced a trap composed of 17 places in 751 ms of which 2 ms to minimize.
[2023-03-22 03:38:32] [INFO ] Deduced a trap composed of 27 places in 710 ms of which 2 ms to minimize.
[2023-03-22 03:38:33] [INFO ] Deduced a trap composed of 20 places in 914 ms of which 2 ms to minimize.
[2023-03-22 03:38:34] [INFO ] Deduced a trap composed of 37 places in 769 ms of which 2 ms to minimize.
[2023-03-22 03:38:34] [INFO ] Deduced a trap composed of 40 places in 710 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 03:38:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:38:34] [INFO ] After 25648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:29
Fused 29 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 2970 ms.
Support contains 46 out of 3081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Drop transitions removed 344 transitions
Trivial Post-agglo rules discarded 344 transitions
Performed 344 trivial Post agglomeration. Transition count delta: 344
Iterating post reduction 0 with 344 rules applied. Total rules applied 344 place count 3081 transition count 2487
Reduce places removed 344 places and 0 transitions.
Iterating post reduction 1 with 344 rules applied. Total rules applied 688 place count 2737 transition count 2487
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 688 place count 2737 transition count 2239
Deduced a syphon composed of 248 places in 6 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 1184 place count 2489 transition count 2239
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1205 place count 2468 transition count 2218
Iterating global reduction 2 with 21 rules applied. Total rules applied 1226 place count 2468 transition count 2218
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1226 place count 2468 transition count 2207
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1248 place count 2457 transition count 2207
Performed 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 5 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 2 with 1734 rules applied. Total rules applied 2982 place count 1590 transition count 1340
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 432 times.
Drop transitions removed 432 transitions
Iterating global reduction 2 with 432 rules applied. Total rules applied 3414 place count 1590 transition count 1340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3415 place count 1589 transition count 1339
Applied a total of 3415 rules in 836 ms. Remains 1589 /3081 variables (removed 1492) and now considering 1339/2831 (removed 1492) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 837 ms. Remains : 1589/3081 places, 1339/2831 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 28) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1339 rows 1589 cols
[2023-03-22 03:38:39] [INFO ] Computed 551 place invariants in 56 ms
[2023-03-22 03:38:40] [INFO ] [Real]Absence check using 528 positive place invariants in 132 ms returned sat
[2023-03-22 03:38:40] [INFO ] [Real]Absence check using 528 positive and 23 generalized place invariants in 17 ms returned sat
[2023-03-22 03:38:41] [INFO ] After 1557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 03:38:41] [INFO ] [Nat]Absence check using 528 positive place invariants in 128 ms returned sat
[2023-03-22 03:38:41] [INFO ] [Nat]Absence check using 528 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-22 03:38:42] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 03:38:42] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2023-03-22 03:38:42] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-22 03:38:43] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 0 ms to minimize.
[2023-03-22 03:38:43] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-22 03:38:43] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-22 03:38:43] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-22 03:38:43] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2023-03-22 03:38:44] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-22 03:38:44] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-22 03:38:44] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2023-03-22 03:38:44] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-22 03:38:44] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-22 03:38:45] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2023-03-22 03:38:45] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2023-03-22 03:38:45] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2023-03-22 03:38:45] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 13 ms to minimize.
[2023-03-22 03:38:45] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2023-03-22 03:38:45] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-22 03:38:46] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-22 03:38:46] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-22 03:38:46] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-03-22 03:38:46] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2023-03-22 03:38:46] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-22 03:38:46] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4181 ms
[2023-03-22 03:38:46] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-22 03:38:47] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2023-03-22 03:38:47] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 13 ms to minimize.
[2023-03-22 03:38:47] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-22 03:38:47] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-03-22 03:38:47] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2023-03-22 03:38:48] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2023-03-22 03:38:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1359 ms
[2023-03-22 03:38:48] [INFO ] After 6575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 204 ms.
[2023-03-22 03:38:48] [INFO ] After 7293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 7 out of 1589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1589/1589 places, 1339/1339 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1589 transition count 1338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1588 transition count 1338
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 1588 transition count 1333
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 1583 transition count 1333
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 54 place count 1562 transition count 1312
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 64 place count 1562 transition count 1312
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 1557 transition count 1307
Applied a total of 69 rules in 230 ms. Remains 1557 /1589 variables (removed 32) and now considering 1307/1339 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 1557/1589 places, 1307/1339 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 111798 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{0=1, 1=1, 2=1, 3=1}
Probabilistic random walk after 111798 steps, saw 103294 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 1307 rows 1557 cols
[2023-03-22 03:38:52] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-22 03:38:52] [INFO ] [Real]Absence check using 518 positive place invariants in 70 ms returned sat
[2023-03-22 03:38:52] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 5 ms returned sat
[2023-03-22 03:38:53] [INFO ] After 724ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 03:38:53] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2023-03-22 03:38:53] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 13 ms to minimize.
[2023-03-22 03:38:54] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2023-03-22 03:38:54] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2023-03-22 03:38:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2023-03-22 03:38:54] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-22 03:38:54] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 7 ms to minimize.
[2023-03-22 03:38:54] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-22 03:38:54] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 03:38:54] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-22 03:38:55] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-22 03:38:55] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2023-03-22 03:38:55] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-22 03:38:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1903 ms
[2023-03-22 03:38:55] [INFO ] After 2662ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:38:55] [INFO ] After 2930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:38:55] [INFO ] [Nat]Absence check using 518 positive place invariants in 96 ms returned sat
[2023-03-22 03:38:55] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 8 ms returned sat
[2023-03-22 03:38:56] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:38:56] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-22 03:38:56] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 2 ms to minimize.
[2023-03-22 03:38:56] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2023-03-22 03:38:57] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2023-03-22 03:38:57] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-22 03:38:57] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2023-03-22 03:38:57] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 14 ms to minimize.
[2023-03-22 03:38:57] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 13 ms to minimize.
[2023-03-22 03:38:57] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2023-03-22 03:38:57] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2023-03-22 03:38:58] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2023-03-22 03:38:58] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-22 03:38:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-22 03:38:58] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2023-03-22 03:38:58] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 03:38:58] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-22 03:38:58] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2023-03-22 03:38:58] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2023-03-22 03:38:59] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2023-03-22 03:38:59] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-22 03:38:59] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2023-03-22 03:38:59] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-22 03:38:59] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-22 03:38:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-22 03:38:59] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3301 ms
[2023-03-22 03:38:59] [INFO ] After 4095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 03:38:59] [INFO ] After 4447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 1557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1557/1557 places, 1307/1307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1557 transition count 1306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1556 transition count 1306
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1556 transition count 1304
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1554 transition count 1304
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 1551 transition count 1301
Applied a total of 13 rules in 168 ms. Remains 1551 /1557 variables (removed 6) and now considering 1301/1307 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 1551/1557 places, 1301/1307 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 177949 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 177949 steps, saw 167377 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:39:03] [INFO ] Computed 551 place invariants in 12 ms
[2023-03-22 03:39:03] [INFO ] [Real]Absence check using 525 positive place invariants in 78 ms returned sat
[2023-03-22 03:39:03] [INFO ] [Real]Absence check using 525 positive and 26 generalized place invariants in 4 ms returned sat
[2023-03-22 03:39:04] [INFO ] After 896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:39:04] [INFO ] [Nat]Absence check using 525 positive place invariants in 88 ms returned sat
[2023-03-22 03:39:04] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-22 03:39:04] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:39:05] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-22 03:39:05] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-22 03:39:05] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2023-03-22 03:39:05] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-22 03:39:05] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-22 03:39:06] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-22 03:39:06] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2023-03-22 03:39:06] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2023-03-22 03:39:06] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-22 03:39:06] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2023-03-22 03:39:06] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-22 03:39:06] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2023-03-22 03:39:07] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-22 03:39:07] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2023-03-22 03:39:07] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2023-03-22 03:39:07] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2023-03-22 03:39:07] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2373 ms
[2023-03-22 03:39:07] [INFO ] After 3029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-22 03:39:07] [INFO ] After 3350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 92 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 51 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:39:07] [INFO ] Invariant cache hit.
[2023-03-22 03:39:08] [INFO ] Implicit Places using invariants in 956 ms returned []
[2023-03-22 03:39:08] [INFO ] Invariant cache hit.
[2023-03-22 03:39:10] [INFO ] Implicit Places using invariants and state equation in 1893 ms returned []
Implicit Place search using SMT with State Equation took 2853 ms to find 0 implicit places.
[2023-03-22 03:39:10] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-22 03:39:10] [INFO ] Invariant cache hit.
[2023-03-22 03:39:11] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3656 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 56 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 03:39:11] [INFO ] Invariant cache hit.
[2023-03-22 03:39:11] [INFO ] [Real]Absence check using 525 positive place invariants in 114 ms returned sat
[2023-03-22 03:39:11] [INFO ] [Real]Absence check using 525 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-22 03:39:12] [INFO ] After 698ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 03:39:12] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-22 03:39:12] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2023-03-22 03:39:13] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2023-03-22 03:39:13] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-22 03:39:13] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2023-03-22 03:39:13] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-22 03:39:13] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-22 03:39:14] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2023-03-22 03:39:14] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2023-03-22 03:39:14] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-22 03:39:14] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
[2023-03-22 03:39:14] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-22 03:39:15] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2023-03-22 03:39:15] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-22 03:39:15] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-22 03:39:15] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-22 03:39:15] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2023-03-22 03:39:15] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2023-03-22 03:39:16] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2023-03-22 03:39:16] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-22 03:39:16] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2023-03-22 03:39:16] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2023-03-22 03:39:16] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2023-03-22 03:39:16] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4350 ms
[2023-03-22 03:39:16] [INFO ] After 5103ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:39:16] [INFO ] After 5437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:39:17] [INFO ] [Nat]Absence check using 525 positive place invariants in 99 ms returned sat
[2023-03-22 03:39:17] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 38 ms returned sat
[2023-03-22 03:39:17] [INFO ] After 770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:39:18] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-22 03:39:18] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 0 ms to minimize.
[2023-03-22 03:39:18] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-22 03:39:18] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2023-03-22 03:39:18] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2023-03-22 03:39:18] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-22 03:39:19] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2023-03-22 03:39:19] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2023-03-22 03:39:19] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-22 03:39:19] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-22 03:39:19] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-22 03:39:19] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2023-03-22 03:39:20] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2023-03-22 03:39:20] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-22 03:39:20] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 14 ms to minimize.
[2023-03-22 03:39:20] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2023-03-22 03:39:20] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-22 03:39:20] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2023-03-22 03:39:20] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2023-03-22 03:39:20] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2023-03-22 03:39:20] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2023-03-22 03:39:21] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 26 ms to minimize.
[2023-03-22 03:39:21] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2023-03-22 03:39:21] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-22 03:39:21] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3482 ms
[2023-03-22 03:39:21] [INFO ] After 4308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 03:39:21] [INFO ] After 4687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-22 03:39:21] [INFO ] Flatten gal took : 91 ms
[2023-03-22 03:39:21] [INFO ] Flatten gal took : 108 ms
[2023-03-22 03:39:21] [INFO ] Input system was already deterministic with 2831 transitions.
Computed a total of 619 stabilizing places and 619 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 3080 transition count 2482
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 2732 transition count 2482
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 696 place count 2732 transition count 2232
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1196 place count 2482 transition count 2232
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 1223 place count 2455 transition count 2205
Iterating global reduction 2 with 27 rules applied. Total rules applied 1250 place count 2455 transition count 2205
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1250 place count 2455 transition count 2193
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1274 place count 2443 transition count 2193
Performed 880 Post agglomeration using F-continuation condition.Transition count delta: 880
Deduced a syphon composed of 880 places in 2 ms
Reduce places removed 880 places and 0 transitions.
Iterating global reduction 2 with 1760 rules applied. Total rules applied 3034 place count 1563 transition count 1313
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 3036 place count 1561 transition count 1311
Applied a total of 3036 rules in 629 ms. Remains 1561 /3081 variables (removed 1520) and now considering 1311/2831 (removed 1520) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 629 ms. Remains : 1561/3081 places, 1311/2831 transitions.
[2023-03-22 03:39:22] [INFO ] Flatten gal took : 44 ms
[2023-03-22 03:39:22] [INFO ] Flatten gal took : 46 ms
[2023-03-22 03:39:22] [INFO ] Input system was already deterministic with 1311 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 702 place count 2729 transition count 2230
Deduced a syphon composed of 249 places in 5 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 1200 place count 2480 transition count 2230
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 1227 place count 2453 transition count 2203
Iterating global reduction 2 with 27 rules applied. Total rules applied 1254 place count 2453 transition count 2203
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1254 place count 2453 transition count 2191
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1278 place count 2441 transition count 2191
Performed 886 Post agglomeration using F-continuation condition.Transition count delta: 886
Deduced a syphon composed of 886 places in 2 ms
Reduce places removed 886 places and 0 transitions.
Iterating global reduction 2 with 1772 rules applied. Total rules applied 3050 place count 1555 transition count 1305
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 3052 place count 1553 transition count 1303
Applied a total of 3052 rules in 595 ms. Remains 1553 /3081 variables (removed 1528) and now considering 1303/2831 (removed 1528) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 595 ms. Remains : 1553/3081 places, 1303/2831 transitions.
[2023-03-22 03:39:23] [INFO ] Flatten gal took : 39 ms
[2023-03-22 03:39:23] [INFO ] Flatten gal took : 43 ms
[2023-03-22 03:39:23] [INFO ] Input system was already deterministic with 1303 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2729 transition count 2229
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1230 place count 2451 transition count 2201
Iterating global reduction 2 with 28 rules applied. Total rules applied 1258 place count 2451 transition count 2201
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1258 place count 2451 transition count 2189
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1282 place count 2439 transition count 2189
Performed 885 Post agglomeration using F-continuation condition.Transition count delta: 885
Deduced a syphon composed of 885 places in 2 ms
Reduce places removed 885 places and 0 transitions.
Iterating global reduction 2 with 1770 rules applied. Total rules applied 3052 place count 1554 transition count 1304
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 3054 place count 1552 transition count 1302
Applied a total of 3054 rules in 549 ms. Remains 1552 /3081 variables (removed 1529) and now considering 1302/2831 (removed 1529) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 549 ms. Remains : 1552/3081 places, 1302/2831 transitions.
[2023-03-22 03:39:24] [INFO ] Flatten gal took : 38 ms
[2023-03-22 03:39:24] [INFO ] Flatten gal took : 40 ms
[2023-03-22 03:39:24] [INFO ] Input system was already deterministic with 1302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3057 transition count 2807
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3057 transition count 2807
Applied a total of 48 rules in 460 ms. Remains 3057 /3081 variables (removed 24) and now considering 2807/2831 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 3057/3081 places, 2807/2831 transitions.
[2023-03-22 03:39:24] [INFO ] Flatten gal took : 71 ms
[2023-03-22 03:39:24] [INFO ] Flatten gal took : 75 ms
[2023-03-22 03:39:25] [INFO ] Input system was already deterministic with 2807 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 702 place count 2729 transition count 2228
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1204 place count 2478 transition count 2228
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1232 place count 2450 transition count 2200
Iterating global reduction 2 with 28 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2187
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1286 place count 2437 transition count 2187
Performed 880 Post agglomeration using F-continuation condition.Transition count delta: 880
Deduced a syphon composed of 880 places in 2 ms
Reduce places removed 880 places and 0 transitions.
Iterating global reduction 2 with 1760 rules applied. Total rules applied 3046 place count 1557 transition count 1307
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 3048 place count 1555 transition count 1305
Applied a total of 3048 rules in 533 ms. Remains 1555 /3081 variables (removed 1526) and now considering 1305/2831 (removed 1526) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 533 ms. Remains : 1555/3081 places, 1305/2831 transitions.
[2023-03-22 03:39:25] [INFO ] Flatten gal took : 36 ms
[2023-03-22 03:39:25] [INFO ] Flatten gal took : 39 ms
[2023-03-22 03:39:25] [INFO ] Input system was already deterministic with 1305 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 702 place count 2729 transition count 2228
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1204 place count 2478 transition count 2228
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1233 place count 2449 transition count 2199
Iterating global reduction 2 with 29 rules applied. Total rules applied 1262 place count 2449 transition count 2199
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1262 place count 2449 transition count 2186
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1288 place count 2436 transition count 2186
Performed 883 Post agglomeration using F-continuation condition.Transition count delta: 883
Deduced a syphon composed of 883 places in 1 ms
Reduce places removed 883 places and 0 transitions.
Iterating global reduction 2 with 1766 rules applied. Total rules applied 3054 place count 1553 transition count 1303
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 3056 place count 1551 transition count 1301
Applied a total of 3056 rules in 610 ms. Remains 1551 /3081 variables (removed 1530) and now considering 1301/2831 (removed 1530) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 610 ms. Remains : 1551/3081 places, 1301/2831 transitions.
[2023-03-22 03:39:26] [INFO ] Flatten gal took : 36 ms
[2023-03-22 03:39:26] [INFO ] Flatten gal took : 40 ms
[2023-03-22 03:39:26] [INFO ] Input system was already deterministic with 1301 transitions.
Finished random walk after 1062 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=96 )
FORMULA ShieldPPPs-PT-050B-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3053 transition count 2803
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3053 transition count 2803
Applied a total of 56 rules in 447 ms. Remains 3053 /3081 variables (removed 28) and now considering 2803/2831 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 3053/3081 places, 2803/2831 transitions.
[2023-03-22 03:39:27] [INFO ] Flatten gal took : 64 ms
[2023-03-22 03:39:27] [INFO ] Flatten gal took : 69 ms
[2023-03-22 03:39:27] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 3055 transition count 2805
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 3055 transition count 2805
Applied a total of 52 rules in 463 ms. Remains 3055 /3081 variables (removed 26) and now considering 2805/2831 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 3055/3081 places, 2805/2831 transitions.
[2023-03-22 03:39:27] [INFO ] Flatten gal took : 70 ms
[2023-03-22 03:39:27] [INFO ] Flatten gal took : 75 ms
[2023-03-22 03:39:28] [INFO ] Input system was already deterministic with 2805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 3054 transition count 2804
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 3054 transition count 2804
Applied a total of 54 rules in 401 ms. Remains 3054 /3081 variables (removed 27) and now considering 2804/2831 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 3054/3081 places, 2804/2831 transitions.
[2023-03-22 03:39:28] [INFO ] Flatten gal took : 62 ms
[2023-03-22 03:39:28] [INFO ] Flatten gal took : 67 ms
[2023-03-22 03:39:28] [INFO ] Input system was already deterministic with 2804 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 702 place count 2729 transition count 2228
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1204 place count 2478 transition count 2228
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1232 place count 2450 transition count 2200
Iterating global reduction 2 with 28 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2187
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1286 place count 2437 transition count 2187
Performed 879 Post agglomeration using F-continuation condition.Transition count delta: 879
Deduced a syphon composed of 879 places in 2 ms
Reduce places removed 879 places and 0 transitions.
Iterating global reduction 2 with 1758 rules applied. Total rules applied 3044 place count 1558 transition count 1308
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 3046 place count 1556 transition count 1306
Applied a total of 3046 rules in 538 ms. Remains 1556 /3081 variables (removed 1525) and now considering 1306/2831 (removed 1525) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 539 ms. Remains : 1556/3081 places, 1306/2831 transitions.
[2023-03-22 03:39:29] [INFO ] Flatten gal took : 34 ms
[2023-03-22 03:39:29] [INFO ] Flatten gal took : 37 ms
[2023-03-22 03:39:29] [INFO ] Input system was already deterministic with 1306 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2729 transition count 2229
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1231 place count 2450 transition count 2200
Iterating global reduction 2 with 29 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2187
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1286 place count 2437 transition count 2187
Performed 880 Post agglomeration using F-continuation condition.Transition count delta: 880
Deduced a syphon composed of 880 places in 2 ms
Reduce places removed 880 places and 0 transitions.
Iterating global reduction 2 with 1760 rules applied. Total rules applied 3046 place count 1557 transition count 1307
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 3048 place count 1555 transition count 1305
Applied a total of 3048 rules in 679 ms. Remains 1555 /3081 variables (removed 1526) and now considering 1305/2831 (removed 1526) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 679 ms. Remains : 1555/3081 places, 1305/2831 transitions.
[2023-03-22 03:39:30] [INFO ] Flatten gal took : 34 ms
[2023-03-22 03:39:30] [INFO ] Flatten gal took : 38 ms
[2023-03-22 03:39:30] [INFO ] Input system was already deterministic with 1305 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3053 transition count 2803
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3053 transition count 2803
Applied a total of 56 rules in 411 ms. Remains 3053 /3081 variables (removed 28) and now considering 2803/2831 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 3053/3081 places, 2803/2831 transitions.
[2023-03-22 03:39:30] [INFO ] Flatten gal took : 60 ms
[2023-03-22 03:39:30] [INFO ] Flatten gal took : 65 ms
[2023-03-22 03:39:31] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3080 transition count 2480
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2730 transition count 2480
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 700 place count 2730 transition count 2229
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 1228 place count 2453 transition count 2203
Iterating global reduction 2 with 26 rules applied. Total rules applied 1254 place count 2453 transition count 2203
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1254 place count 2453 transition count 2192
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1276 place count 2442 transition count 2192
Performed 876 Post agglomeration using F-continuation condition.Transition count delta: 876
Deduced a syphon composed of 876 places in 2 ms
Reduce places removed 876 places and 0 transitions.
Iterating global reduction 2 with 1752 rules applied. Total rules applied 3028 place count 1566 transition count 1316
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 3030 place count 1564 transition count 1314
Applied a total of 3030 rules in 571 ms. Remains 1564 /3081 variables (removed 1517) and now considering 1314/2831 (removed 1517) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 571 ms. Remains : 1564/3081 places, 1314/2831 transitions.
[2023-03-22 03:39:31] [INFO ] Flatten gal took : 44 ms
[2023-03-22 03:39:31] [INFO ] Flatten gal took : 48 ms
[2023-03-22 03:39:31] [INFO ] Input system was already deterministic with 1314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3053 transition count 2803
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3053 transition count 2803
Applied a total of 56 rules in 398 ms. Remains 3053 /3081 variables (removed 28) and now considering 2803/2831 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 3053/3081 places, 2803/2831 transitions.
[2023-03-22 03:39:32] [INFO ] Flatten gal took : 62 ms
[2023-03-22 03:39:32] [INFO ] Flatten gal took : 65 ms
[2023-03-22 03:39:32] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2729 transition count 2229
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1231 place count 2450 transition count 2200
Iterating global reduction 2 with 29 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2187
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1286 place count 2437 transition count 2187
Performed 883 Post agglomeration using F-continuation condition.Transition count delta: 883
Deduced a syphon composed of 883 places in 1 ms
Reduce places removed 883 places and 0 transitions.
Iterating global reduction 2 with 1766 rules applied. Total rules applied 3052 place count 1554 transition count 1304
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 3054 place count 1552 transition count 1302
Applied a total of 3054 rules in 578 ms. Remains 1552 /3081 variables (removed 1529) and now considering 1302/2831 (removed 1529) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 578 ms. Remains : 1552/3081 places, 1302/2831 transitions.
[2023-03-22 03:39:33] [INFO ] Flatten gal took : 34 ms
[2023-03-22 03:39:33] [INFO ] Flatten gal took : 37 ms
[2023-03-22 03:39:33] [INFO ] Input system was already deterministic with 1302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3057 transition count 2807
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3057 transition count 2807
Applied a total of 48 rules in 472 ms. Remains 3057 /3081 variables (removed 24) and now considering 2807/2831 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 3057/3081 places, 2807/2831 transitions.
[2023-03-22 03:39:33] [INFO ] Flatten gal took : 79 ms
[2023-03-22 03:39:33] [INFO ] Flatten gal took : 73 ms
[2023-03-22 03:39:34] [INFO ] Input system was already deterministic with 2807 transitions.
[2023-03-22 03:39:34] [INFO ] Flatten gal took : 68 ms
[2023-03-22 03:39:34] [INFO ] Flatten gal took : 72 ms
[2023-03-22 03:39:34] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 03:39:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3081 places, 2831 transitions and 8062 arcs took 14 ms.
Total runtime 99610 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/986/ctl_0_ --ctl=/tmp/986/ctl_1_ --ctl=/tmp/986/ctl_2_ --ctl=/tmp/986/ctl_3_ --ctl=/tmp/986/ctl_4_ --ctl=/tmp/986/ctl_5_ --ctl=/tmp/986/ctl_6_ --ctl=/tmp/986/ctl_7_ --ctl=/tmp/986/ctl_8_ --ctl=/tmp/986/ctl_9_ --ctl=/tmp/986/ctl_10_ --ctl=/tmp/986/ctl_11_ --ctl=/tmp/986/ctl_12_ --ctl=/tmp/986/ctl_13_ --ctl=/tmp/986/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 4512136 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094532 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="ShieldPPPs-PT-050B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPs-PT-050B, 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 r393-oct2-167903717100506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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