About the Execution of Marcie+red for PolyORBNT-COL-S05J40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5994.067 | 3600000.00 | 3670676.00 | 7518.80 | ?????????????TT? | normal |
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.r298-tall-167873952000650.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 marciexred
Input is PolyORBNT-COL-S05J40, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952000650
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 23:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 23:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 23:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S05J40-CTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679621293015
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 01:28:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 01:28:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 01:28:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 01:28:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 01:28:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 718 ms
[2023-03-24 01:28:15] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2023-03-24 01:28:15] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-24 01:28:15] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10004 steps, including 794 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 30) seen :18
Incomplete Best-First random walk after 10001 steps, including 249 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 234 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 393 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 01:28:16] [INFO ] Computed 13 place invariants in 13 ms
[2023-03-24 01:28:16] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2023-03-24 01:28:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-24 01:28:16] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
[2023-03-24 01:28:16] [INFO ] Flatten gal took : 20 ms
[2023-03-24 01:28:16] [INFO ] Flatten gal took : 9 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-24 01:28:16] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 45 ms.
[2023-03-24 01:28:16] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2023-03-24 01:28:16] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-24 01:28:16] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-24 01:28:16] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 01:28:16] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-24 01:28:16] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 01:28:16] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 01:28:16] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-24 01:28:16] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 01:28:16] [INFO ] Reduced 555 identical enabling conditions.
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 628 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 19 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
[2023-03-24 01:28:16] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-24 01:28:16] [INFO ] Computed 102 place invariants in 75 ms
[2023-03-24 01:28:17] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-24 01:28:17] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 629 cols
[2023-03-24 01:28:17] [INFO ] Computed 102 place invariants in 31 ms
[2023-03-24 01:28:17] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-24 01:28:17] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-24 01:28:17] [INFO ] Invariant cache hit.
[2023-03-24 01:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 01:28:17] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 840/935 transitions.
Applied a total of 0 rules in 13 ms. Remains 629 /629 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1362 ms. Remains : 629/629 places, 840/935 transitions.
Support contains 628 out of 629 places after structural reductions.
[2023-03-24 01:28:18] [INFO ] Flatten gal took : 113 ms
[2023-03-24 01:28:18] [INFO ] Flatten gal took : 98 ms
[2023-03-24 01:28:19] [INFO ] Input system was already deterministic with 840 transitions.
Incomplete random walk after 10000 steps, including 688 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 63) seen :43
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-24 01:28:19] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-24 01:28:19] [INFO ] Invariant cache hit.
[2023-03-24 01:28:20] [INFO ] [Real]Absence check using 95 positive place invariants in 31 ms returned sat
[2023-03-24 01:28:20] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 01:28:20] [INFO ] After 286ms SMT Verify possible using state equation in real domain returned unsat :11 sat :1 real:3
[2023-03-24 01:28:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 01:28:20] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :11 sat :0 real:4
[2023-03-24 01:28:20] [INFO ] After 717ms SMT Verify possible using all constraints in real domain returned unsat :11 sat :0 real:4
[2023-03-24 01:28:21] [INFO ] [Nat]Absence check using 95 positive place invariants in 26 ms returned sat
[2023-03-24 01:28:21] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-24 01:28:30] [INFO ] After 9541ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :1
[2023-03-24 01:28:30] [INFO ] After 63ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :13 sat :1
[2023-03-24 01:28:30] [INFO ] Deduced a trap composed of 275 places in 239 ms of which 6 ms to minimize.
[2023-03-24 01:28:31] [INFO ] Deduced a trap composed of 266 places in 208 ms of which 1 ms to minimize.
[2023-03-24 01:28:31] [INFO ] Deduced a trap composed of 284 places in 198 ms of which 1 ms to minimize.
[2023-03-24 01:28:31] [INFO ] Deduced a trap composed of 269 places in 201 ms of which 0 ms to minimize.
[2023-03-24 01:28:31] [INFO ] Deduced a trap composed of 269 places in 202 ms of which 1 ms to minimize.
[2023-03-24 01:28:32] [INFO ] Deduced a trap composed of 269 places in 214 ms of which 0 ms to minimize.
[2023-03-24 01:28:32] [INFO ] Deduced a trap composed of 272 places in 240 ms of which 1 ms to minimize.
[2023-03-24 01:28:32] [INFO ] Deduced a trap composed of 275 places in 188 ms of which 1 ms to minimize.
[2023-03-24 01:28:32] [INFO ] Deduced a trap composed of 272 places in 187 ms of which 1 ms to minimize.
[2023-03-24 01:28:33] [INFO ] Deduced a trap composed of 281 places in 199 ms of which 0 ms to minimize.
[2023-03-24 01:28:33] [INFO ] Deduced a trap composed of 269 places in 202 ms of which 1 ms to minimize.
[2023-03-24 01:28:33] [INFO ] Deduced a trap composed of 272 places in 205 ms of which 1 ms to minimize.
[2023-03-24 01:28:34] [INFO ] Deduced a trap composed of 251 places in 192 ms of which 1 ms to minimize.
[2023-03-24 01:28:34] [INFO ] Deduced a trap composed of 257 places in 194 ms of which 1 ms to minimize.
[2023-03-24 01:28:34] [INFO ] Deduced a trap composed of 263 places in 196 ms of which 0 ms to minimize.
[2023-03-24 01:28:34] [INFO ] Deduced a trap composed of 260 places in 190 ms of which 1 ms to minimize.
[2023-03-24 01:28:35] [INFO ] Deduced a trap composed of 248 places in 197 ms of which 0 ms to minimize.
[2023-03-24 01:28:35] [INFO ] Deduced a trap composed of 251 places in 199 ms of which 1 ms to minimize.
[2023-03-24 01:28:35] [INFO ] Deduced a trap composed of 266 places in 189 ms of which 0 ms to minimize.
[2023-03-24 01:28:35] [INFO ] Deduced a trap composed of 269 places in 194 ms of which 0 ms to minimize.
[2023-03-24 01:28:36] [INFO ] Deduced a trap composed of 269 places in 192 ms of which 1 ms to minimize.
[2023-03-24 01:28:36] [INFO ] Deduced a trap composed of 245 places in 201 ms of which 1 ms to minimize.
[2023-03-24 01:28:36] [INFO ] Deduced a trap composed of 260 places in 192 ms of which 1 ms to minimize.
[2023-03-24 01:28:37] [INFO ] Deduced a trap composed of 275 places in 189 ms of which 0 ms to minimize.
[2023-03-24 01:28:37] [INFO ] Deduced a trap composed of 275 places in 196 ms of which 1 ms to minimize.
[2023-03-24 01:28:37] [INFO ] Deduced a trap composed of 269 places in 197 ms of which 1 ms to minimize.
[2023-03-24 01:28:38] [INFO ] Deduced a trap composed of 263 places in 188 ms of which 1 ms to minimize.
[2023-03-24 01:28:38] [INFO ] Deduced a trap composed of 263 places in 197 ms of which 0 ms to minimize.
[2023-03-24 01:28:38] [INFO ] Deduced a trap composed of 254 places in 192 ms of which 0 ms to minimize.
[2023-03-24 01:28:38] [INFO ] Deduced a trap composed of 263 places in 179 ms of which 0 ms to minimize.
[2023-03-24 01:28:39] [INFO ] Deduced a trap composed of 257 places in 200 ms of which 1 ms to minimize.
[2023-03-24 01:28:39] [INFO ] Deduced a trap composed of 263 places in 175 ms of which 1 ms to minimize.
[2023-03-24 01:28:39] [INFO ] Deduced a trap composed of 260 places in 192 ms of which 1 ms to minimize.
[2023-03-24 01:28:40] [INFO ] Deduced a trap composed of 254 places in 191 ms of which 1 ms to minimize.
[2023-03-24 01:28:40] [INFO ] Deduced a trap composed of 275 places in 184 ms of which 1 ms to minimize.
[2023-03-24 01:28:40] [INFO ] Deduced a trap composed of 254 places in 191 ms of which 1 ms to minimize.
[2023-03-24 01:28:40] [INFO ] Deduced a trap composed of 260 places in 190 ms of which 0 ms to minimize.
[2023-03-24 01:28:41] [INFO ] Deduced a trap composed of 260 places in 221 ms of which 1 ms to minimize.
[2023-03-24 01:28:41] [INFO ] Deduced a trap composed of 251 places in 198 ms of which 1 ms to minimize.
[2023-03-24 01:28:41] [INFO ] Deduced a trap composed of 266 places in 191 ms of which 2 ms to minimize.
[2023-03-24 01:28:41] [INFO ] Deduced a trap composed of 266 places in 194 ms of which 0 ms to minimize.
[2023-03-24 01:28:42] [INFO ] Deduced a trap composed of 266 places in 184 ms of which 1 ms to minimize.
[2023-03-24 01:28:42] [INFO ] Deduced a trap composed of 266 places in 179 ms of which 0 ms to minimize.
[2023-03-24 01:28:43] [INFO ] Deduced a trap composed of 263 places in 192 ms of which 0 ms to minimize.
[2023-03-24 01:28:43] [INFO ] Deduced a trap composed of 254 places in 178 ms of which 1 ms to minimize.
[2023-03-24 01:28:43] [INFO ] Deduced a trap composed of 269 places in 197 ms of which 1 ms to minimize.
[2023-03-24 01:28:43] [INFO ] Deduced a trap composed of 260 places in 179 ms of which 0 ms to minimize.
[2023-03-24 01:28:44] [INFO ] Deduced a trap composed of 254 places in 182 ms of which 0 ms to minimize.
[2023-03-24 01:28:44] [INFO ] Deduced a trap composed of 257 places in 180 ms of which 0 ms to minimize.
[2023-03-24 01:28:44] [INFO ] Deduced a trap composed of 248 places in 176 ms of which 1 ms to minimize.
[2023-03-24 01:28:44] [INFO ] Deduced a trap composed of 263 places in 178 ms of which 0 ms to minimize.
[2023-03-24 01:28:45] [INFO ] Deduced a trap composed of 248 places in 180 ms of which 0 ms to minimize.
[2023-03-24 01:28:45] [INFO ] Deduced a trap composed of 272 places in 195 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 01:28:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 01:28:45] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0 real:4
Fused 15 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 46 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 96 place count 579 transition count 794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 578 transition count 794
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 97 place count 578 transition count 750
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 185 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 533 transition count 749
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 533 transition count 749
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 191 place count 531 transition count 747
Applied a total of 191 rules in 156 ms. Remains 531 /629 variables (removed 98) and now considering 747/840 (removed 93) transitions.
[2023-03-24 01:28:46] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2023-03-24 01:28:46] [INFO ] Computed 97 place invariants in 25 ms
[2023-03-24 01:28:46] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 531/629 places, 747/840 transitions.
Incomplete random walk after 10000 steps, including 461 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 373959 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 373959 steps, saw 114480 distinct states, run finished after 3004 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 01:28:49] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2023-03-24 01:28:49] [INFO ] Invariant cache hit.
[2023-03-24 01:28:49] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-24 01:28:49] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 01:28:50] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 01:28:50] [INFO ] [Nat]Absence check using 90 positive place invariants in 30 ms returned sat
[2023-03-24 01:28:50] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-24 01:28:58] [INFO ] After 8042ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-24 01:28:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 01:28:58] [INFO ] After 59ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-24 01:28:58] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2023-03-24 01:28:58] [INFO ] Deduced a trap composed of 167 places in 165 ms of which 2 ms to minimize.
[2023-03-24 01:28:59] [INFO ] Deduced a trap composed of 180 places in 164 ms of which 1 ms to minimize.
[2023-03-24 01:28:59] [INFO ] Deduced a trap composed of 173 places in 164 ms of which 11 ms to minimize.
[2023-03-24 01:28:59] [INFO ] Deduced a trap composed of 191 places in 167 ms of which 0 ms to minimize.
[2023-03-24 01:28:59] [INFO ] Deduced a trap composed of 168 places in 165 ms of which 0 ms to minimize.
[2023-03-24 01:28:59] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 0 ms to minimize.
[2023-03-24 01:28:59] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 0 ms to minimize.
[2023-03-24 01:29:00] [INFO ] Deduced a trap composed of 192 places in 186 ms of which 0 ms to minimize.
[2023-03-24 01:29:00] [INFO ] Deduced a trap composed of 170 places in 168 ms of which 1 ms to minimize.
[2023-03-24 01:29:01] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 1 ms to minimize.
[2023-03-24 01:29:01] [INFO ] Deduced a trap composed of 176 places in 171 ms of which 3 ms to minimize.
[2023-03-24 01:29:01] [INFO ] Deduced a trap composed of 161 places in 159 ms of which 1 ms to minimize.
[2023-03-24 01:29:01] [INFO ] Deduced a trap composed of 167 places in 170 ms of which 1 ms to minimize.
[2023-03-24 01:29:01] [INFO ] Deduced a trap composed of 155 places in 152 ms of which 0 ms to minimize.
[2023-03-24 01:29:02] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 1 ms to minimize.
[2023-03-24 01:29:02] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 0 ms to minimize.
[2023-03-24 01:29:02] [INFO ] Deduced a trap composed of 155 places in 167 ms of which 1 ms to minimize.
[2023-03-24 01:29:02] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 0 ms to minimize.
[2023-03-24 01:29:02] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 1 ms to minimize.
[2023-03-24 01:29:03] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 1 ms to minimize.
[2023-03-24 01:29:03] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 0 ms to minimize.
[2023-03-24 01:29:03] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 0 ms to minimize.
[2023-03-24 01:29:03] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 1 ms to minimize.
[2023-03-24 01:29:04] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 0 ms to minimize.
[2023-03-24 01:29:04] [INFO ] Deduced a trap composed of 171 places in 162 ms of which 0 ms to minimize.
[2023-03-24 01:29:05] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 1 ms to minimize.
[2023-03-24 01:29:05] [INFO ] Deduced a trap composed of 155 places in 158 ms of which 1 ms to minimize.
[2023-03-24 01:29:05] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 0 ms to minimize.
[2023-03-24 01:29:06] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 1 ms to minimize.
[2023-03-24 01:29:09] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 1 ms to minimize.
[2023-03-24 01:29:11] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 0 ms to minimize.
[2023-03-24 01:29:15] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 16703 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 01:29:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 01:29:15] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 531 transition count 746
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 530 transition count 746
Applied a total of 2 rules in 32 ms. Remains 530 /531 variables (removed 1) and now considering 746/747 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 530/531 places, 746/747 transitions.
Incomplete random walk after 10000 steps, including 536 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 499624 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499624 steps, saw 149638 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 01:29:18] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-24 01:29:18] [INFO ] Computed 97 place invariants in 27 ms
[2023-03-24 01:29:18] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-24 01:29:18] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-24 01:29:18] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 01:29:18] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-24 01:29:18] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-24 01:29:18] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 01:29:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 01:29:18] [INFO ] After 159ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 01:29:19] [INFO ] Deduced a trap composed of 200 places in 172 ms of which 1 ms to minimize.
[2023-03-24 01:29:19] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 0 ms to minimize.
[2023-03-24 01:29:19] [INFO ] Deduced a trap composed of 204 places in 153 ms of which 1 ms to minimize.
[2023-03-24 01:29:19] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 1 ms to minimize.
[2023-03-24 01:29:19] [INFO ] Deduced a trap composed of 204 places in 158 ms of which 1 ms to minimize.
[2023-03-24 01:29:20] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 1 ms to minimize.
[2023-03-24 01:29:20] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 1 ms to minimize.
[2023-03-24 01:29:20] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 1 ms to minimize.
[2023-03-24 01:29:20] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 0 ms to minimize.
[2023-03-24 01:29:20] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 0 ms to minimize.
[2023-03-24 01:29:21] [INFO ] Deduced a trap composed of 185 places in 152 ms of which 0 ms to minimize.
[2023-03-24 01:29:21] [INFO ] Deduced a trap composed of 176 places in 155 ms of which 0 ms to minimize.
[2023-03-24 01:29:21] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 1 ms to minimize.
[2023-03-24 01:29:21] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 0 ms to minimize.
[2023-03-24 01:29:21] [INFO ] Deduced a trap composed of 153 places in 150 ms of which 1 ms to minimize.
[2023-03-24 01:29:22] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2023-03-24 01:29:22] [INFO ] Deduced a trap composed of 182 places in 152 ms of which 0 ms to minimize.
[2023-03-24 01:29:22] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 0 ms to minimize.
[2023-03-24 01:29:22] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 1 ms to minimize.
[2023-03-24 01:29:23] [INFO ] Deduced a trap composed of 182 places in 155 ms of which 1 ms to minimize.
[2023-03-24 01:29:23] [INFO ] Deduced a trap composed of 149 places in 146 ms of which 0 ms to minimize.
[2023-03-24 01:29:23] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 1 ms to minimize.
[2023-03-24 01:29:23] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 0 ms to minimize.
[2023-03-24 01:29:23] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 0 ms to minimize.
[2023-03-24 01:29:24] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 1 ms to minimize.
[2023-03-24 01:29:24] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 1 ms to minimize.
[2023-03-24 01:29:24] [INFO ] Deduced a trap composed of 180 places in 163 ms of which 0 ms to minimize.
[2023-03-24 01:29:24] [INFO ] Deduced a trap composed of 155 places in 161 ms of which 0 ms to minimize.
[2023-03-24 01:29:25] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 0 ms to minimize.
[2023-03-24 01:29:25] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 0 ms to minimize.
[2023-03-24 01:29:25] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 1 ms to minimize.
[2023-03-24 01:29:26] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 0 ms to minimize.
[2023-03-24 01:29:26] [INFO ] Deduced a trap composed of 171 places in 161 ms of which 0 ms to minimize.
[2023-03-24 01:29:27] [INFO ] Deduced a trap composed of 159 places in 148 ms of which 0 ms to minimize.
[2023-03-24 01:29:27] [INFO ] Deduced a trap composed of 155 places in 148 ms of which 0 ms to minimize.
[2023-03-24 01:29:27] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 1 ms to minimize.
[2023-03-24 01:29:34] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 1 ms to minimize.
[2023-03-24 01:29:35] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2023-03-24 01:29:35] [INFO ] Deduced a trap composed of 155 places in 149 ms of which 0 ms to minimize.
[2023-03-24 01:29:35] [INFO ] Deduced a trap composed of 183 places in 166 ms of which 1 ms to minimize.
[2023-03-24 01:29:35] [INFO ] Deduced a trap composed of 179 places in 162 ms of which 0 ms to minimize.
[2023-03-24 01:29:36] [INFO ] Deduced a trap composed of 182 places in 156 ms of which 0 ms to minimize.
[2023-03-24 01:29:36] [INFO ] Deduced a trap composed of 179 places in 150 ms of which 1 ms to minimize.
[2023-03-24 01:29:36] [INFO ] Deduced a trap composed of 182 places in 148 ms of which 1 ms to minimize.
[2023-03-24 01:29:37] [INFO ] Deduced a trap composed of 180 places in 145 ms of which 1 ms to minimize.
[2023-03-24 01:29:37] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 1 ms to minimize.
[2023-03-24 01:29:37] [INFO ] Deduced a trap composed of 182 places in 165 ms of which 1 ms to minimize.
[2023-03-24 01:29:37] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 1 ms to minimize.
[2023-03-24 01:29:37] [INFO ] Deduced a trap composed of 168 places in 160 ms of which 0 ms to minimize.
[2023-03-24 01:29:38] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 0 ms to minimize.
[2023-03-24 01:29:43] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 24515 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 01:29:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 01:29:43] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 25 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 27 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-24 01:29:43] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 01:29:43] [INFO ] Invariant cache hit.
[2023-03-24 01:29:44] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-24 01:29:44] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 01:29:44] [INFO ] Invariant cache hit.
[2023-03-24 01:29:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 01:29:45] [INFO ] Implicit Places using invariants and state equation in 1889 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
[2023-03-24 01:29:46] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-24 01:29:46] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 01:29:46] [INFO ] Invariant cache hit.
[2023-03-24 01:29:46] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2987 ms. Remains : 530/530 places, 746/746 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 107 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2023-03-24 01:29:46] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 01:29:46] [INFO ] [Real]Absence check using 90 positive place invariants in 15 ms returned sat
[2023-03-24 01:29:46] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-24 01:29:46] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 01:29:46] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-24 01:29:46] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-24 01:29:47] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 01:29:47] [INFO ] Deduced a trap composed of 177 places in 145 ms of which 1 ms to minimize.
[2023-03-24 01:29:47] [INFO ] Deduced a trap composed of 168 places in 175 ms of which 1 ms to minimize.
[2023-03-24 01:29:47] [INFO ] Deduced a trap composed of 174 places in 163 ms of which 1 ms to minimize.
[2023-03-24 01:29:47] [INFO ] Deduced a trap composed of 174 places in 161 ms of which 1 ms to minimize.
[2023-03-24 01:29:48] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 0 ms to minimize.
[2023-03-24 01:29:48] [INFO ] Deduced a trap composed of 165 places in 160 ms of which 1 ms to minimize.
[2023-03-24 01:29:48] [INFO ] Deduced a trap composed of 174 places in 153 ms of which 0 ms to minimize.
[2023-03-24 01:29:48] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 0 ms to minimize.
[2023-03-24 01:29:48] [INFO ] Deduced a trap composed of 177 places in 158 ms of which 0 ms to minimize.
[2023-03-24 01:29:49] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 0 ms to minimize.
[2023-03-24 01:29:49] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 0 ms to minimize.
[2023-03-24 01:29:49] [INFO ] Deduced a trap composed of 147 places in 154 ms of which 1 ms to minimize.
[2023-03-24 01:29:49] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 0 ms to minimize.
[2023-03-24 01:29:50] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 1 ms to minimize.
[2023-03-24 01:29:50] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 0 ms to minimize.
[2023-03-24 01:29:50] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 1 ms to minimize.
[2023-03-24 01:29:50] [INFO ] Deduced a trap composed of 174 places in 176 ms of which 1 ms to minimize.
[2023-03-24 01:29:50] [INFO ] Deduced a trap composed of 159 places in 153 ms of which 0 ms to minimize.
[2023-03-24 01:29:51] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 0 ms to minimize.
[2023-03-24 01:29:51] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 1 ms to minimize.
[2023-03-24 01:29:51] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 1 ms to minimize.
[2023-03-24 01:29:51] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2023-03-24 01:29:51] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 1 ms to minimize.
[2023-03-24 01:29:52] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 2 ms to minimize.
[2023-03-24 01:29:52] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 0 ms to minimize.
[2023-03-24 01:29:52] [INFO ] Deduced a trap composed of 180 places in 152 ms of which 1 ms to minimize.
[2023-03-24 01:29:52] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 0 ms to minimize.
[2023-03-24 01:29:52] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 0 ms to minimize.
[2023-03-24 01:29:53] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 1 ms to minimize.
[2023-03-24 01:29:53] [INFO ] Deduced a trap composed of 153 places in 150 ms of which 0 ms to minimize.
[2023-03-24 01:29:53] [INFO ] Deduced a trap composed of 156 places in 142 ms of which 0 ms to minimize.
[2023-03-24 01:29:53] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 1 ms to minimize.
[2023-03-24 01:29:54] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 0 ms to minimize.
[2023-03-24 01:29:54] [INFO ] Deduced a trap composed of 147 places in 155 ms of which 1 ms to minimize.
[2023-03-24 01:29:54] [INFO ] Deduced a trap composed of 171 places in 150 ms of which 1 ms to minimize.
[2023-03-24 01:29:55] [INFO ] Deduced a trap composed of 162 places in 152 ms of which 0 ms to minimize.
[2023-03-24 01:29:55] [INFO ] Deduced a trap composed of 180 places in 147 ms of which 0 ms to minimize.
[2023-03-24 01:29:55] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 1 ms to minimize.
[2023-03-24 01:29:55] [INFO ] Deduced a trap composed of 165 places in 142 ms of which 1 ms to minimize.
[2023-03-24 01:29:55] [INFO ] Deduced a trap composed of 177 places in 140 ms of which 1 ms to minimize.
[2023-03-24 01:29:56] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 0 ms to minimize.
[2023-03-24 01:29:56] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 1 ms to minimize.
[2023-03-24 01:29:56] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 1 ms to minimize.
[2023-03-24 01:29:56] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 1 ms to minimize.
[2023-03-24 01:29:57] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 0 ms to minimize.
[2023-03-24 01:29:57] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 0 ms to minimize.
[2023-03-24 01:29:57] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 0 ms to minimize.
[2023-03-24 01:29:57] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 1 ms to minimize.
[2023-03-24 01:29:58] [INFO ] Deduced a trap composed of 171 places in 152 ms of which 1 ms to minimize.
[2023-03-24 01:29:58] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 1 ms to minimize.
[2023-03-24 01:29:58] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 1 ms to minimize.
[2023-03-24 01:29:59] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 1 ms to minimize.
[2023-03-24 01:29:59] [INFO ] Deduced a trap composed of 159 places in 147 ms of which 1 ms to minimize.
[2023-03-24 01:30:00] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 1 ms to minimize.
[2023-03-24 01:30:00] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 1 ms to minimize.
[2023-03-24 01:30:00] [INFO ] Deduced a trap composed of 159 places in 153 ms of which 0 ms to minimize.
[2023-03-24 01:30:00] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 1 ms to minimize.
[2023-03-24 01:30:01] [INFO ] Deduced a trap composed of 159 places in 191 ms of which 1 ms to minimize.
[2023-03-24 01:30:01] [INFO ] Deduced a trap composed of 168 places in 140 ms of which 0 ms to minimize.
[2023-03-24 01:30:01] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 0 ms to minimize.
[2023-03-24 01:30:02] [INFO ] Deduced a trap composed of 159 places in 142 ms of which 0 ms to minimize.
[2023-03-24 01:30:02] [INFO ] Deduced a trap composed of 168 places in 140 ms of which 1 ms to minimize.
[2023-03-24 01:30:03] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 0 ms to minimize.
[2023-03-24 01:30:03] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 0 ms to minimize.
[2023-03-24 01:30:04] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 1 ms to minimize.
[2023-03-24 01:30:04] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 1 ms to minimize.
[2023-03-24 01:30:04] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 0 ms to minimize.
[2023-03-24 01:30:04] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 0 ms to minimize.
[2023-03-24 01:30:05] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 0 ms to minimize.
[2023-03-24 01:30:05] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 0 ms to minimize.
[2023-03-24 01:30:05] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 0 ms to minimize.
[2023-03-24 01:30:05] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 0 ms to minimize.
[2023-03-24 01:30:06] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 0 ms to minimize.
[2023-03-24 01:30:06] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 0 ms to minimize.
[2023-03-24 01:30:06] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 1 ms to minimize.
[2023-03-24 01:30:06] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 1 ms to minimize.
[2023-03-24 01:30:07] [INFO ] Deduced a trap composed of 171 places in 152 ms of which 1 ms to minimize.
[2023-03-24 01:30:07] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2023-03-24 01:30:07] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 0 ms to minimize.
[2023-03-24 01:30:08] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2023-03-24 01:30:08] [INFO ] Deduced a trap composed of 168 places in 159 ms of which 0 ms to minimize.
[2023-03-24 01:30:08] [INFO ] Deduced a trap composed of 174 places in 155 ms of which 1 ms to minimize.
[2023-03-24 01:30:08] [INFO ] Deduced a trap composed of 145 places in 152 ms of which 1 ms to minimize.
[2023-03-24 01:30:09] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 0 ms to minimize.
[2023-03-24 01:30:10] [INFO ] Deduced a trap composed of 177 places in 175 ms of which 3 ms to minimize.
[2023-03-24 01:30:10] [INFO ] Deduced a trap composed of 165 places in 190 ms of which 1 ms to minimize.
[2023-03-24 01:30:10] [INFO ] Deduced a trap composed of 159 places in 154 ms of which 0 ms to minimize.
[2023-03-24 01:30:10] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 1 ms to minimize.
[2023-03-24 01:30:11] [INFO ] Deduced a trap composed of 153 places in 158 ms of which 0 ms to minimize.
[2023-03-24 01:30:12] [INFO ] Deduced a trap composed of 174 places in 153 ms of which 1 ms to minimize.
[2023-03-24 01:30:14] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 0 ms to minimize.
[2023-03-24 01:30:14] [INFO ] Deduced a trap composed of 165 places in 166 ms of which 1 ms to minimize.
[2023-03-24 01:30:16] [INFO ] Deduced a trap composed of 171 places in 162 ms of which 1 ms to minimize.
[2023-03-24 01:30:25] [INFO ] Trap strengthening (SAT) tested/added 93/93 trap constraints in 38694 ms
[2023-03-24 01:30:25] [INFO ] After 39053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 01:30:25] [INFO ] After 39153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-COL-S05J40-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 01:30:26] [INFO ] Flatten gal took : 74 ms
[2023-03-24 01:30:26] [INFO ] Flatten gal took : 77 ms
[2023-03-24 01:30:26] [INFO ] Input system was already deterministic with 840 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 23 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 01:30:26] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 01:30:26] [INFO ] Computed 97 place invariants in 13 ms
[2023-03-24 01:30:27] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 01:30:27] [INFO ] Flatten gal took : 33 ms
[2023-03-24 01:30:27] [INFO ] Flatten gal took : 34 ms
[2023-03-24 01:30:27] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 18 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 01:30:27] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 01:30:27] [INFO ] Invariant cache hit.
[2023-03-24 01:30:28] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 01:30:28] [INFO ] Flatten gal took : 39 ms
[2023-03-24 01:30:28] [INFO ] Flatten gal took : 33 ms
[2023-03-24 01:30:28] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 23 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 01:30:28] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 01:30:28] [INFO ] Invariant cache hit.
[2023-03-24 01:30:28] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 01:30:28] [INFO ] Flatten gal took : 29 ms
[2023-03-24 01:30:28] [INFO ] Flatten gal took : 31 ms
[2023-03-24 01:30:28] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 750
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 531 transition count 747
Applied a total of 186 rules in 65 ms. Remains 531 /629 variables (removed 98) and now considering 747/840 (removed 93) transitions.
[2023-03-24 01:30:28] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2023-03-24 01:30:28] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 01:30:29] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 477 ms. Remains : 531/629 places, 747/840 transitions.
[2023-03-24 01:30:29] [INFO ] Flatten gal took : 26 ms
[2023-03-24 01:30:29] [INFO ] Flatten gal took : 28 ms
[2023-03-24 01:30:29] [INFO ] Input system was already deterministic with 747 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 15 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 01:30:29] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 01:30:29] [INFO ] Computed 97 place invariants in 22 ms
[2023-03-24 01:30:30] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 726 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 01:30:30] [INFO ] Flatten gal took : 26 ms
[2023-03-24 01:30:30] [INFO ] Flatten gal took : 29 ms
[2023-03-24 01:30:30] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 624 transition count 797
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 581 transition count 796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 580 transition count 796
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 88 place count 580 transition count 752
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 176 place count 536 transition count 752
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 534 transition count 750
Applied a total of 180 rules in 40 ms. Remains 534 /629 variables (removed 95) and now considering 750/840 (removed 90) transitions.
[2023-03-24 01:30:30] [INFO ] Flow matrix only has 746 transitions (discarded 4 similar events)
// Phase 1: matrix 746 rows 534 cols
[2023-03-24 01:30:30] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-24 01:30:30] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 492 ms. Remains : 534/629 places, 750/840 transitions.
[2023-03-24 01:30:30] [INFO ] Flatten gal took : 24 ms
[2023-03-24 01:30:30] [INFO ] Flatten gal took : 26 ms
[2023-03-24 01:30:30] [INFO ] Input system was already deterministic with 750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 17 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 01:30:30] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 01:30:30] [INFO ] Computed 97 place invariants in 12 ms
[2023-03-24 01:30:31] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 01:30:31] [INFO ] Flatten gal took : 26 ms
[2023-03-24 01:30:31] [INFO ] Flatten gal took : 28 ms
[2023-03-24 01:30:31] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 835
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 619 transition count 835
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 10 place count 619 transition count 791
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 98 place count 575 transition count 791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 574 transition count 790
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 574 transition count 790
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 572 transition count 788
Applied a total of 104 rules in 35 ms. Remains 572 /629 variables (removed 57) and now considering 788/840 (removed 52) transitions.
[2023-03-24 01:30:31] [INFO ] Flow matrix only has 784 transitions (discarded 4 similar events)
// Phase 1: matrix 784 rows 572 cols
[2023-03-24 01:30:31] [INFO ] Computed 97 place invariants in 18 ms
[2023-03-24 01:30:32] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 625 ms. Remains : 572/629 places, 788/840 transitions.
[2023-03-24 01:30:32] [INFO ] Flatten gal took : 25 ms
[2023-03-24 01:30:32] [INFO ] Flatten gal took : 27 ms
[2023-03-24 01:30:32] [INFO ] Input system was already deterministic with 788 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 15 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 01:30:32] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 01:30:32] [INFO ] Computed 97 place invariants in 13 ms
[2023-03-24 01:30:33] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 667 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 01:30:33] [INFO ] Flatten gal took : 25 ms
[2023-03-24 01:30:33] [INFO ] Flatten gal took : 28 ms
[2023-03-24 01:30:33] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 8 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
[2023-03-24 01:30:33] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 01:30:33] [INFO ] Invariant cache hit.
[2023-03-24 01:30:33] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 623/629 places, 839/840 transitions.
[2023-03-24 01:30:33] [INFO ] Flatten gal took : 29 ms
[2023-03-24 01:30:33] [INFO ] Flatten gal took : 34 ms
[2023-03-24 01:30:33] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 835
Reduce places removed 5 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 46 rules applied. Total rules applied 51 place count 619 transition count 794
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 92 place count 578 transition count 790
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 574 transition count 790
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 573 transition count 789
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 573 transition count 789
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 571 transition count 787
Applied a total of 106 rules in 43 ms. Remains 571 /629 variables (removed 58) and now considering 787/840 (removed 53) transitions.
[2023-03-24 01:30:34] [INFO ] Flow matrix only has 783 transitions (discarded 4 similar events)
// Phase 1: matrix 783 rows 571 cols
[2023-03-24 01:30:34] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-24 01:30:34] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 543 ms. Remains : 571/629 places, 787/840 transitions.
[2023-03-24 01:30:34] [INFO ] Flatten gal took : 25 ms
[2023-03-24 01:30:34] [INFO ] Flatten gal took : 27 ms
[2023-03-24 01:30:34] [INFO ] Input system was already deterministic with 787 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 628 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 628 transition count 839
Applied a total of 2 rules in 12 ms. Remains 628 /629 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 01:30:34] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 628 cols
[2023-03-24 01:30:34] [INFO ] Computed 102 place invariants in 18 ms
[2023-03-24 01:30:35] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 628/629 places, 839/840 transitions.
[2023-03-24 01:30:35] [INFO ] Flatten gal took : 27 ms
[2023-03-24 01:30:35] [INFO ] Flatten gal took : 29 ms
[2023-03-24 01:30:35] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Applied a total of 0 rules in 4 ms. Remains 629 /629 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2023-03-24 01:30:35] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 629 cols
[2023-03-24 01:30:35] [INFO ] Computed 102 place invariants in 19 ms
[2023-03-24 01:30:35] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 629/629 places, 840/840 transitions.
[2023-03-24 01:30:35] [INFO ] Flatten gal took : 30 ms
[2023-03-24 01:30:36] [INFO ] Flatten gal took : 32 ms
[2023-03-24 01:30:36] [INFO ] Input system was already deterministic with 840 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 750
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 45 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
[2023-03-24 01:30:36] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-24 01:30:36] [INFO ] Computed 97 place invariants in 13 ms
[2023-03-24 01:30:36] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 440 ms. Remains : 532/629 places, 748/840 transitions.
[2023-03-24 01:30:36] [INFO ] Flatten gal took : 24 ms
[2023-03-24 01:30:36] [INFO ] Flatten gal took : 25 ms
[2023-03-24 01:30:36] [INFO ] Input system was already deterministic with 748 transitions.
Finished random walk after 28 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
FORMULA PolyORBNT-COL-S05J40-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Applied a total of 5 rules in 7 ms. Remains 624 /629 variables (removed 5) and now considering 840/840 (removed 0) transitions.
[2023-03-24 01:30:36] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2023-03-24 01:30:36] [INFO ] Computed 97 place invariants in 11 ms
[2023-03-24 01:30:37] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 596 ms. Remains : 624/629 places, 840/840 transitions.
[2023-03-24 01:30:37] [INFO ] Flatten gal took : 26 ms
[2023-03-24 01:30:37] [INFO ] Flatten gal took : 29 ms
[2023-03-24 01:30:37] [INFO ] Input system was already deterministic with 840 transitions.
[2023-03-24 01:30:37] [INFO ] Flatten gal took : 56 ms
[2023-03-24 01:30:37] [INFO ] Flatten gal took : 57 ms
[2023-03-24 01:30:37] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 25 ms.
[2023-03-24 01:30:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 629 places, 840 transitions and 4204 arcs took 5 ms.
Total runtime 143471 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 629 NrTr: 840 NrArc: 4204)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.055sec
net check time: 0m 0.000sec
init dd package: 0m 2.774sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10147412 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16090996 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.002sec
4748444
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="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is PolyORBNT-COL-S05J40, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873952000650"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;