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.r394-oct2-167903718200703.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldPPPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718200703
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 ShieldPPPt-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679533704381

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=ShieldPPPt-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 01:08:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 01:08:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 01:08:28] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2023-03-23 01:08:29] [INFO ] Transformed 7803 places.
[2023-03-23 01:08:29] [INFO ] Transformed 7103 transitions.
[2023-03-23 01:08:29] [INFO ] Found NUPN structural information;
[2023-03-23 01:08:29] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 943 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 2 resets, run finished after 742 ms. (steps per millisecond=13 ) properties (out of 16) seen :2
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-23 01:08:31] [INFO ] Computed 1101 place invariants in 105 ms
[2023-03-23 01:08:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 1496 ms returned sat
[2023-03-23 01:08:37] [INFO ] After 5622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 01:08:42] [INFO ] [Nat]Absence check using 1101 positive place invariants in 2159 ms returned sat
[2023-03-23 01:09:02] [INFO ] After 17554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-23 01:09:02] [INFO ] After 17565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 01:09:02] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1784 transitions
Trivial Post-agglo rules discarded 1784 transitions
Performed 1784 trivial Post agglomeration. Transition count delta: 1784
Iterating post reduction 0 with 1784 rules applied. Total rules applied 1784 place count 7803 transition count 5319
Reduce places removed 1784 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1786 rules applied. Total rules applied 3570 place count 6019 transition count 5317
Reduce places removed 1 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 43 rules applied. Total rules applied 3613 place count 6018 transition count 5275
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 3655 place count 5976 transition count 5275
Performed 409 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 409 Pre rules applied. Total rules applied 3655 place count 5976 transition count 4866
Deduced a syphon composed of 409 places in 25 ms
Reduce places removed 409 places and 0 transitions.
Iterating global reduction 4 with 818 rules applied. Total rules applied 4473 place count 5567 transition count 4866
Discarding 666 places :
Symmetric choice reduction at 4 with 666 rule applications. Total rules 5139 place count 4901 transition count 4200
Iterating global reduction 4 with 666 rules applied. Total rules applied 5805 place count 4901 transition count 4200
Performed 261 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 261 Pre rules applied. Total rules applied 5805 place count 4901 transition count 3939
Deduced a syphon composed of 261 places in 21 ms
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 4 with 522 rules applied. Total rules applied 6327 place count 4640 transition count 3939
Performed 1648 Post agglomeration using F-continuation condition.Transition count delta: 1648
Deduced a syphon composed of 1648 places in 32 ms
Reduce places removed 1648 places and 0 transitions.
Iterating global reduction 4 with 3296 rules applied. Total rules applied 9623 place count 2992 transition count 2291
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 38 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9825 place count 2891 transition count 2291
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10027 place count 2790 transition count 2291
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 11 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 10151 place count 2728 transition count 2291
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 10162 place count 2728 transition count 2280
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 10173 place count 2717 transition count 2280
Partial Free-agglomeration rule applied 284 times.
Drop transitions removed 284 transitions
Iterating global reduction 5 with 284 rules applied. Total rules applied 10457 place count 2717 transition count 2280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10458 place count 2716 transition count 2279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10459 place count 2715 transition count 2279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10459 place count 2715 transition count 2277
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10463 place count 2713 transition count 2277
Applied a total of 10463 rules in 3967 ms. Remains 2713 /7803 variables (removed 5090) and now considering 2277/7103 (removed 4826) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3969 ms. Remains : 2713/7803 places, 2277/7103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 69872 steps, run timeout after 9003 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 69872 steps, saw 53973 distinct states, run finished after 9007 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 2277 rows 2713 cols
[2023-03-23 01:09:18] [INFO ] Computed 1100 place invariants in 20 ms
[2023-03-23 01:09:20] [INFO ] [Real]Absence check using 1100 positive place invariants in 546 ms returned sat
[2023-03-23 01:09:20] [INFO ] After 1741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 01:09:22] [INFO ] [Nat]Absence check using 1100 positive place invariants in 297 ms returned sat
[2023-03-23 01:09:27] [INFO ] After 3939ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-23 01:09:27] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-23 01:09:31] [INFO ] After 3938ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-23 01:09:31] [INFO ] Deduced a trap composed of 3 places in 520 ms of which 7 ms to minimize.
[2023-03-23 01:09:33] [INFO ] Deduced a trap composed of 4 places in 1062 ms of which 3 ms to minimize.
[2023-03-23 01:09:33] [INFO ] Deduced a trap composed of 10 places in 748 ms of which 3 ms to minimize.
[2023-03-23 01:09:34] [INFO ] Deduced a trap composed of 5 places in 480 ms of which 15 ms to minimize.
[2023-03-23 01:09:35] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 14 ms to minimize.
[2023-03-23 01:09:35] [INFO ] Deduced a trap composed of 3 places in 495 ms of which 1 ms to minimize.
[2023-03-23 01:09:36] [INFO ] Deduced a trap composed of 5 places in 501 ms of which 0 ms to minimize.
[2023-03-23 01:09:37] [INFO ] Deduced a trap composed of 7 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:09:37] [INFO ] Deduced a trap composed of 5 places in 460 ms of which 1 ms to minimize.
[2023-03-23 01:09:38] [INFO ] Deduced a trap composed of 9 places in 472 ms of which 1 ms to minimize.
[2023-03-23 01:09:39] [INFO ] Deduced a trap composed of 5 places in 569 ms of which 15 ms to minimize.
[2023-03-23 01:09:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7978 ms
[2023-03-23 01:09:40] [INFO ] Deduced a trap composed of 8 places in 403 ms of which 1 ms to minimize.
[2023-03-23 01:09:40] [INFO ] Deduced a trap composed of 6 places in 583 ms of which 1 ms to minimize.
[2023-03-23 01:09:41] [INFO ] Deduced a trap composed of 6 places in 755 ms of which 1 ms to minimize.
[2023-03-23 01:09:42] [INFO ] Deduced a trap composed of 44 places in 475 ms of which 1 ms to minimize.
[2023-03-23 01:09:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2916 ms
[2023-03-23 01:09:43] [INFO ] Deduced a trap composed of 9 places in 434 ms of which 1 ms to minimize.
[2023-03-23 01:09:43] [INFO ] Deduced a trap composed of 8 places in 450 ms of which 1 ms to minimize.
[2023-03-23 01:09:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1587 ms
[2023-03-23 01:09:45] [INFO ] Deduced a trap composed of 5 places in 588 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 01:09:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 01:09:45] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Parikh walk visited 0 properties in 1939 ms.
Support contains 169 out of 2713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2713/2713 places, 2277/2277 transitions.
Applied a total of 0 rules in 124 ms. Remains 2713 /2713 variables (removed 0) and now considering 2277/2277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 2713/2713 places, 2277/2277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2713/2713 places, 2277/2277 transitions.
Applied a total of 0 rules in 123 ms. Remains 2713 /2713 variables (removed 0) and now considering 2277/2277 (removed 0) transitions.
[2023-03-23 01:09:47] [INFO ] Invariant cache hit.
[2023-03-23 01:09:50] [INFO ] Implicit Places using invariants in 2725 ms returned [2695, 2699]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2731 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2711/2713 places, 2277/2277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2709 transition count 2275
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2709 transition count 2275
Applied a total of 4 rules in 276 ms. Remains 2709 /2711 variables (removed 2) and now considering 2275/2277 (removed 2) transitions.
// Phase 1: matrix 2275 rows 2709 cols
[2023-03-23 01:09:50] [INFO ] Computed 1098 place invariants in 17 ms
[2023-03-23 01:09:53] [INFO ] Implicit Places using invariants in 2748 ms returned []
[2023-03-23 01:09:53] [INFO ] Invariant cache hit.
[2023-03-23 01:09:55] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-23 01:10:05] [INFO ] Implicit Places using invariants and state equation in 11829 ms returned []
Implicit Place search using SMT with State Equation took 14583 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2709/2713 places, 2275/2277 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17714 ms. Remains : 2709/2713 places, 2275/2277 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 83100 steps, run timeout after 6001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 83100 steps, saw 62532 distinct states, run finished after 6001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-23 01:10:14] [INFO ] Invariant cache hit.
[2023-03-23 01:10:16] [INFO ] [Real]Absence check using 1098 positive place invariants in 362 ms returned sat
[2023-03-23 01:10:16] [INFO ] After 1831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 01:10:17] [INFO ] [Nat]Absence check using 1098 positive place invariants in 311 ms returned sat
[2023-03-23 01:10:23] [INFO ] After 4353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-23 01:10:23] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-23 01:10:26] [INFO ] After 3371ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-23 01:10:27] [INFO ] Deduced a trap composed of 3 places in 415 ms of which 15 ms to minimize.
[2023-03-23 01:10:27] [INFO ] Deduced a trap composed of 3 places in 547 ms of which 1 ms to minimize.
[2023-03-23 01:10:28] [INFO ] Deduced a trap composed of 7 places in 412 ms of which 1 ms to minimize.
[2023-03-23 01:10:28] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 1 ms to minimize.
[2023-03-23 01:10:29] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2023-03-23 01:10:30] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 1 ms to minimize.
[2023-03-23 01:10:30] [INFO ] Deduced a trap composed of 5 places in 489 ms of which 2 ms to minimize.
[2023-03-23 01:10:31] [INFO ] Deduced a trap composed of 8 places in 520 ms of which 1 ms to minimize.
[2023-03-23 01:10:31] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 1 ms to minimize.
[2023-03-23 01:10:32] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
[2023-03-23 01:10:33] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 1 ms to minimize.
[2023-03-23 01:10:33] [INFO ] Deduced a trap composed of 8 places in 461 ms of which 1 ms to minimize.
[2023-03-23 01:10:34] [INFO ] Deduced a trap composed of 6 places in 405 ms of which 1 ms to minimize.
[2023-03-23 01:10:34] [INFO ] Deduced a trap composed of 11 places in 384 ms of which 1 ms to minimize.
[2023-03-23 01:10:35] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 1 ms to minimize.
[2023-03-23 01:10:35] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 1 ms to minimize.
[2023-03-23 01:10:36] [INFO ] Deduced a trap composed of 6 places in 388 ms of which 0 ms to minimize.
[2023-03-23 01:10:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 9511 ms
[2023-03-23 01:10:37] [INFO ] Deduced a trap composed of 6 places in 511 ms of which 1 ms to minimize.
[2023-03-23 01:10:37] [INFO ] Deduced a trap composed of 9 places in 504 ms of which 1 ms to minimize.
[2023-03-23 01:10:38] [INFO ] Deduced a trap composed of 9 places in 450 ms of which 2 ms to minimize.
[2023-03-23 01:10:39] [INFO ] Deduced a trap composed of 8 places in 473 ms of which 1 ms to minimize.
[2023-03-23 01:10:39] [INFO ] Deduced a trap composed of 7 places in 442 ms of which 1 ms to minimize.
[2023-03-23 01:10:40] [INFO ] Deduced a trap composed of 9 places in 692 ms of which 2 ms to minimize.
[2023-03-23 01:10:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4096 ms
[2023-03-23 01:10:43] [INFO ] Deduced a trap composed of 2 places in 2715 ms of which 3 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-23 01:10:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 01:10:43] [INFO ] After 27755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Parikh walk visited 0 properties in 1520 ms.
Support contains 169 out of 2709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 2275/2275 transitions.
Applied a total of 0 rules in 136 ms. Remains 2709 /2709 variables (removed 0) and now considering 2275/2275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 2709/2709 places, 2275/2275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 2275/2275 transitions.
Applied a total of 0 rules in 133 ms. Remains 2709 /2709 variables (removed 0) and now considering 2275/2275 (removed 0) transitions.
[2023-03-23 01:10:45] [INFO ] Invariant cache hit.
[2023-03-23 01:10:48] [INFO ] Implicit Places using invariants in 3136 ms returned []
[2023-03-23 01:10:48] [INFO ] Invariant cache hit.
[2023-03-23 01:10:50] [INFO ] Implicit Places using invariants and state equation in 1817 ms returned []
Implicit Place search using SMT with State Equation took 4957 ms to find 0 implicit places.
[2023-03-23 01:10:50] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-23 01:10:50] [INFO ] Invariant cache hit.
[2023-03-23 01:10:53] [INFO ] Dead Transitions using invariants and state equation in 2757 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8005 ms. Remains : 2709/2709 places, 2275/2275 transitions.
Partial Free-agglomeration rule applied 536 times.
Drop transitions removed 536 transitions
Iterating global reduction 0 with 536 rules applied. Total rules applied 536 place count 2709 transition count 2275
Applied a total of 536 rules in 264 ms. Remains 2709 /2709 variables (removed 0) and now considering 2275/2275 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 2275 rows 2709 cols
[2023-03-23 01:10:53] [INFO ] Computed 1098 place invariants in 17 ms
[2023-03-23 01:10:55] [INFO ] [Real]Absence check using 1098 positive place invariants in 311 ms returned sat
[2023-03-23 01:10:55] [INFO ] After 1607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-23 01:10:57] [INFO ] [Nat]Absence check using 1098 positive place invariants in 301 ms returned sat
[2023-03-23 01:11:01] [INFO ] After 3476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-23 01:11:01] [INFO ] State equation strengthened by 494 read => feed constraints.
[2023-03-23 01:11:11] [INFO ] After 10442ms SMT Verify possible using 494 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-23 01:11:13] [INFO ] Deduced a trap composed of 7 places in 899 ms of which 17 ms to minimize.
[2023-03-23 01:11:14] [INFO ] Deduced a trap composed of 7 places in 863 ms of which 1 ms to minimize.
[2023-03-23 01:11:17] [INFO ] Deduced a trap composed of 6 places in 2606 ms of which 1 ms to minimize.
[2023-03-23 01:11:18] [INFO ] Deduced a trap composed of 7 places in 729 ms of which 2 ms to minimize.
[2023-03-23 01:11:19] [INFO ] Deduced a trap composed of 8 places in 1163 ms of which 2 ms to minimize.
[2023-03-23 01:11:21] [INFO ] Deduced a trap composed of 7 places in 1537 ms of which 3 ms to minimize.
[2023-03-23 01:11:22] [INFO ] Deduced a trap composed of 8 places in 916 ms of which 3 ms to minimize.
[2023-03-23 01:11:23] [INFO ] Deduced a trap composed of 8 places in 799 ms of which 2 ms to minimize.
[2023-03-23 01:11:24] [INFO ] Deduced a trap composed of 7 places in 962 ms of which 13 ms to minimize.
[2023-03-23 01:11:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 12015 ms
[2023-03-23 01:11:25] [INFO ] Deduced a trap composed of 8 places in 854 ms of which 3 ms to minimize.
[2023-03-23 01:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1145 ms
[2023-03-23 01:11:27] [INFO ] Deduced a trap composed of 5 places in 1341 ms of which 2 ms to minimize.
[2023-03-23 01:11:28] [INFO ] Deduced a trap composed of 8 places in 722 ms of which 2 ms to minimize.
[2023-03-23 01:11:29] [INFO ] Deduced a trap composed of 6 places in 741 ms of which 2 ms to minimize.
[2023-03-23 01:11:30] [INFO ] Deduced a trap composed of 8 places in 843 ms of which 14 ms to minimize.
[2023-03-23 01:11:31] [INFO ] Deduced a trap composed of 21 places in 1091 ms of which 1 ms to minimize.
[2023-03-23 01:11:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5807 ms
[2023-03-23 01:11:33] [INFO ] Deduced a trap composed of 6 places in 998 ms of which 1 ms to minimize.
[2023-03-23 01:11:34] [INFO ] Deduced a trap composed of 5 places in 736 ms of which 2 ms to minimize.
[2023-03-23 01:11:35] [INFO ] Deduced a trap composed of 5 places in 1109 ms of which 2 ms to minimize.
[2023-03-23 01:11:36] [INFO ] Deduced a trap composed of 8 places in 1064 ms of which 2 ms to minimize.
[2023-03-23 01:11:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4670 ms
[2023-03-23 01:11:38] [INFO ] Deduced a trap composed of 4 places in 920 ms of which 2 ms to minimize.
[2023-03-23 01:11:38] [INFO ] Deduced a trap composed of 7 places in 664 ms of which 1 ms to minimize.
[2023-03-23 01:11:40] [INFO ] Deduced a trap composed of 5 places in 974 ms of which 16 ms to minimize.
[2023-03-23 01:11:40] [INFO ] Deduced a trap composed of 7 places in 745 ms of which 1 ms to minimize.
[2023-03-23 01:11:41] [INFO ] Deduced a trap composed of 12 places in 694 ms of which 2 ms to minimize.
[2023-03-23 01:11:42] [INFO ] Deduced a trap composed of 9 places in 693 ms of which 2 ms to minimize.
[2023-03-23 01:11:43] [INFO ] Deduced a trap composed of 7 places in 831 ms of which 1 ms to minimize.
[2023-03-23 01:11:44] [INFO ] Deduced a trap composed of 10 places in 790 ms of which 3 ms to minimize.
[2023-03-23 01:11:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7855 ms
[2023-03-23 01:11:46] [INFO ] Deduced a trap composed of 5 places in 835 ms of which 1 ms to minimize.
[2023-03-23 01:11:47] [INFO ] Deduced a trap composed of 5 places in 679 ms of which 1 ms to minimize.
[2023-03-23 01:11:48] [INFO ] Deduced a trap composed of 7 places in 599 ms of which 1 ms to minimize.
[2023-03-23 01:11:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2740 ms
[2023-03-23 01:11:49] [INFO ] Deduced a trap composed of 7 places in 673 ms of which 2 ms to minimize.
[2023-03-23 01:11:50] [INFO ] Deduced a trap composed of 14 places in 701 ms of which 2 ms to minimize.
[2023-03-23 01:11:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1873 ms
[2023-03-23 01:11:52] [INFO ] Deduced a trap composed of 5 places in 686 ms of which 2 ms to minimize.
[2023-03-23 01:11:53] [INFO ] Deduced a trap composed of 6 places in 769 ms of which 1 ms to minimize.
[2023-03-23 01:11:53] [INFO ] Deduced a trap composed of 6 places in 712 ms of which 2 ms to minimize.
[2023-03-23 01:11:54] [INFO ] Deduced a trap composed of 10 places in 801 ms of which 2 ms to minimize.
[2023-03-23 01:11:55] [INFO ] Deduced a trap composed of 7 places in 733 ms of which 1 ms to minimize.
[2023-03-23 01:11:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4672 ms
[2023-03-23 01:12:04] [INFO ] Deduced a trap composed of 7 places in 775 ms of which 2 ms to minimize.
[2023-03-23 01:12:05] [INFO ] Deduced a trap composed of 9 places in 977 ms of which 1 ms to minimize.
[2023-03-23 01:12:06] [INFO ] Deduced a trap composed of 7 places in 729 ms of which 2 ms to minimize.
[2023-03-23 01:12:07] [INFO ] Deduced a trap composed of 7 places in 1062 ms of which 2 ms to minimize.
[2023-03-23 01:12:08] [INFO ] Deduced a trap composed of 8 places in 854 ms of which 2 ms to minimize.
[2023-03-23 01:12:09] [INFO ] Deduced a trap composed of 8 places in 759 ms of which 2 ms to minimize.
[2023-03-23 01:12:10] [INFO ] Deduced a trap composed of 8 places in 1199 ms of which 3 ms to minimize.
[2023-03-23 01:12:12] [INFO ] Deduced a trap composed of 8 places in 1360 ms of which 2 ms to minimize.
[2023-03-23 01:12:13] [INFO ] Deduced a trap composed of 12 places in 981 ms of which 2 ms to minimize.
[2023-03-23 01:12:14] [INFO ] Deduced a trap composed of 16 places in 1108 ms of which 2 ms to minimize.
[2023-03-23 01:12:16] [INFO ] Deduced a trap composed of 9 places in 1262 ms of which 2 ms to minimize.
[2023-03-23 01:12:17] [INFO ] Deduced a trap composed of 8 places in 1122 ms of which 2 ms to minimize.
[2023-03-23 01:12:19] [INFO ] Deduced a trap composed of 8 places in 1210 ms of which 1 ms to minimize.
[2023-03-23 01:12:20] [INFO ] Deduced a trap composed of 11 places in 1047 ms of which 1 ms to minimize.
[2023-03-23 01:12:21] [INFO ] Deduced a trap composed of 10 places in 1058 ms of which 3 ms to minimize.
[2023-03-23 01:12:22] [INFO ] Deduced a trap composed of 9 places in 1008 ms of which 1 ms to minimize.
[2023-03-23 01:12:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 19904 ms
[2023-03-23 01:12:24] [INFO ] Deduced a trap composed of 6 places in 598 ms of which 1 ms to minimize.
[2023-03-23 01:12:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 884 ms
[2023-03-23 01:12:24] [INFO ] After 82788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 8241 ms.
[2023-03-23 01:12:32] [INFO ] After 97017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
[2023-03-23 01:12:32] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 39 ms.
[2023-03-23 01:12:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2709 places, 2275 transitions and 9784 arcs took 14 ms.
[2023-03-23 01:12:33] [INFO ] Flatten gal took : 281 ms
Total runtime 244977 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: ShieldPPPt_PT_100B
(NrP: 2709 NrTr: 2275 NrArc: 9784)

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

net check time: 0m 0.003sec

init dd package: 0m 3.122sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8908220 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16092884 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.022sec

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="ShieldPPPt-PT-100B"
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 ShieldPPPt-PT-100B, 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 r394-oct2-167903718200703"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B 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 ;