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.r170-tall-167838857500599.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 FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857500599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:33 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 3.9K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:22 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 FlexibleBarrier-PT-22b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678586617934

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 02:03:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 02:03:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 02:03:39] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-12 02:03:39] [INFO ] Transformed 6478 places.
[2023-03-12 02:03:39] [INFO ] Transformed 7469 transitions.
[2023-03-12 02:03:39] [INFO ] Found NUPN structural information;
[2023-03-12 02:03:39] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 68 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 16) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 1 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=200 ) 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 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 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 1 resets, run finished after 7 ms. (steps per millisecond=143 ) 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 2 resets, run finished after 3 ms. (steps per millisecond=333 ) 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 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 118743 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118743 steps, saw 73041 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 7469 rows 6478 cols
[2023-03-12 02:03:43] [INFO ] Computed 24 place invariants in 231 ms
[2023-03-12 02:03:46] [INFO ] [Real]Absence check using 24 positive place invariants in 55 ms returned sat
[2023-03-12 02:03:46] [INFO ] After 2659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 02:03:48] [INFO ] [Nat]Absence check using 24 positive place invariants in 54 ms returned sat
[2023-03-12 02:03:59] [INFO ] After 9454ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2023-03-12 02:04:05] [INFO ] Deduced a trap composed of 2428 places in 4973 ms of which 8 ms to minimize.
[2023-03-12 02:04:10] [INFO ] Deduced a trap composed of 2369 places in 4821 ms of which 5 ms to minimize.
[2023-03-12 02:04:15] [INFO ] Deduced a trap composed of 2304 places in 4530 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 02:04:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 02:04:15] [INFO ] After 28749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 13 different solutions.
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 275 ms.
Support contains 90 out of 6478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 4997 edges and 6478 vertex of which 74 / 6478 are part of one of the 12 SCC in 15 ms
Free SCC test removed 62 places
Drop transitions removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 1089 transitions
Trivial Post-agglo rules discarded 1089 transitions
Performed 1089 trivial Post agglomeration. Transition count delta: 1089
Iterating post reduction 0 with 1089 rules applied. Total rules applied 1090 place count 6416 transition count 6305
Reduce places removed 1089 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 1104 rules applied. Total rules applied 2194 place count 5327 transition count 6290
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 2209 place count 5312 transition count 6290
Performed 888 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 888 Pre rules applied. Total rules applied 2209 place count 5312 transition count 5402
Deduced a syphon composed of 888 places in 7 ms
Reduce places removed 888 places and 0 transitions.
Iterating global reduction 3 with 1776 rules applied. Total rules applied 3985 place count 4424 transition count 5402
Discarding 2640 places :
Symmetric choice reduction at 3 with 2640 rule applications. Total rules 6625 place count 1784 transition count 2762
Iterating global reduction 3 with 2640 rules applied. Total rules applied 9265 place count 1784 transition count 2762
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 9265 place count 1784 transition count 2746
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 9297 place count 1768 transition count 2746
Discarding 407 places :
Symmetric choice reduction at 3 with 407 rule applications. Total rules 9704 place count 1361 transition count 2339
Iterating global reduction 3 with 407 rules applied. Total rules applied 10111 place count 1361 transition count 2339
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 393 transitions.
Iterating post reduction 3 with 393 rules applied. Total rules applied 10504 place count 1361 transition count 1946
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 4 with 282 rules applied. Total rules applied 10786 place count 1220 transition count 1805
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 10806 place count 1210 transition count 1805
Free-agglomeration rule applied 290 times.
Iterating global reduction 4 with 290 rules applied. Total rules applied 11096 place count 1210 transition count 1515
Reduce places removed 290 places and 0 transitions.
Iterating post reduction 4 with 290 rules applied. Total rules applied 11386 place count 920 transition count 1515
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 11399 place count 907 transition count 1502
Iterating global reduction 5 with 13 rules applied. Total rules applied 11412 place count 907 transition count 1502
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 11425 place count 907 transition count 1489
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 11442 place count 907 transition count 1472
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 11452 place count 907 transition count 1472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 11453 place count 906 transition count 1471
Applied a total of 11453 rules in 1605 ms. Remains 906 /6478 variables (removed 5572) and now considering 1471/7469 (removed 5998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1607 ms. Remains : 906/6478 places, 1471/7469 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 02:04:17] [INFO ] Flow matrix only has 1442 transitions (discarded 29 similar events)
// Phase 1: matrix 1442 rows 906 cols
[2023-03-12 02:04:17] [INFO ] Computed 24 place invariants in 31 ms
[2023-03-12 02:04:18] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 02:04:18] [INFO ] [Nat]Absence check using 24 positive place invariants in 11 ms returned sat
[2023-03-12 02:04:19] [INFO ] After 797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 02:04:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 02:04:19] [INFO ] After 472ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 02:04:20] [INFO ] Deduced a trap composed of 476 places in 274 ms of which 0 ms to minimize.
[2023-03-12 02:04:20] [INFO ] Deduced a trap composed of 455 places in 285 ms of which 1 ms to minimize.
[2023-03-12 02:04:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 684 ms
[2023-03-12 02:04:21] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2023-03-12 02:04:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-12 02:04:21] [INFO ] After 1922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 449 ms.
[2023-03-12 02:04:21] [INFO ] After 3493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 98 ms.
Support contains 53 out of 906 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 906/906 places, 1471/1471 transitions.
Graph (trivial) has 140 edges and 906 vertex of which 8 / 906 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 902 transition count 1455
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 894 transition count 1455
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 17 place count 894 transition count 1452
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 891 transition count 1452
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 33 place count 881 transition count 1442
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 881 transition count 1442
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 881 transition count 1441
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 880 transition count 1440
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 880 transition count 1440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 880 transition count 1439
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 77 place count 865 transition count 1424
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 81 place count 865 transition count 1420
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 86 place count 860 transition count 1415
Iterating global reduction 5 with 5 rules applied. Total rules applied 91 place count 860 transition count 1415
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 96 place count 860 transition count 1410
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 100 place count 860 transition count 1406
Free-agglomeration rule applied 98 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 198 place count 860 transition count 1306
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 99 rules applied. Total rules applied 297 place count 762 transition count 1305
Discarding 58 places :
Symmetric choice reduction at 7 with 58 rule applications. Total rules 355 place count 704 transition count 1247
Iterating global reduction 7 with 58 rules applied. Total rules applied 413 place count 704 transition count 1247
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 7 with 58 rules applied. Total rules applied 471 place count 704 transition count 1189
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 473 place count 704 transition count 1187
Applied a total of 473 rules in 450 ms. Remains 704 /906 variables (removed 202) and now considering 1187/1471 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 704/906 places, 1187/1471 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 02:04:22] [INFO ] Flow matrix only has 1153 transitions (discarded 34 similar events)
// Phase 1: matrix 1153 rows 704 cols
[2023-03-12 02:04:22] [INFO ] Computed 24 place invariants in 24 ms
[2023-03-12 02:04:22] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 02:04:22] [INFO ] [Nat]Absence check using 24 positive place invariants in 10 ms returned sat
[2023-03-12 02:04:23] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 02:04:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 02:04:23] [INFO ] After 325ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 02:04:24] [INFO ] Deduced a trap composed of 384 places in 202 ms of which 1 ms to minimize.
[2023-03-12 02:04:24] [INFO ] Deduced a trap composed of 408 places in 195 ms of which 1 ms to minimize.
[2023-03-12 02:04:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2023-03-12 02:04:24] [INFO ] After 1259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-12 02:04:25] [INFO ] After 2370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 13 ms.
Support contains 47 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 1187/1187 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 704 transition count 1184
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 701 transition count 1183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 700 transition count 1183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 700 transition count 1182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 699 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 698 transition count 1181
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 698 transition count 1181
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 20 place count 694 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 23 place count 694 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 24 place count 693 transition count 1173
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 693 transition count 1173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 26 place count 693 transition count 1172
Applied a total of 26 rules in 76 ms. Remains 693 /704 variables (removed 11) and now considering 1172/1187 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 693/704 places, 1172/1187 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 301538 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301538 steps, saw 87940 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 02:04:28] [INFO ] Flow matrix only has 1138 transitions (discarded 34 similar events)
// Phase 1: matrix 1138 rows 693 cols
[2023-03-12 02:04:28] [INFO ] Computed 24 place invariants in 31 ms
[2023-03-12 02:04:28] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 02:04:28] [INFO ] [Nat]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-12 02:04:29] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 02:04:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 02:04:29] [INFO ] After 307ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 02:04:30] [INFO ] Deduced a trap composed of 383 places in 184 ms of which 1 ms to minimize.
[2023-03-12 02:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-12 02:04:30] [INFO ] Deduced a trap composed of 384 places in 200 ms of which 0 ms to minimize.
[2023-03-12 02:04:30] [INFO ] Deduced a trap composed of 380 places in 194 ms of which 1 ms to minimize.
[2023-03-12 02:04:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2023-03-12 02:04:30] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2023-03-12 02:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-12 02:04:30] [INFO ] After 1517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 327 ms.
[2023-03-12 02:04:31] [INFO ] After 2596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 23 ms.
Support contains 47 out of 693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 693/693 places, 1172/1172 transitions.
Applied a total of 0 rules in 20 ms. Remains 693 /693 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 693/693 places, 1172/1172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 693/693 places, 1172/1172 transitions.
Applied a total of 0 rules in 18 ms. Remains 693 /693 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
[2023-03-12 02:04:31] [INFO ] Flow matrix only has 1138 transitions (discarded 34 similar events)
[2023-03-12 02:04:31] [INFO ] Invariant cache hit.
[2023-03-12 02:04:31] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-12 02:04:31] [INFO ] Flow matrix only has 1138 transitions (discarded 34 similar events)
[2023-03-12 02:04:31] [INFO ] Invariant cache hit.
[2023-03-12 02:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 02:04:32] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2023-03-12 02:04:32] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-12 02:04:32] [INFO ] Flow matrix only has 1138 transitions (discarded 34 similar events)
[2023-03-12 02:04:32] [INFO ] Invariant cache hit.
[2023-03-12 02:04:32] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1564 ms. Remains : 693/693 places, 1172/1172 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 693 transition count 1023
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 1 with 230 rules applied. Total rules applied 379 place count 578 transition count 908
Discarding 126 places :
Symmetric choice reduction at 2 with 126 rule applications. Total rules 505 place count 452 transition count 782
Iterating global reduction 2 with 126 rules applied. Total rules applied 631 place count 452 transition count 782
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Iterating post reduction 2 with 106 rules applied. Total rules applied 737 place count 452 transition count 676
Applied a total of 737 rules in 27 ms. Remains 452 /693 variables (removed 241) and now considering 676/1172 (removed 496) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 676 rows 452 cols
[2023-03-12 02:04:32] [INFO ] Computed 24 place invariants in 9 ms
[2023-03-12 02:04:33] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 02:04:33] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2023-03-12 02:04:33] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 02:04:33] [INFO ] Deduced a trap composed of 184 places in 118 ms of which 0 ms to minimize.
[2023-03-12 02:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-12 02:04:33] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-12 02:04:34] [INFO ] After 1082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-12 02:04:34] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-12 02:04:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 693 places, 1172 transitions and 4316 arcs took 6 ms.
[2023-03-12 02:04:34] [INFO ] Flatten gal took : 99 ms
Total runtime 55031 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FlexibleBarrier_PT_22b
(NrP: 693 NrTr: 1172 NrArc: 4316)

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

net check time: 0m 0.000sec

init dd package: 0m 2.777sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7445016 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16101736 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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.011sec

2797 2520 2866 3439 3532 3394 4715 4493 5096 4891 6800 5519 6968 6379 6844 7271 8056 8822 8724 8645 8525 8480 7815 7174 7288 6415 10789 9389 9539 10495 10384 10387 10282 10900 11622 12871 12959 11544 12361 12726 13115 12617 13815 12841 13541 14359 12910 11278 13826 14034 15099 15417 15133 14872 15474 16834 15391 12913 12531 12413 14928 14841 15685 15455 15492 15301 14502 14083 14201 14788 13567 17656 55521 56423 57391 55859 58239 58099 56633 57845 55238 58207 57065 59950 58626 62626 62462 62356 59158 160825 170161

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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="ReachabilityFireability"
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 FlexibleBarrier-PT-22b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857500599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;