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.r457-smll-167912649600694.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 ltsminxred
Input is StigmergyElection-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649600694
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 125M
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 16:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 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 124M 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-10b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679597263401

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 18:47:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 18:47:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:47:53] [INFO ] Load time of PNML (sax parser for PT used): 5724 ms
[2023-03-23 18:47:53] [INFO ] Transformed 1379 places.
[2023-03-23 18:47:54] [INFO ] Transformed 120600 transitions.
[2023-03-23 18:47:54] [INFO ] Found NUPN structural information;
[2023-03-23 18:47:54] [INFO ] Parsed PT model containing 1379 places and 120600 transitions and 2385526 arcs in 6785 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1661 ms. (steps per millisecond=6 ) properties (out of 14) seen :5
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :1
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 120600 rows 1379 cols
[2023-03-23 18:48:03] [INFO ] Computed 11 place invariants in 4295 ms
[2023-03-23 18:48:04] [INFO ] After 1241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 18:48:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 39 ms returned sat
[2023-03-23 18:48:29] [INFO ] After 23876ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-23 18:48:29] [INFO ] After 24112ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-23 18:48:29] [INFO ] After 25306ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 166 out of 1379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 120600/120600 transitions.
Graph (trivial) has 1090 edges and 1379 vertex of which 139 / 1379 are part of one of the 21 SCC in 44 ms
Free SCC test removed 118 places
Drop transitions removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Graph (complete) has 3502 edges and 1261 vertex of which 1250 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.520 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 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 592 rules applied. Total rules applied 594 place count 1250 transition count 119854
Reduce places removed 587 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 607 rules applied. Total rules applied 1201 place count 663 transition count 119834
Reduce places removed 9 places and 0 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Iterating post reduction 2 with 107 rules applied. Total rules applied 1308 place count 654 transition count 119736
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 100 rules applied. Total rules applied 1408 place count 556 transition count 119734
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1409 place count 555 transition count 119734
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 1409 place count 555 transition count 119702
Deduced a syphon composed of 32 places in 174 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1473 place count 523 transition count 119702
Discarding 56 places :
Symmetric choice reduction at 5 with 56 rule applications. Total rules 1529 place count 467 transition count 119646
Iterating global reduction 5 with 56 rules applied. Total rules applied 1585 place count 467 transition count 119646
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 1589 place count 467 transition count 119642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1590 place count 466 transition count 119642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1590 place count 466 transition count 119641
Deduced a syphon composed of 1 places in 157 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1592 place count 465 transition count 119641
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1607 place count 450 transition count 10180
Iterating global reduction 7 with 15 rules applied. Total rules applied 1622 place count 450 transition count 10180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1624 place count 450 transition count 10178
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 8 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 1692 place count 416 transition count 10144
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1694 place count 414 transition count 10142
Iterating global reduction 8 with 2 rules applied. Total rules applied 1696 place count 414 transition count 10142
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 8 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1728 place count 398 transition count 10144
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1733 place count 398 transition count 10139
Free-agglomeration rule applied 53 times.
Iterating global reduction 8 with 53 rules applied. Total rules applied 1786 place count 398 transition count 10086
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 8 with 53 rules applied. Total rules applied 1839 place count 345 transition count 10086
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1841 place count 345 transition count 10084
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1848 place count 345 transition count 10084
Applied a total of 1848 rules in 68616 ms. Remains 345 /1379 variables (removed 1034) and now considering 10084/120600 (removed 110516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68626 ms. Remains : 345/1379 places, 10084/120600 transitions.
Incomplete random walk after 10000 steps, including 181 resets, run finished after 628 ms. (steps per millisecond=15 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :1
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 10084 rows 345 cols
[2023-03-23 18:49:39] [INFO ] Computed 10 place invariants in 137 ms
[2023-03-23 18:49:40] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 18:49:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-23 18:49:47] [INFO ] After 6744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 18:49:50] [INFO ] State equation strengthened by 5066 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
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-23 18:50:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:50:05] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 120 ms.
Support contains 137 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 10084/10084 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 21 place count 345 transition count 10063
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 28 rules applied. Total rules applied 49 place count 324 transition count 10056
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 56 place count 318 transition count 10055
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 56 place count 318 transition count 10051
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 64 place count 314 transition count 10051
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 313 transition count 10050
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 313 transition count 10050
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 76 place count 308 transition count 10045
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 308 transition count 10043
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 86 place count 304 transition count 10046
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 304 transition count 10044
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 91 place count 304 transition count 10041
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 101 place count 304 transition count 10031
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 111 place count 294 transition count 10031
Applied a total of 111 rules in 27302 ms. Remains 294 /345 variables (removed 51) and now considering 10031/10084 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27302 ms. Remains : 294/345 places, 10031/10084 transitions.
Incomplete random walk after 10000 steps, including 206 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 88866 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88866 steps, saw 17056 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10031 rows 294 cols
[2023-03-23 18:50:36] [INFO ] Computed 10 place invariants in 120 ms
[2023-03-23 18:50:36] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 18:50:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-23 18:50:42] [INFO ] After 5119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 18:50:45] [INFO ] State equation strengthened by 5674 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
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-23 18:51:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:51:01] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 116 ms.
Support contains 137 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 10031/10031 transitions.
Applied a total of 0 rules in 9906 ms. Remains 294 /294 variables (removed 0) and now considering 10031/10031 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9906 ms. Remains : 294/294 places, 10031/10031 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 10031/10031 transitions.
Applied a total of 0 rules in 9519 ms. Remains 294 /294 variables (removed 0) and now considering 10031/10031 (removed 0) transitions.
[2023-03-23 18:51:21] [INFO ] Invariant cache hit.
[2023-03-23 18:51:23] [INFO ] Implicit Places using invariants in 2387 ms returned []
Implicit Place search using SMT only with invariants took 2388 ms to find 0 implicit places.
[2023-03-23 18:51:23] [INFO ] Invariant cache hit.
[2023-03-23 18:51:29] [INFO ] Dead Transitions using invariants and state equation in 6112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18027 ms. Remains : 294/294 places, 10031/10031 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 294 transition count 10023
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 286 transition count 10020
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 19 place count 286 transition count 10018
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 284 transition count 10018
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 282 transition count 10016
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 282 transition count 10015
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 281 transition count 10015
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 40 place count 281 transition count 10015
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 281 transition count 10011
Applied a total of 44 rules in 25284 ms. Remains 281 /294 variables (removed 13) and now considering 10011/10031 (removed 20) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 10011 rows 281 cols
[2023-03-23 18:51:55] [INFO ] Computed 10 place invariants in 108 ms
[2023-03-23 18:51:55] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 18:51:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-23 18:52:00] [INFO ] After 5033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 18:52:06] [INFO ] Deduced a trap composed of 43 places in 4546 ms of which 9 ms to minimize.
[2023-03-23 18:52:10] [INFO ] Deduced a trap composed of 54 places in 4475 ms of which 2 ms to minimize.
[2023-03-23 18:52:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9760 ms
[2023-03-23 18:52:16] [INFO ] Deduced a trap composed of 57 places in 5063 ms of which 2 ms to minimize.
[2023-03-23 18:52:21] [INFO ] Deduced a trap composed of 38 places in 4714 ms of which 1 ms to minimize.
[2023-03-23 18:52:25] [INFO ] Deduced a trap composed of 54 places in 4242 ms of which 2 ms to minimize.
[2023-03-23 18:52:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 15024 ms
[2023-03-23 18:52:32] [INFO ] Deduced a trap composed of 45 places in 4911 ms of which 1 ms to minimize.
[2023-03-23 18:52:37] [INFO ] Deduced a trap composed of 55 places in 4665 ms of which 1 ms to minimize.
[2023-03-23 18:52:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10334 ms
[2023-03-23 18:52:37] [INFO ] After 41946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1486 ms.
[2023-03-23 18:52:39] [INFO ] After 43582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-23 18:52:39] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-23 18:52:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 294 places, 10031 transitions and 194189 arcs took 147 ms.
[2023-03-23 18:52:41] [INFO ] Flatten gal took : 1873 ms
Total runtime 294579 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/539/inv_0_ --invariant=/tmp/539/inv_1_ --invariant=/tmp/539/inv_2_ --invariant=/tmp/539/inv_3_ --invariant=/tmp/539/inv_4_ --invariant=/tmp/539/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12061528 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15928104 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-10b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-10b, 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 r457-smll-167912649600694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-10b.tgz
mv StigmergyElection-PT-10b 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 ;