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.r453-smll-167912645700646.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 StigmergyElection-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645700646
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 6.7K Feb 26 16:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 16:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 16:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 StigmergyElection-PT-07b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679425927865

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-21 19:12:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 19:12:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:12:12] [INFO ] Load time of PNML (sax parser for PT used): 866 ms
[2023-03-21 19:12:12] [INFO ] Transformed 971 places.
[2023-03-21 19:12:12] [INFO ] Transformed 5542 transitions.
[2023-03-21 19:12:12] [INFO ] Found NUPN structural information;
[2023-03-21 19:12:12] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 1110 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 1413 ms. (steps per millisecond=7 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
[2023-03-21 19:12:14] [INFO ] Flatten gal took : 1378 ms
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
[2023-03-21 19:12:15] [INFO ] Flatten gal took : 571 ms
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
[2023-03-21 19:12:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7530739194079443434.gal : 261 ms
[2023-03-21 19:12:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7713574641651688494.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/ReachabilityCardinality7530739194079443434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7713574641651688494.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 ...328
Loading property file /tmp/ReachabilityCardinality7713574641651688494.prop.
Interrupted probabilistic random walk after 246242 steps, run timeout after 6001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 246242 steps, saw 44249 distinct states, run finished after 6002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 5542 rows 971 cols
[2023-03-21 19:12:21] [INFO ] Computed 8 place invariants in 300 ms
[2023-03-21 19:12:23] [INFO ] After 998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 19:12:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :10 after 20
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :20 after 37
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :37 after 217
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :217 after 3621
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :3621 after 11655
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :11655 after 28923
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :28923 after 30712
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :30712 after 125602
[2023-03-21 19:12:28] [INFO ] After 4958ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :125602 after 1.28179e+07
[2023-03-21 19:12:32] [INFO ] Deduced a trap composed of 193 places in 3300 ms of which 9 ms to minimize.
[2023-03-21 19:12:35] [INFO ] Deduced a trap composed of 189 places in 2890 ms of which 2 ms to minimize.
[2023-03-21 19:12:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 6786 ms
[2023-03-21 19:12:39] [INFO ] Deduced a trap composed of 194 places in 2950 ms of which 2 ms to minimize.
[2023-03-21 19:12:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3394 ms
[2023-03-21 19:12:43] [INFO ] Deduced a trap composed of 193 places in 3705 ms of which 4 ms to minimize.
[2023-03-21 19:12:46] [INFO ] Deduced a trap composed of 194 places in 2982 ms of which 5 ms to minimize.
[2023-03-21 19:12:50] [INFO ] Deduced a trap composed of 191 places in 3078 ms of which 2 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-21 19:12:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:12:50] [INFO ] After 26838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 300 ms.
Support contains 120 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 760 edges and 971 vertex of which 68 / 971 are part of one of the 13 SCC in 8 ms
Free SCC test removed 55 places
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Graph (complete) has 2030 edges and 916 vertex of which 905 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.47 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 441 rules applied. Total rules applied 443 place count 905 transition count 5026
Reduce places removed 436 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 445 rules applied. Total rules applied 888 place count 469 transition count 5017
Reduce places removed 4 places and 0 transitions.
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Iterating post reduction 2 with 72 rules applied. Total rules applied 960 place count 465 transition count 4949
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 1028 place count 397 transition count 4949
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 1028 place count 397 transition count 4928
Deduced a syphon composed of 21 places in 7 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 1070 place count 376 transition count 4928
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1106 place count 340 transition count 4892
Iterating global reduction 4 with 36 rules applied. Total rules applied 1142 place count 340 transition count 4892
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1144 place count 340 transition count 4890
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1144 place count 340 transition count 4888
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1148 place count 338 transition count 4888
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1154 place count 332 transition count 1918
Iterating global reduction 5 with 6 rules applied. Total rules applied 1160 place count 332 transition count 1918
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1162 place count 332 transition count 1916
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1218 place count 304 transition count 1888
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1220 place count 302 transition count 1886
Iterating global reduction 6 with 2 rules applied. Total rules applied 1222 place count 302 transition count 1886
Performed 12 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1246 place count 290 transition count 1888
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1248 place count 290 transition count 1886
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1251 place count 290 transition count 1883
Free-agglomeration rule applied 44 times.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1295 place count 290 transition count 1839
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 1339 place count 246 transition count 1839
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1343 place count 246 transition count 1835
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1344 place count 246 transition count 1835
Applied a total of 1344 rules in 2724 ms. Remains 246 /971 variables (removed 725) and now considering 1835/5542 (removed 3707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2725 ms. Remains : 246/971 places, 1835/5542 transitions.
Incomplete random walk after 10000 steps, including 295 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 289148 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 289148 steps, saw 53520 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :3
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 1835 rows 246 cols
[2023-03-21 19:12:56] [INFO ] Computed 7 place invariants in 13 ms
[2023-03-21 19:12:57] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 19:12:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-21 19:12:58] [INFO ] After 1328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 19:12:58] [INFO ] State equation strengthened by 1264 read => feed constraints.
[2023-03-21 19:13:00] [INFO ] After 1706ms SMT Verify possible using 1264 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 19:13:01] [INFO ] Deduced a trap composed of 59 places in 1162 ms of which 1 ms to minimize.
[2023-03-21 19:13:03] [INFO ] Deduced a trap composed of 48 places in 1632 ms of which 1 ms to minimize.
[2023-03-21 19:13:04] [INFO ] Deduced a trap composed of 47 places in 894 ms of which 1 ms to minimize.
[2023-03-21 19:13:05] [INFO ] Deduced a trap composed of 43 places in 852 ms of which 1 ms to minimize.
[2023-03-21 19:13:06] [INFO ] Deduced a trap composed of 34 places in 755 ms of which 1 ms to minimize.
[2023-03-21 19:13:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5769 ms
[2023-03-21 19:13:07] [INFO ] Deduced a trap composed of 52 places in 632 ms of which 1 ms to minimize.
[2023-03-21 19:13:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 757 ms
[2023-03-21 19:13:08] [INFO ] Deduced a trap composed of 33 places in 924 ms of which 0 ms to minimize.
[2023-03-21 19:13:09] [INFO ] Deduced a trap composed of 58 places in 920 ms of which 1 ms to minimize.
[2023-03-21 19:13:10] [INFO ] Deduced a trap composed of 50 places in 972 ms of which 1 ms to minimize.
[2023-03-21 19:13:11] [INFO ] Deduced a trap composed of 47 places in 875 ms of which 2 ms to minimize.
[2023-03-21 19:13:12] [INFO ] Deduced a trap composed of 48 places in 811 ms of which 2 ms to minimize.
[2023-03-21 19:13:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 4917 ms
[2023-03-21 19:13:13] [INFO ] Deduced a trap composed of 35 places in 767 ms of which 3 ms to minimize.
[2023-03-21 19:13:14] [INFO ] Deduced a trap composed of 34 places in 742 ms of which 1 ms to minimize.
[2023-03-21 19:13:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1688 ms
[2023-03-21 19:13:15] [INFO ] Deduced a trap composed of 46 places in 692 ms of which 1 ms to minimize.
[2023-03-21 19:13:16] [INFO ] Deduced a trap composed of 47 places in 674 ms of which 0 ms to minimize.
[2023-03-21 19:13:17] [INFO ] Deduced a trap composed of 49 places in 626 ms of which 1 ms to minimize.
[2023-03-21 19:13:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2313 ms
[2023-03-21 19:13:17] [INFO ] After 18581ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 609 ms.
[2023-03-21 19:13:18] [INFO ] After 20901ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 45 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 1835/1835 transitions.
Graph (trivial) has 151 edges and 246 vertex of which 24 / 246 are part of one of the 10 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 26 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 848 edges and 232 vertex of which 230 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 230 transition count 1758
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 56 rules applied. Total rules applied 108 place count 182 transition count 1750
Reduce places removed 3 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 14 rules applied. Total rules applied 122 place count 179 transition count 1739
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 135 place count 168 transition count 1737
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 135 place count 168 transition count 1727
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 155 place count 158 transition count 1727
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 161 place count 152 transition count 1578
Iterating global reduction 4 with 6 rules applied. Total rules applied 167 place count 152 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 151 transition count 1576
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 151 transition count 1576
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 193 place count 139 transition count 1562
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 198 place count 139 transition count 1557
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 201 place count 136 transition count 1537
Iterating global reduction 5 with 3 rules applied. Total rules applied 204 place count 136 transition count 1537
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 135 transition count 1536
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 216 place count 130 transition count 1545
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 219 place count 130 transition count 1542
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 130 transition count 1540
Free-agglomeration rule applied 14 times with reduction of 216 identical transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 235 place count 130 transition count 1310
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Iterating post reduction 6 with 434 rules applied. Total rules applied 669 place count 116 transition count 890
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 7 with 64 rules applied. Total rules applied 733 place count 116 transition count 826
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 734 place count 116 transition count 826
Applied a total of 734 rules in 768 ms. Remains 116 /246 variables (removed 130) and now considering 826/1835 (removed 1009) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 116/246 places, 826/1835 transitions.
Incomplete random walk after 10000 steps, including 409 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :1
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 826 rows 116 cols
[2023-03-21 19:13:19] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-21 19:13:19] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:13:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-21 19:13:19] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:13:20] [INFO ] State equation strengthened by 658 read => feed constraints.
[2023-03-21 19:13:20] [INFO ] After 514ms SMT Verify possible using 658 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 19:13:20] [INFO ] Deduced a trap composed of 16 places in 354 ms of which 1 ms to minimize.
[2023-03-21 19:13:21] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2023-03-21 19:13:21] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 1 ms to minimize.
[2023-03-21 19:13:21] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 0 ms to minimize.
[2023-03-21 19:13:22] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 0 ms to minimize.
[2023-03-21 19:13:22] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 1 ms to minimize.
[2023-03-21 19:13:22] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 0 ms to minimize.
[2023-03-21 19:13:22] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2023-03-21 19:13:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2415 ms
[2023-03-21 19:13:23] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 0 ms to minimize.
[2023-03-21 19:13:23] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 1 ms to minimize.
[2023-03-21 19:13:24] [INFO ] Deduced a trap composed of 16 places in 339 ms of which 1 ms to minimize.
[2023-03-21 19:13:24] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 6 ms to minimize.
[2023-03-21 19:13:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1437 ms
[2023-03-21 19:13:24] [INFO ] After 4554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-21 19:13:24] [INFO ] After 5169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 15 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 826/826 transitions.
Graph (trivial) has 61 edges and 116 vertex of which 6 / 116 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 112 transition count 797
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 91 transition count 795
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 90 transition count 794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 89 transition count 794
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 48 place count 89 transition count 790
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 56 place count 85 transition count 790
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 63 place count 78 transition count 783
Iterating global reduction 4 with 7 rules applied. Total rules applied 70 place count 78 transition count 783
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 73 place count 75 transition count 780
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 75 transition count 780
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 92 place count 67 transition count 772
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 67 transition count 770
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 66 transition count 769
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 66 transition count 769
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 114 place count 66 transition count 751
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 63 transition count 748
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 121 place count 63 transition count 747
Free-agglomeration rule applied 6 times with reduction of 72 identical transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 127 place count 63 transition count 669
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 5 with 79 rules applied. Total rules applied 206 place count 57 transition count 596
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 6 with 54 rules applied. Total rules applied 260 place count 57 transition count 542
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 261 place count 56 transition count 541
Applied a total of 261 rules in 591 ms. Remains 56 /116 variables (removed 60) and now considering 541/826 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 56/116 places, 541/826 transitions.
Incomplete random walk after 10000 steps, including 877 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 3) seen :1
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 541 rows 56 cols
[2023-03-21 19:13:25] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-21 19:13:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-21 19:13:25] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 19:13:25] [INFO ] State equation strengthened by 452 read => feed constraints.
[2023-03-21 19:13:26] [INFO ] After 109ms SMT Verify possible using 452 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:13:26] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:13:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-21 19:13:26] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:13:26] [INFO ] After 168ms SMT Verify possible using 452 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 19:13:26] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-21 19:13:26] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 541/541 transitions.
Graph (trivial) has 30 edges and 56 vertex of which 6 / 56 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 52 transition count 524
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 41 transition count 524
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 39 transition count 522
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 39 transition count 522
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 38 transition count 520
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 38 transition count 520
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 35 transition count 517
Drop transitions removed 1 transitions
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 2 with 82 rules applied. Total rules applied 117 place count 35 transition count 435
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 33 transition count 433
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 33 transition count 433
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 129 place count 33 transition count 425
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 154 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 292 place count 24 transition count 271
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 292 place count 24 transition count 270
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 23 transition count 270
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 301 place count 16 transition count 263
Iterating global reduction 4 with 7 rules applied. Total rules applied 308 place count 16 transition count 263
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 371 place count 16 transition count 200
Performed 2 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 377 place count 12 transition count 150
Drop transitions removed 2 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 5 with 96 rules applied. Total rules applied 473 place count 12 transition count 54
Performed 5 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 487 place count 3 transition count 12
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 496 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 496 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 498 place count 2 transition count 2
Applied a total of 498 rules in 86 ms. Remains 2 /56 variables (removed 54) and now considering 2/541 (removed 539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2/56 places, 2/541 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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)
All properties solved without resorting to model-checking.
Total runtime 75478 ms.

BK_STOP 1679426008020

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="StigmergyElection-PT-07b"
export BK_EXAMINATION="ReachabilityCardinality"
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 StigmergyElection-PT-07b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645700646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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