Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 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.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679491948886

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:32:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 13:32:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:32:31] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-22 13:32:31] [INFO ] Transformed 1003 places.
[2023-03-22 13:32:31] [INFO ] Transformed 963 transitions.
[2023-03-22 13:32:31] [INFO ] Found NUPN structural information;
[2023-03-22 13:32:31] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 227 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 100 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-22 13:32:32] [INFO ] Computed 361 place invariants in 42 ms
[2023-03-22 13:32:33] [INFO ] Implicit Places using invariants in 1914 ms returned []
[2023-03-22 13:32:33] [INFO ] Invariant cache hit.
[2023-03-22 13:32:35] [INFO ] Implicit Places using invariants and state equation in 1871 ms returned []
Implicit Place search using SMT with State Equation took 3824 ms to find 0 implicit places.
[2023-03-22 13:32:35] [INFO ] Invariant cache hit.
[2023-03-22 13:32:37] [INFO ] Dead Transitions using invariants and state equation in 1271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5201 ms. Remains : 1003/1003 places, 963/963 transitions.
Support contains 227 out of 1003 places after structural reductions.
[2023-03-22 13:32:37] [INFO ] Flatten gal took : 236 ms
[2023-03-22 13:32:37] [INFO ] Flatten gal took : 79 ms
[2023-03-22 13:32:38] [INFO ] Input system was already deterministic with 963 transitions.
Support contains 216 out of 1003 places (down from 227) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 83) seen :68
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-22 13:32:38] [INFO ] Invariant cache hit.
[2023-03-22 13:32:39] [INFO ] [Real]Absence check using 361 positive place invariants in 154 ms returned sat
[2023-03-22 13:32:39] [INFO ] After 885ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 13:32:40] [INFO ] [Nat]Absence check using 361 positive place invariants in 180 ms returned sat
[2023-03-22 13:32:44] [INFO ] After 3739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 13:32:45] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 37 ms to minimize.
[2023-03-22 13:32:45] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 14 ms to minimize.
[2023-03-22 13:32:45] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 20 ms to minimize.
[2023-03-22 13:32:45] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2023-03-22 13:32:46] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 0 ms to minimize.
[2023-03-22 13:32:46] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 14 ms to minimize.
[2023-03-22 13:32:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2023-03-22 13:32:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1553 ms
[2023-03-22 13:32:47] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 0 ms to minimize.
[2023-03-22 13:32:47] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-22 13:32:47] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2023-03-22 13:32:47] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2023-03-22 13:32:48] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:32:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1256 ms
[2023-03-22 13:32:48] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2023-03-22 13:32:48] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-22 13:32:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2023-03-22 13:32:48] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2023-03-22 13:32:49] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2023-03-22 13:32:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2023-03-22 13:32:49] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2023-03-22 13:32:49] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-03-22 13:32:49] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-22 13:32:50] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-22 13:32:50] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 0 ms to minimize.
[2023-03-22 13:32:50] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 13 ms to minimize.
[2023-03-22 13:32:50] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 6 ms to minimize.
[2023-03-22 13:32:51] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 1 ms to minimize.
[2023-03-22 13:32:51] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-22 13:32:51] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2023-03-22 13:32:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2143 ms
[2023-03-22 13:32:51] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2023-03-22 13:32:52] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-22 13:32:52] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2023-03-22 13:32:52] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-22 13:32:52] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2023-03-22 13:32:53] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 0 ms to minimize.
[2023-03-22 13:32:53] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 0 ms to minimize.
[2023-03-22 13:32:53] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 10 ms to minimize.
[2023-03-22 13:32:53] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2023-03-22 13:32:54] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 0 ms to minimize.
[2023-03-22 13:32:54] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2023-03-22 13:32:54] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 0 ms to minimize.
[2023-03-22 13:32:55] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 1 ms to minimize.
[2023-03-22 13:32:55] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 13 ms to minimize.
[2023-03-22 13:32:55] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2023-03-22 13:32:55] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2023-03-22 13:32:56] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2023-03-22 13:32:56] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-22 13:32:56] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 0 ms to minimize.
[2023-03-22 13:32:56] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-22 13:32:56] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2023-03-22 13:32:57] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:32:57] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-22 13:32:57] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5629 ms
[2023-03-22 13:32:57] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-22 13:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-22 13:32:57] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2023-03-22 13:32:58] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2023-03-22 13:32:58] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2023-03-22 13:32:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 517 ms
[2023-03-22 13:32:58] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2023-03-22 13:32:58] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-22 13:32:59] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2023-03-22 13:32:59] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-22 13:32:59] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 13:32:59] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-22 13:32:59] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-22 13:33:00] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2023-03-22 13:33:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1617 ms
[2023-03-22 13:33:00] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2023-03-22 13:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2023-03-22 13:33:01] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2023-03-22 13:33:01] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-22 13:33:01] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-22 13:33:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 668 ms
[2023-03-22 13:33:01] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2023-03-22 13:33:02] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-22 13:33:02] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2023-03-22 13:33:02] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 8 ms to minimize.
[2023-03-22 13:33:02] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 23 ms to minimize.
[2023-03-22 13:33:03] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2023-03-22 13:33:03] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 1 ms to minimize.
[2023-03-22 13:33:03] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2023-03-22 13:33:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2059 ms
[2023-03-22 13:33:03] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-22 13:33:04] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-22 13:33:04] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-22 13:33:04] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-22 13:33:04] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 13:33:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 13:33:04] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Parikh walk visited 2 properties in 2746 ms.
Support contains 56 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Partial Free-agglomeration rule applied 248 times.
Drop transitions removed 248 transitions
Iterating global reduction 0 with 248 rules applied. Total rules applied 250 place count 1002 transition count 962
Applied a total of 250 rules in 138 ms. Remains 1002 /1003 variables (removed 1) and now considering 962/963 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1002/1003 places, 962/963 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-22 13:33:08] [INFO ] Computed 361 place invariants in 20 ms
[2023-03-22 13:33:09] [INFO ] [Real]Absence check using 354 positive place invariants in 68 ms returned sat
[2023-03-22 13:33:09] [INFO ] [Real]Absence check using 354 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-22 13:33:09] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 13:33:09] [INFO ] [Nat]Absence check using 354 positive place invariants in 93 ms returned sat
[2023-03-22 13:33:09] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 13:33:13] [INFO ] After 3158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 13:33:14] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-22 13:33:14] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 1 ms to minimize.
[2023-03-22 13:33:14] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 0 ms to minimize.
[2023-03-22 13:33:15] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2023-03-22 13:33:15] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 0 ms to minimize.
[2023-03-22 13:33:15] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 0 ms to minimize.
[2023-03-22 13:33:15] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2023-03-22 13:33:16] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 2 ms to minimize.
[2023-03-22 13:33:16] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-22 13:33:16] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2023-03-22 13:33:17] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2023-03-22 13:33:17] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 0 ms to minimize.
[2023-03-22 13:33:17] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2023-03-22 13:33:17] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2023-03-22 13:33:17] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 1 ms to minimize.
[2023-03-22 13:33:18] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2023-03-22 13:33:18] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2023-03-22 13:33:18] [INFO ] Deduced a trap composed of 9 places in 358 ms of which 0 ms to minimize.
[2023-03-22 13:33:19] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-22 13:33:19] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2023-03-22 13:33:19] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 0 ms to minimize.
[2023-03-22 13:33:19] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-22 13:33:20] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2023-03-22 13:33:20] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 1 ms to minimize.
[2023-03-22 13:33:20] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2023-03-22 13:33:20] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2023-03-22 13:33:21] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-22 13:33:21] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2023-03-22 13:33:21] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-22 13:33:21] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2023-03-22 13:33:21] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-03-22 13:33:22] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-22 13:33:22] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 8319 ms
[2023-03-22 13:33:22] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2023-03-22 13:33:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-22 13:33:22] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2023-03-22 13:33:23] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:33:23] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-22 13:33:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 610 ms
[2023-03-22 13:33:23] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2023-03-22 13:33:23] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2023-03-22 13:33:24] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2023-03-22 13:33:24] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-22 13:33:24] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2023-03-22 13:33:24] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2023-03-22 13:33:25] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-22 13:33:25] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-22 13:33:25] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-22 13:33:25] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2023-03-22 13:33:26] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-22 13:33:26] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2023-03-22 13:33:26] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2023-03-22 13:33:26] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2023-03-22 13:33:26] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3391 ms
[2023-03-22 13:33:27] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2023-03-22 13:33:27] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-22 13:33:27] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-22 13:33:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 552 ms
[2023-03-22 13:33:27] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2023-03-22 13:33:28] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 13:33:28] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-22 13:33:28] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2023-03-22 13:33:28] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:33:28] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-22 13:33:28] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2023-03-22 13:33:28] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2023-03-22 13:33:29] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2023-03-22 13:33:29] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-22 13:33:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1538 ms
[2023-03-22 13:33:30] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 1 ms to minimize.
[2023-03-22 13:33:30] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 1 ms to minimize.
[2023-03-22 13:33:30] [INFO ] Deduced a trap composed of 14 places in 456 ms of which 1 ms to minimize.
[2023-03-22 13:33:31] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2023-03-22 13:33:31] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-22 13:33:31] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2023-03-22 13:33:32] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 0 ms to minimize.
[2023-03-22 13:33:32] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2023-03-22 13:33:32] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 0 ms to minimize.
[2023-03-22 13:33:33] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-22 13:33:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3426 ms
[2023-03-22 13:33:33] [INFO ] After 23132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1111 ms.
[2023-03-22 13:33:34] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 809 ms.
Support contains 37 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1002 transition count 961
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1001 transition count 961
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 1001 transition count 961
Applied a total of 12 rules in 78 ms. Remains 1001 /1002 variables (removed 1) and now considering 961/962 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1001/1002 places, 961/962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-22 13:33:35] [INFO ] Computed 361 place invariants in 17 ms
[2023-03-22 13:33:36] [INFO ] [Real]Absence check using 354 positive place invariants in 53 ms returned sat
[2023-03-22 13:33:36] [INFO ] [Real]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 13:33:36] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 13:33:36] [INFO ] [Nat]Absence check using 354 positive place invariants in 112 ms returned sat
[2023-03-22 13:33:36] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 13:33:39] [INFO ] After 2605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 13:33:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 13:33:40] [INFO ] After 1058ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 13:33:40] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 0 ms to minimize.
[2023-03-22 13:33:41] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-22 13:33:41] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2023-03-22 13:33:41] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2023-03-22 13:33:42] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 0 ms to minimize.
[2023-03-22 13:33:42] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-22 13:33:42] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-22 13:33:42] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-22 13:33:42] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2023-03-22 13:33:43] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-03-22 13:33:43] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 0 ms to minimize.
[2023-03-22 13:33:43] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 7 ms to minimize.
[2023-03-22 13:33:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2951 ms
[2023-03-22 13:33:43] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 14 ms to minimize.
[2023-03-22 13:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-22 13:33:44] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-22 13:33:44] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2023-03-22 13:33:44] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2023-03-22 13:33:44] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2023-03-22 13:33:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 571 ms
[2023-03-22 13:33:45] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-22 13:33:45] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2023-03-22 13:33:45] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2023-03-22 13:33:45] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2023-03-22 13:33:46] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 0 ms to minimize.
[2023-03-22 13:33:46] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 13:33:46] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:33:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1723 ms
[2023-03-22 13:33:47] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2023-03-22 13:33:47] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2023-03-22 13:33:47] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2023-03-22 13:33:47] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2023-03-22 13:33:47] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2023-03-22 13:33:48] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-22 13:33:48] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2023-03-22 13:33:48] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2023-03-22 13:33:48] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2023-03-22 13:33:48] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2023-03-22 13:33:48] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-22 13:33:49] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-22 13:33:49] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2023-03-22 13:33:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2611 ms
[2023-03-22 13:33:50] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2023-03-22 13:33:50] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-22 13:33:50] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-22 13:33:50] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2023-03-22 13:33:51] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-22 13:33:51] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-22 13:33:51] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-22 13:33:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1458 ms
[2023-03-22 13:33:51] [INFO ] After 12095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1178 ms.
[2023-03-22 13:33:52] [INFO ] After 16491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 638 ms.
Support contains 33 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1001 transition count 961
Applied a total of 2 rules in 80 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-22 13:33:54] [INFO ] Computed 361 place invariants in 11 ms
[2023-03-22 13:33:54] [INFO ] [Real]Absence check using 354 positive place invariants in 88 ms returned sat
[2023-03-22 13:33:54] [INFO ] [Real]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 13:33:54] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 13:33:55] [INFO ] [Nat]Absence check using 354 positive place invariants in 176 ms returned sat
[2023-03-22 13:33:55] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-22 13:33:56] [INFO ] After 1446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 13:33:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 13:33:57] [INFO ] After 625ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 13:33:57] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2023-03-22 13:33:57] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-22 13:33:58] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2023-03-22 13:33:58] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2023-03-22 13:33:58] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-22 13:33:58] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:33:58] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-03-22 13:33:59] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2023-03-22 13:33:59] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-22 13:33:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1832 ms
[2023-03-22 13:33:59] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2023-03-22 13:33:59] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2023-03-22 13:33:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2023-03-22 13:34:00] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-22 13:34:00] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-22 13:34:01] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-22 13:34:01] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 0 ms to minimize.
[2023-03-22 13:34:01] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-22 13:34:01] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 0 ms to minimize.
[2023-03-22 13:34:02] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 0 ms to minimize.
[2023-03-22 13:34:02] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 1 ms to minimize.
[2023-03-22 13:34:02] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2023-03-22 13:34:02] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2023-03-22 13:34:03] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2023-03-22 13:34:03] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2023-03-22 13:34:03] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2023-03-22 13:34:03] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-22 13:34:03] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-22 13:34:04] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 13:34:04] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3994 ms
[2023-03-22 13:34:04] [INFO ] After 7692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1440 ms.
[2023-03-22 13:34:05] [INFO ] After 11269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 617 ms.
Support contains 32 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1001 transition count 961
Applied a total of 1 rules in 48 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-22 13:34:07] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-22 13:34:07] [INFO ] [Real]Absence check using 354 positive place invariants in 60 ms returned sat
[2023-03-22 13:34:07] [INFO ] [Real]Absence check using 354 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 13:34:08] [INFO ] After 1178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 13:34:08] [INFO ] [Nat]Absence check using 354 positive place invariants in 98 ms returned sat
[2023-03-22 13:34:08] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 13:34:10] [INFO ] After 1424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 13:34:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 13:34:11] [INFO ] After 750ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 13:34:11] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 1 ms to minimize.
[2023-03-22 13:34:11] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2023-03-22 13:34:12] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2023-03-22 13:34:12] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-22 13:34:12] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-22 13:34:12] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-22 13:34:13] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 1 ms to minimize.
[2023-03-22 13:34:13] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 13:34:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1948 ms
[2023-03-22 13:34:13] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2023-03-22 13:34:13] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2023-03-22 13:34:14] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 0 ms to minimize.
[2023-03-22 13:34:14] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2023-03-22 13:34:14] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-22 13:34:14] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2023-03-22 13:34:14] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2023-03-22 13:34:15] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-22 13:34:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1711 ms
[2023-03-22 13:34:15] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2023-03-22 13:34:15] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2023-03-22 13:34:16] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 1 ms to minimize.
[2023-03-22 13:34:16] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 0 ms to minimize.
[2023-03-22 13:34:16] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2023-03-22 13:34:16] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2023-03-22 13:34:17] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 0 ms to minimize.
[2023-03-22 13:34:17] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 5 ms to minimize.
[2023-03-22 13:34:17] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2023-03-22 13:34:17] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2023-03-22 13:34:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2664 ms
[2023-03-22 13:34:18] [INFO ] After 7994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 683 ms.
[2023-03-22 13:34:18] [INFO ] After 10695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 345 ms.
Support contains 26 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 1001 transition count 961
Applied a total of 5 rules in 62 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1001/1001 places, 961/961 transitions.
[2023-03-22 13:34:19] [INFO ] Flatten gal took : 101 ms
[2023-03-22 13:34:19] [INFO ] Flatten gal took : 63 ms
[2023-03-22 13:34:19] [INFO ] Input system was already deterministic with 963 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:19] [INFO ] Flatten gal took : 52 ms
[2023-03-22 13:34:19] [INFO ] Flatten gal took : 47 ms
[2023-03-22 13:34:19] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 68 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 1001/1003 places, 961/963 transitions.
[2023-03-22 13:34:20] [INFO ] Flatten gal took : 41 ms
[2023-03-22 13:34:20] [INFO ] Flatten gal took : 48 ms
[2023-03-22 13:34:20] [INFO ] Input system was already deterministic with 961 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:20] [INFO ] Flatten gal took : 46 ms
[2023-03-22 13:34:20] [INFO ] Flatten gal took : 49 ms
[2023-03-22 13:34:20] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 13 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:20] [INFO ] Flatten gal took : 43 ms
[2023-03-22 13:34:20] [INFO ] Flatten gal took : 42 ms
[2023-03-22 13:34:20] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 69 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 1001/1003 places, 961/963 transitions.
[2023-03-22 13:34:20] [INFO ] Flatten gal took : 43 ms
[2023-03-22 13:34:20] [INFO ] Flatten gal took : 70 ms
[2023-03-22 13:34:20] [INFO ] Input system was already deterministic with 961 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 50 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 1001/1003 places, 961/963 transitions.
[2023-03-22 13:34:20] [INFO ] Flatten gal took : 41 ms
[2023-03-22 13:34:21] [INFO ] Flatten gal took : 42 ms
[2023-03-22 13:34:21] [INFO ] Input system was already deterministic with 961 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:21] [INFO ] Flatten gal took : 36 ms
[2023-03-22 13:34:21] [INFO ] Flatten gal took : 37 ms
[2023-03-22 13:34:21] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Applied a total of 2 rules in 51 ms. Remains 1002 /1003 variables (removed 1) and now considering 962/963 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 1002/1003 places, 962/963 transitions.
[2023-03-22 13:34:21] [INFO ] Flatten gal took : 64 ms
[2023-03-22 13:34:21] [INFO ] Flatten gal took : 41 ms
[2023-03-22 13:34:21] [INFO ] Input system was already deterministic with 962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:21] [INFO ] Flatten gal took : 70 ms
[2023-03-22 13:34:21] [INFO ] Flatten gal took : 53 ms
[2023-03-22 13:34:21] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 11 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:21] [INFO ] Flatten gal took : 52 ms
[2023-03-22 13:34:21] [INFO ] Flatten gal took : 56 ms
[2023-03-22 13:34:21] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 10 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 36 ms
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 38 ms
[2023-03-22 13:34:22] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 35 ms
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 37 ms
[2023-03-22 13:34:22] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 23 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 45 ms
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 41 ms
[2023-03-22 13:34:22] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 46 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 1001/1003 places, 961/963 transitions.
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 39 ms
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 62 ms
[2023-03-22 13:34:22] [INFO ] Input system was already deterministic with 961 transitions.
Finished random walk after 1823 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=113 )
FORMULA ShieldIIPs-PT-040A-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 40 ms
[2023-03-22 13:34:22] [INFO ] Flatten gal took : 41 ms
[2023-03-22 13:34:22] [INFO ] Input system was already deterministic with 963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 1003/1003 places, 963/963 transitions.
[2023-03-22 13:34:23] [INFO ] Flatten gal took : 40 ms
[2023-03-22 13:34:23] [INFO ] Flatten gal took : 43 ms
[2023-03-22 13:34:23] [INFO ] Input system was already deterministic with 963 transitions.
[2023-03-22 13:34:23] [INFO ] Flatten gal took : 38 ms
[2023-03-22 13:34:23] [INFO ] Flatten gal took : 37 ms
[2023-03-22 13:34:23] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 13:34:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 963 transitions and 4326 arcs took 4 ms.
Total runtime 111690 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 1003 NrTr: 963 NrArc: 4326)

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

net check time: 0m 0.000sec

init dd package: 0m 3.012sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7342488 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099836 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.004sec

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040A.tgz
mv ShieldIIPs-PT-040A 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 ;