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.r389-oct2-167903713600479.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 itstools
Input is ShieldPPPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713600479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 528K 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-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679205337823

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 05:55:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 05:55:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 05:55:40] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-19 05:55:40] [INFO ] Transformed 2043 places.
[2023-03-19 05:55:40] [INFO ] Transformed 1893 transitions.
[2023-03-19 05:55:40] [INFO ] Found NUPN structural information;
[2023-03-19 05:55:40] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 05:55:41] [INFO ] Flatten gal took : 187 ms
[2023-03-19 05:55:41] [INFO ] Flatten gal took : 150 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-19 05:55:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9222971229035787005.gal : 44 ms
[2023-03-19 05:55:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10109770206468549679.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9222971229035787005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10109770206468549679.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0

its-reach command run as :
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Loading property file /tmp/ReachabilityCardinality10109770206468549679.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1893 rows 2043 cols
[2023-03-19 05:55:42] [INFO ] Computed 331 place invariants in 22 ms
[2023-03-19 05:55:43] [INFO ] [Real]Absence check using 331 positive place invariants in 223 ms returned sat
[2023-03-19 05:55:43] [INFO ] After 993ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 36
[2023-03-19 05:55:43] [INFO ] [Nat]Absence check using 331 positive place invariants in 168 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :36 after 134
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :134 after 412
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :412 after 596
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :596 after 1.09114e+08
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1.09114e+08 after 3.78237e+15
[2023-03-19 05:55:49] [INFO ] After 5377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 05:55:50] [INFO ] Deduced a trap composed of 27 places in 786 ms of which 26 ms to minimize.
[2023-03-19 05:55:51] [INFO ] Deduced a trap composed of 19 places in 544 ms of which 14 ms to minimize.
[2023-03-19 05:55:51] [INFO ] Deduced a trap composed of 25 places in 525 ms of which 16 ms to minimize.
[2023-03-19 05:55:52] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 1 ms to minimize.
[2023-03-19 05:55:52] [INFO ] Deduced a trap composed of 41 places in 412 ms of which 3 ms to minimize.
[2023-03-19 05:55:53] [INFO ] Deduced a trap composed of 24 places in 364 ms of which 1 ms to minimize.
[2023-03-19 05:55:53] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 2 ms to minimize.
[2023-03-19 05:55:54] [INFO ] Deduced a trap composed of 51 places in 345 ms of which 1 ms to minimize.
[2023-03-19 05:55:54] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 1 ms to minimize.
[2023-03-19 05:55:55] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 1 ms to minimize.
[2023-03-19 05:55:55] [INFO ] Deduced a trap composed of 32 places in 459 ms of which 1 ms to minimize.
[2023-03-19 05:55:56] [INFO ] Deduced a trap composed of 40 places in 440 ms of which 1 ms to minimize.
[2023-03-19 05:55:56] [INFO ] Deduced a trap composed of 31 places in 523 ms of which 1 ms to minimize.
[2023-03-19 05:55:57] [INFO ] Deduced a trap composed of 34 places in 998 ms of which 2 ms to minimize.
[2023-03-19 05:55:58] [INFO ] Deduced a trap composed of 22 places in 543 ms of which 1 ms to minimize.
[2023-03-19 05:55:59] [INFO ] Deduced a trap composed of 29 places in 430 ms of which 1 ms to minimize.
[2023-03-19 05:55:59] [INFO ] Deduced a trap composed of 29 places in 453 ms of which 1 ms to minimize.
[2023-03-19 05:56:00] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 1 ms to minimize.
[2023-03-19 05:56:00] [INFO ] Deduced a trap composed of 29 places in 648 ms of which 1 ms to minimize.
[2023-03-19 05:56:01] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 1 ms to minimize.
[2023-03-19 05:56:01] [INFO ] Deduced a trap composed of 55 places in 473 ms of which 1 ms to minimize.
[2023-03-19 05:56:02] [INFO ] Deduced a trap composed of 27 places in 471 ms of which 2 ms to minimize.
[2023-03-19 05:56:02] [INFO ] Deduced a trap composed of 21 places in 437 ms of which 1 ms to minimize.
[2023-03-19 05:56:03] [INFO ] Deduced a trap composed of 20 places in 653 ms of which 1 ms to minimize.
[2023-03-19 05:56:04] [INFO ] Deduced a trap composed of 29 places in 498 ms of which 1 ms to minimize.
[2023-03-19 05:56:04] [INFO ] Deduced a trap composed of 41 places in 451 ms of which 1 ms to minimize.
[2023-03-19 05:56:05] [INFO ] Deduced a trap composed of 35 places in 485 ms of which 1 ms to minimize.
[2023-03-19 05:56:05] [INFO ] Deduced a trap composed of 21 places in 511 ms of which 2 ms to minimize.
[2023-03-19 05:56:06] [INFO ] Deduced a trap composed of 21 places in 620 ms of which 2 ms to minimize.
[2023-03-19 05:56:07] [INFO ] Deduced a trap composed of 38 places in 463 ms of which 1 ms to minimize.
[2023-03-19 05:56:07] [INFO ] Deduced a trap composed of 37 places in 574 ms of which 1 ms to minimize.
[2023-03-19 05:56:08] [INFO ] Deduced a trap composed of 34 places in 436 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.Application.startNoEx(Application.java:902)
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-19 05:56:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:56:08] [INFO ] After 25285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 875 ms.
Support contains 214 out of 2043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 2043 transition count 1733
Reduce places removed 160 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 172 rules applied. Total rules applied 332 place count 1883 transition count 1721
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 344 place count 1871 transition count 1721
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 344 place count 1871 transition count 1575
Deduced a syphon composed of 146 places in 4 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 636 place count 1725 transition count 1575
Discarding 166 places :
Symmetric choice reduction at 3 with 166 rule applications. Total rules 802 place count 1559 transition count 1409
Iterating global reduction 3 with 166 rules applied. Total rules applied 968 place count 1559 transition count 1409
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 968 place count 1559 transition count 1354
Deduced a syphon composed of 55 places in 5 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 1078 place count 1504 transition count 1354
Performed 370 Post agglomeration using F-continuation condition.Transition count delta: 370
Deduced a syphon composed of 370 places in 4 ms
Reduce places removed 370 places and 0 transitions.
Iterating global reduction 3 with 740 rules applied. Total rules applied 1818 place count 1134 transition count 984
Partial Free-agglomeration rule applied 194 times.
Drop transitions removed 194 transitions
Iterating global reduction 3 with 194 rules applied. Total rules applied 2012 place count 1134 transition count 984
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2013 place count 1133 transition count 983
Applied a total of 2013 rules in 589 ms. Remains 1133 /2043 variables (removed 910) and now considering 983/1893 (removed 910) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 590 ms. Remains : 1133/2043 places, 983/1893 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 9) seen :5
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 983 rows 1133 cols
[2023-03-19 05:56:10] [INFO ] Computed 331 place invariants in 15 ms
[2023-03-19 05:56:10] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 05:56:11] [INFO ] [Nat]Absence check using 323 positive place invariants in 181 ms returned sat
[2023-03-19 05:56:11] [INFO ] [Nat]Absence check using 323 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-19 05:56:12] [INFO ] After 1532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 05:56:13] [INFO ] Deduced a trap composed of 14 places in 294 ms of which 1 ms to minimize.
[2023-03-19 05:56:13] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 18 ms to minimize.
[2023-03-19 05:56:13] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 1 ms to minimize.
[2023-03-19 05:56:14] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 0 ms to minimize.
[2023-03-19 05:56:14] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2023-03-19 05:56:14] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 0 ms to minimize.
[2023-03-19 05:56:14] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 0 ms to minimize.
[2023-03-19 05:56:15] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 14 ms to minimize.
[2023-03-19 05:56:15] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2023-03-19 05:56:15] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-19 05:56:15] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2023-03-19 05:56:15] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 0 ms to minimize.
[2023-03-19 05:56:16] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 1 ms to minimize.
[2023-03-19 05:56:16] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-19 05:56:16] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-19 05:56:16] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-19 05:56:16] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-19 05:56:17] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2023-03-19 05:56:17] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4326 ms
[2023-03-19 05:56:17] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-03-19 05:56:17] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2023-03-19 05:56:17] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 2 ms to minimize.
[2023-03-19 05:56:18] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-19 05:56:18] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 0 ms to minimize.
[2023-03-19 05:56:18] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 13 ms to minimize.
[2023-03-19 05:56:19] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
[2023-03-19 05:56:19] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 1 ms to minimize.
[2023-03-19 05:56:19] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-19 05:56:19] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 0 ms to minimize.
[2023-03-19 05:56:20] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 0 ms to minimize.
[2023-03-19 05:56:20] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-19 05:56:20] [INFO ] Deduced a trap composed of 15 places in 359 ms of which 1 ms to minimize.
[2023-03-19 05:56:21] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-19 05:56:21] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-19 05:56:21] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-19 05:56:22] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 15 ms to minimize.
[2023-03-19 05:56:22] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2023-03-19 05:56:22] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-19 05:56:23] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 14 ms to minimize.
[2023-03-19 05:56:23] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-19 05:56:23] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-19 05:56:23] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 1 ms to minimize.
[2023-03-19 05:56:23] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2023-03-19 05:56:24] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 1 ms to minimize.
[2023-03-19 05:56:24] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2023-03-19 05:56:24] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2023-03-19 05:56:24] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-19 05:56:25] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 1 ms to minimize.
[2023-03-19 05:56:25] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2023-03-19 05:56:25] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2023-03-19 05:56:25] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 1 ms to minimize.
[2023-03-19 05:56:25] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 0 ms to minimize.
[2023-03-19 05:56:26] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 1 ms to minimize.
[2023-03-19 05:56:26] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2023-03-19 05:56:26] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 1 ms to minimize.
[2023-03-19 05:56:26] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 1 ms to minimize.
[2023-03-19 05:56:27] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 1 ms to minimize.
[2023-03-19 05:56:27] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2023-03-19 05:56:27] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 10233 ms
[2023-03-19 05:56:28] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2023-03-19 05:56:28] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 0 ms to minimize.
[2023-03-19 05:56:29] [INFO ] Deduced a trap composed of 7 places in 499 ms of which 1 ms to minimize.
[2023-03-19 05:56:29] [INFO ] Deduced a trap composed of 7 places in 393 ms of which 1 ms to minimize.
[2023-03-19 05:56:30] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 0 ms to minimize.
[2023-03-19 05:56:30] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 0 ms to minimize.
[2023-03-19 05:56:30] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 1 ms to minimize.
[2023-03-19 05:56:31] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 0 ms to minimize.
[2023-03-19 05:56:31] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 0 ms to minimize.
[2023-03-19 05:56:31] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2023-03-19 05:56:32] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-19 05:56:32] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 0 ms to minimize.
[2023-03-19 05:56:32] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-19 05:56:33] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2023-03-19 05:56:33] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 1 ms to minimize.
[2023-03-19 05:56:33] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2023-03-19 05:56:33] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 1 ms to minimize.
[2023-03-19 05:56:34] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 0 ms to minimize.
[2023-03-19 05:56:34] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-19 05:56:34] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-19 05:56:35] [INFO ] Deduced a trap composed of 15 places in 484 ms of which 2 ms to minimize.
[2023-03-19 05:56:35] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 0 ms to minimize.
[2023-03-19 05:56:35] [INFO ] Deduced a trap composed of 14 places in 368 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.Application.startNoEx(Application.java:902)
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-19 05:56:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:56:35] [INFO ] After 25318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 75 ms.
Support contains 127 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 983/983 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1133 transition count 976
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1126 transition count 976
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 14 place count 1126 transition count 966
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 34 place count 1116 transition count 966
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 1115 transition count 965
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 1115 transition count 965
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 1115 transition count 964
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 1114 transition count 964
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 146 place count 1060 transition count 910
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 167 place count 1060 transition count 910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 1059 transition count 909
Applied a total of 168 rules in 306 ms. Remains 1059 /1133 variables (removed 74) and now considering 909/983 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 1059/1133 places, 909/983 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 909 rows 1059 cols
[2023-03-19 05:56:36] [INFO ] Computed 331 place invariants in 9 ms
[2023-03-19 05:56:36] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 05:56:37] [INFO ] [Nat]Absence check using 315 positive place invariants in 229 ms returned sat
[2023-03-19 05:56:37] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 17 ms returned sat
[2023-03-19 05:56:38] [INFO ] After 1423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 05:56:39] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 0 ms to minimize.
[2023-03-19 05:56:39] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2023-03-19 05:56:39] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-19 05:56:39] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-19 05:56:40] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 2 ms to minimize.
[2023-03-19 05:56:40] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 0 ms to minimize.
[2023-03-19 05:56:40] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-19 05:56:41] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2023-03-19 05:56:41] [INFO ] Deduced a trap composed of 14 places in 258 ms of which 1 ms to minimize.
[2023-03-19 05:56:41] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2023-03-19 05:56:42] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 22 ms to minimize.
[2023-03-19 05:56:42] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 2 ms to minimize.
[2023-03-19 05:56:42] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-19 05:56:42] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-19 05:56:43] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-19 05:56:43] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 1 ms to minimize.
[2023-03-19 05:56:43] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 1 ms to minimize.
[2023-03-19 05:56:44] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-19 05:56:44] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-19 05:56:44] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2023-03-19 05:56:44] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2023-03-19 05:56:44] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-19 05:56:44] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2023-03-19 05:56:45] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2023-03-19 05:56:45] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-19 05:56:45] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-19 05:56:45] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2023-03-19 05:56:45] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2023-03-19 05:56:46] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-19 05:56:46] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2023-03-19 05:56:46] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-19 05:56:46] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 7538 ms
[2023-03-19 05:56:47] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 1 ms to minimize.
[2023-03-19 05:56:48] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-19 05:56:48] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2023-03-19 05:56:48] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 0 ms to minimize.
[2023-03-19 05:56:48] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 0 ms to minimize.
[2023-03-19 05:56:49] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 0 ms to minimize.
[2023-03-19 05:56:49] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2023-03-19 05:56:49] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-19 05:56:50] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 1 ms to minimize.
[2023-03-19 05:56:50] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 0 ms to minimize.
[2023-03-19 05:56:50] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2023-03-19 05:56:50] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2023-03-19 05:56:51] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2023-03-19 05:56:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3609 ms
[2023-03-19 05:56:51] [INFO ] After 13732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 623 ms.
[2023-03-19 05:56:51] [INFO ] After 14969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 73 ms.
Support contains 103 out of 1059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 909/909 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1059 transition count 906
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1056 transition count 906
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 1056 transition count 905
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1055 transition count 905
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 44 place count 1037 transition count 887
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 1037 transition count 887
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1036 transition count 886
Applied a total of 57 rules in 180 ms. Remains 1036 /1059 variables (removed 23) and now considering 886/909 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 1036/1059 places, 886/909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 136496 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136496 steps, saw 125212 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 886 rows 1036 cols
[2023-03-19 05:56:55] [INFO ] Computed 331 place invariants in 31 ms
[2023-03-19 05:56:55] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 05:56:55] [INFO ] [Nat]Absence check using 312 positive place invariants in 85 ms returned sat
[2023-03-19 05:56:55] [INFO ] [Nat]Absence check using 312 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-19 05:56:57] [INFO ] After 1397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 05:56:57] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-19 05:56:58] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 1 ms to minimize.
[2023-03-19 05:56:58] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 0 ms to minimize.
[2023-03-19 05:56:59] [INFO ] Deduced a trap composed of 6 places in 791 ms of which 1 ms to minimize.
[2023-03-19 05:56:59] [INFO ] Deduced a trap composed of 9 places in 473 ms of which 1 ms to minimize.
[2023-03-19 05:57:00] [INFO ] Deduced a trap composed of 3 places in 627 ms of which 1 ms to minimize.
[2023-03-19 05:57:00] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-19 05:57:00] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-19 05:57:01] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-19 05:57:01] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2023-03-19 05:57:01] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-19 05:57:01] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2023-03-19 05:57:02] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2023-03-19 05:57:03] [INFO ] Deduced a trap composed of 10 places in 836 ms of which 1 ms to minimize.
[2023-03-19 05:57:03] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2023-03-19 05:57:03] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-19 05:57:04] [INFO ] Deduced a trap composed of 12 places in 888 ms of which 0 ms to minimize.
[2023-03-19 05:57:04] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 0 ms to minimize.
[2023-03-19 05:57:04] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2023-03-19 05:57:04] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-19 05:57:05] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2023-03-19 05:57:05] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2023-03-19 05:57:05] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-19 05:57:05] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2023-03-19 05:57:06] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 0 ms to minimize.
[2023-03-19 05:57:06] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-19 05:57:06] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2023-03-19 05:57:06] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2023-03-19 05:57:07] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2023-03-19 05:57:07] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-19 05:57:07] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 0 ms to minimize.
[2023-03-19 05:57:07] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2023-03-19 05:57:08] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 0 ms to minimize.
[2023-03-19 05:57:08] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 0 ms to minimize.
[2023-03-19 05:57:08] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 1 ms to minimize.
[2023-03-19 05:57:09] [INFO ] Deduced a trap composed of 7 places in 387 ms of which 1 ms to minimize.
[2023-03-19 05:57:09] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-19 05:57:09] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-19 05:57:09] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2023-03-19 05:57:09] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 0 ms to minimize.
[2023-03-19 05:57:10] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2023-03-19 05:57:10] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-19 05:57:10] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-19 05:57:10] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2023-03-19 05:57:10] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2023-03-19 05:57:11] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-19 05:57:11] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-19 05:57:11] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2023-03-19 05:57:11] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2023-03-19 05:57:11] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2023-03-19 05:57:12] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-03-19 05:57:12] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2023-03-19 05:57:13] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2023-03-19 05:57:13] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-19 05:57:13] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 0 ms to minimize.
[2023-03-19 05:57:13] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 16246 ms
[2023-03-19 05:57:14] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2023-03-19 05:57:14] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-19 05:57:15] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 0 ms to minimize.
[2023-03-19 05:57:15] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2023-03-19 05:57:15] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-19 05:57:15] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2023-03-19 05:57:16] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2023-03-19 05:57:16] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2023-03-19 05:57:16] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-19 05:57:16] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2023-03-19 05:57:17] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-19 05:57:17] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-19 05:57:17] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-19 05:57:17] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2023-03-19 05:57:17] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2023-03-19 05:57:17] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-19 05:57:18] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-19 05:57:18] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 1 ms to minimize.
[2023-03-19 05:57:18] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4306 ms
[2023-03-19 05:57:18] [INFO ] After 22847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1143 ms.
[2023-03-19 05:57:19] [INFO ] After 24261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 92 ms.
Support contains 103 out of 1036 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 33 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1036/1036 places, 886/886 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 26 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2023-03-19 05:57:20] [INFO ] Invariant cache hit.
[2023-03-19 05:57:20] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-19 05:57:20] [INFO ] Invariant cache hit.
[2023-03-19 05:57:22] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2023-03-19 05:57:22] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-19 05:57:22] [INFO ] Invariant cache hit.
[2023-03-19 05:57:22] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2656 ms. Remains : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 27 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 05:57:22] [INFO ] Invariant cache hit.
[2023-03-19 05:57:22] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 05:57:23] [INFO ] [Nat]Absence check using 312 positive place invariants in 98 ms returned sat
[2023-03-19 05:57:23] [INFO ] [Nat]Absence check using 312 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-19 05:57:24] [INFO ] After 1455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 05:57:25] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 4 ms to minimize.
[2023-03-19 05:57:25] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 0 ms to minimize.
[2023-03-19 05:57:25] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 0 ms to minimize.
[2023-03-19 05:57:25] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2023-03-19 05:57:26] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-19 05:57:26] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-19 05:57:26] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-19 05:57:26] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2023-03-19 05:57:26] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-19 05:57:27] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2023-03-19 05:57:27] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 0 ms to minimize.
[2023-03-19 05:57:27] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2023-03-19 05:57:27] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 0 ms to minimize.
[2023-03-19 05:57:28] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 0 ms to minimize.
[2023-03-19 05:57:28] [INFO ] Deduced a trap composed of 9 places in 396 ms of which 0 ms to minimize.
[2023-03-19 05:57:29] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2023-03-19 05:57:29] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2023-03-19 05:57:29] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2023-03-19 05:57:29] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2023-03-19 05:57:30] [INFO ] Deduced a trap composed of 6 places in 559 ms of which 1 ms to minimize.
[2023-03-19 05:57:30] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-19 05:57:30] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2023-03-19 05:57:30] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 2 ms to minimize.
[2023-03-19 05:57:31] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 1 ms to minimize.
[2023-03-19 05:57:31] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 16 ms to minimize.
[2023-03-19 05:57:31] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-19 05:57:31] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-19 05:57:32] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 0 ms to minimize.
[2023-03-19 05:57:32] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 0 ms to minimize.
[2023-03-19 05:57:32] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2023-03-19 05:57:32] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7889 ms
[2023-03-19 05:57:34] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 1 ms to minimize.
[2023-03-19 05:57:34] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-19 05:57:34] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 0 ms to minimize.
[2023-03-19 05:57:35] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 0 ms to minimize.
[2023-03-19 05:57:35] [INFO ] Deduced a trap composed of 10 places in 595 ms of which 1 ms to minimize.
[2023-03-19 05:57:36] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 1 ms to minimize.
[2023-03-19 05:57:36] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 0 ms to minimize.
[2023-03-19 05:57:36] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-19 05:57:37] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2023-03-19 05:57:37] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2023-03-19 05:57:38] [INFO ] Deduced a trap composed of 15 places in 387 ms of which 1 ms to minimize.
[2023-03-19 05:57:38] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 1 ms to minimize.
[2023-03-19 05:57:38] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2023-03-19 05:57:39] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 0 ms to minimize.
[2023-03-19 05:57:39] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-19 05:57:39] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-19 05:57:39] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2023-03-19 05:57:40] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2023-03-19 05:57:40] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2023-03-19 05:57:40] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 0 ms to minimize.
[2023-03-19 05:57:40] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 0 ms to minimize.
[2023-03-19 05:57:41] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2023-03-19 05:57:41] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-19 05:57:41] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-19 05:57:42] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2023-03-19 05:57:42] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-19 05:57:42] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 0 ms to minimize.
[2023-03-19 05:57:42] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2023-03-19 05:57:43] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2023-03-19 05:57:43] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2023-03-19 05:57:43] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2023-03-19 05:57:44] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 0 ms to minimize.
[2023-03-19 05:57:44] [INFO ] Deduced a trap composed of 14 places in 466 ms of which 0 ms to minimize.
[2023-03-19 05:57:44] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 10683 ms
[2023-03-19 05:57:44] [INFO ] After 21594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1438 ms.
[2023-03-19 05:57:46] [INFO ] After 23342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 05:57:46] [INFO ] Flatten gal took : 69 ms
[2023-03-19 05:57:46] [INFO ] Flatten gal took : 48 ms
[2023-03-19 05:57:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6497992616010720742.gal : 9 ms
[2023-03-19 05:57:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11507867182254842632.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6497992616010720742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11507867182254842632.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11507867182254842632.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :31 after 706
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :706 after 140404
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :140404 after 5.45876e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.45876e+08 after 5.85925e+13
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.85925e+13 after 5.85925e+13
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.85925e+13 after 5.85925e+13
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.85925e+13 after 5.85925e+13
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.85925e+13 after 5.85925e+13
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.85925e+13 after 5.85925e+13
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.85925e+13 after 5.86045e+13
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :5.86045e+13 after 5.86552e+13
Detected timeout of ITS tools.
[2023-03-19 05:58:01] [INFO ] Flatten gal took : 55 ms
[2023-03-19 05:58:01] [INFO ] Applying decomposition
[2023-03-19 05:58:01] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9911712099690921759.txt' '-o' '/tmp/graph9911712099690921759.bin' '-w' '/tmp/graph9911712099690921759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9911712099690921759.bin' '-l' '-1' '-v' '-w' '/tmp/graph9911712099690921759.weights' '-q' '0' '-e' '0.001'
[2023-03-19 05:58:01] [INFO ] Decomposing Gal with order
[2023-03-19 05:58:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 05:58:02] [INFO ] Removed a total of 413 redundant transitions.
[2023-03-19 05:58:02] [INFO ] Flatten gal took : 117 ms
[2023-03-19 05:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 529 labels/synchronizations in 97 ms.
[2023-03-19 05:58:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15041767516969125299.gal : 17 ms
[2023-03-19 05:58:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7286842927866745907.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15041767516969125299.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7286842927866745907.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7286842927866745907.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2 after 78
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :78 after 4206
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4206 after 2.02208e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.16619e+17 after 2.66649e+26
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.66649e+26 after 7.51992e+39
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3059287162937468543
[2023-03-19 05:58:17] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3059287162937468543
Running compilation step : cd /tmp/ltsmin3059287162937468543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2094 ms.
Running link step : cd /tmp/ltsmin3059287162937468543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin3059287162937468543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPsPT030BReachabilityFireability11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 05:58:32] [INFO ] Flatten gal took : 69 ms
[2023-03-19 05:58:32] [INFO ] Applying decomposition
[2023-03-19 05:58:32] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4739755671575940033.txt' '-o' '/tmp/graph4739755671575940033.bin' '-w' '/tmp/graph4739755671575940033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4739755671575940033.bin' '-l' '-1' '-v' '-w' '/tmp/graph4739755671575940033.weights' '-q' '0' '-e' '0.001'
[2023-03-19 05:58:32] [INFO ] Decomposing Gal with order
[2023-03-19 05:58:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 05:58:33] [INFO ] Removed a total of 270 redundant transitions.
[2023-03-19 05:58:33] [INFO ] Flatten gal took : 109 ms
[2023-03-19 05:58:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-19 05:58:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality863196127244706005.gal : 22 ms
[2023-03-19 05:58:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16379447415358512565.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality863196127244706005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16379447415358512565.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality16379447415358512565.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 2.05621e+11
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.76952e+84 after 9.6728e+84
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.6728e+84 after 2.17762e+85
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.17762e+85 after 5.88469e+86
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 06:28:37] [INFO ] Flatten gal took : 945 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin476818355944116837
[2023-03-19 06:28:38] [INFO ] Computing symmetric may disable matrix : 886 transitions.
[2023-03-19 06:28:38] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:28:38] [INFO ] Computing symmetric may enable matrix : 886 transitions.
[2023-03-19 06:28:38] [INFO ] Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:28:38] [INFO ] Applying decomposition
[2023-03-19 06:28:41] [INFO ] Flatten gal took : 2723 ms
[2023-03-19 06:28:43] [INFO ] Computing Do-Not-Accords matrix : 886 transitions.
[2023-03-19 06:28:43] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:28:43] [INFO ] Built C files in 5559ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin476818355944116837
Running compilation step : cd /tmp/ltsmin476818355944116837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1153608340273314268.txt' '-o' '/tmp/graph1153608340273314268.bin' '-w' '/tmp/graph1153608340273314268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1153608340273314268.bin' '-l' '-1' '-v' '-w' '/tmp/graph1153608340273314268.weights' '-q' '0' '-e' '0.001'
[2023-03-19 06:28:43] [INFO ] Decomposing Gal with order
[2023-03-19 06:28:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 06:28:44] [INFO ] Removed a total of 407 redundant transitions.
[2023-03-19 06:28:44] [INFO ] Flatten gal took : 293 ms
[2023-03-19 06:28:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 542 labels/synchronizations in 362 ms.
[2023-03-19 06:28:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8416361434743481883.gal : 29 ms
[2023-03-19 06:28:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14702936142452796746.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability8416361434743481883.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14702936142452796746.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability14702936142452796746.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 6294
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6294 after 9.09797e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.09797e+07 after 3.64083e+19
Compilation finished in 3238 ms.
Running link step : cd /tmp/ltsmin476818355944116837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 112 ms.
Running LTSmin : cd /tmp/ltsmin476818355944116837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT030BReachabilityFireability11==true'
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.64083e+19 after 2.70617e+48
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 138520 kB
After kill :
MemTotal: 16393220 kB
MemFree: 6934188 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPs-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713600479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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