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.r010-oct2-167813598600142.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 ASLink-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598600142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 839K 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 ASLink-PT-09a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678670821675

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 01:27:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 01:27:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 01:27:04] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2023-03-13 01:27:04] [INFO ] Transformed 1991 places.
[2023-03-13 01:27:04] [INFO ] Transformed 2919 transitions.
[2023-03-13 01:27:04] [INFO ] Found NUPN structural information;
[2023-03-13 01:27:04] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
FORMULA ASLink-PT-09a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 47 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 13) seen :7
FORMULA ASLink-PT-09a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2888 rows 1991 cols
[2023-03-13 01:27:06] [INFO ] Computed 384 place invariants in 186 ms
[2023-03-13 01:27:07] [INFO ] [Real]Absence check using 93 positive place invariants in 28 ms returned sat
[2023-03-13 01:27:07] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 166 ms returned sat
[2023-03-13 01:27:07] [INFO ] After 1102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 01:27:08] [INFO ] [Nat]Absence check using 93 positive place invariants in 27 ms returned sat
[2023-03-13 01:27:08] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 242 ms returned sat
[2023-03-13 01:27:32] [INFO ] After 23854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 01:27:32] [INFO ] After 23860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 01:27:32] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 176 ms.
Support contains 99 out of 1991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1938 transition count 2740
Reduce places removed 148 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 159 rules applied. Total rules applied 360 place count 1790 transition count 2729
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 371 place count 1779 transition count 2729
Performed 167 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 167 Pre rules applied. Total rules applied 371 place count 1779 transition count 2562
Deduced a syphon composed of 167 places in 6 ms
Ensure Unique test removed 57 places
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 391 rules applied. Total rules applied 762 place count 1555 transition count 2562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 763 place count 1555 transition count 2561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 764 place count 1554 transition count 2561
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 776 place count 1542 transition count 2496
Ensure Unique test removed 1 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 789 place count 1541 transition count 2496
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 792 place count 1541 transition count 2493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 793 place count 1540 transition count 2493
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 793 place count 1540 transition count 2491
Deduced a syphon composed of 2 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 798 place count 1537 transition count 2491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 799 place count 1536 transition count 2483
Iterating global reduction 7 with 1 rules applied. Total rules applied 800 place count 1536 transition count 2483
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 801 place count 1535 transition count 2475
Iterating global reduction 7 with 1 rules applied. Total rules applied 802 place count 1535 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 803 place count 1534 transition count 2467
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 1534 transition count 2467
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 1533 transition count 2459
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 1533 transition count 2459
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 1532 transition count 2451
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 1532 transition count 2451
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 809 place count 1531 transition count 2443
Iterating global reduction 7 with 1 rules applied. Total rules applied 810 place count 1531 transition count 2443
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 811 place count 1530 transition count 2435
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 1530 transition count 2435
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 813 place count 1529 transition count 2427
Iterating global reduction 7 with 1 rules applied. Total rules applied 814 place count 1529 transition count 2427
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 815 place count 1528 transition count 2419
Iterating global reduction 7 with 1 rules applied. Total rules applied 816 place count 1528 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 817 place count 1527 transition count 2411
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 1527 transition count 2411
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 819 place count 1526 transition count 2403
Iterating global reduction 7 with 1 rules applied. Total rules applied 820 place count 1526 transition count 2403
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 821 place count 1525 transition count 2395
Iterating global reduction 7 with 1 rules applied. Total rules applied 822 place count 1525 transition count 2395
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 823 place count 1524 transition count 2387
Iterating global reduction 7 with 1 rules applied. Total rules applied 824 place count 1524 transition count 2387
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 825 place count 1523 transition count 2379
Iterating global reduction 7 with 1 rules applied. Total rules applied 826 place count 1523 transition count 2379
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 938 place count 1467 transition count 2323
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 939 place count 1467 transition count 2322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 940 place count 1466 transition count 2322
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 950 place count 1466 transition count 2312
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 960 place count 1456 transition count 2312
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 968 place count 1456 transition count 2312
Applied a total of 968 rules in 1826 ms. Remains 1456 /1991 variables (removed 535) and now considering 2312/2888 (removed 576) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1839 ms. Remains : 1456/1991 places, 2312/2888 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 6) seen :1
FORMULA ASLink-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2312 rows 1456 cols
[2023-03-13 01:27:35] [INFO ] Computed 272 place invariants in 42 ms
[2023-03-13 01:27:35] [INFO ] [Real]Absence check using 69 positive place invariants in 38 ms returned sat
[2023-03-13 01:27:35] [INFO ] [Real]Absence check using 69 positive and 203 generalized place invariants in 136 ms returned sat
[2023-03-13 01:27:35] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 01:27:36] [INFO ] [Nat]Absence check using 69 positive place invariants in 33 ms returned sat
[2023-03-13 01:27:36] [INFO ] [Nat]Absence check using 69 positive and 203 generalized place invariants in 160 ms returned sat
[2023-03-13 01:27:58] [INFO ] After 21911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 01:27:58] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 01:28:00] [INFO ] After 2147ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 01:28:00] [INFO ] After 2148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 01:28:00] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 408 ms.
Support contains 80 out of 1456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1456/1456 places, 2312/2312 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 1456 transition count 2309
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 1453 transition count 2308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1452 transition count 2308
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 1452 transition count 2303
Deduced a syphon composed of 5 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 20 place count 1445 transition count 2303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 1444 transition count 2302
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 1444 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 1443 transition count 2301
Applied a total of 24 rules in 310 ms. Remains 1443 /1456 variables (removed 13) and now considering 2301/2312 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 1443/1456 places, 2301/2312 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 77369 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77369 steps, saw 43556 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2301 rows 1443 cols
[2023-03-13 01:28:05] [INFO ] Computed 270 place invariants in 47 ms
[2023-03-13 01:28:05] [INFO ] [Real]Absence check using 70 positive place invariants in 43 ms returned sat
[2023-03-13 01:28:05] [INFO ] [Real]Absence check using 70 positive and 200 generalized place invariants in 171 ms returned sat
[2023-03-13 01:28:05] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 01:28:06] [INFO ] [Nat]Absence check using 70 positive place invariants in 22 ms returned sat
[2023-03-13 01:28:06] [INFO ] [Nat]Absence check using 70 positive and 200 generalized place invariants in 114 ms returned sat
[2023-03-13 01:28:30] [INFO ] After 24405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 01:28:30] [INFO ] State equation strengthened by 50 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 01:28:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:28:30] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 80 out of 1443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1443/1443 places, 2301/2301 transitions.
Applied a total of 0 rules in 73 ms. Remains 1443 /1443 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1443/1443 places, 2301/2301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1443/1443 places, 2301/2301 transitions.
Applied a total of 0 rules in 101 ms. Remains 1443 /1443 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
[2023-03-13 01:28:31] [INFO ] Invariant cache hit.
[2023-03-13 01:28:32] [INFO ] Implicit Places using invariants in 1412 ms returned [1, 19, 20, 22, 32, 50, 68, 142, 154, 167, 168, 169, 170, 171, 189, 207, 260, 273, 294, 307, 308, 309, 310, 311, 329, 347, 383, 429, 442, 443, 444, 445, 446, 464, 482, 522, 548, 562, 574, 587, 588, 590, 591, 609, 627, 710, 725, 726, 727, 728, 746, 764, 802, 837, 849, 863, 866, 867, 868, 886, 904, 986, 999, 1000, 1001, 1002, 1003, 1021, 1039, 1075, 1103, 1123, 1136, 1141, 1142, 1143, 1161, 1179, 1217, 1234, 1254, 1266, 1271, 1282, 1283, 1284, 1285, 1286, 1306, 1308, 1311, 1329, 1330, 1331, 1332, 1344, 1350, 1356, 1362, 1368, 1374, 1380, 1386, 1392, 1398, 1404, 1440]
Discarding 107 places :
Implicit Place search using SMT only with invariants took 1431 ms to find 107 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1336/1443 places, 2301/2301 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 1336 transition count 2174
Reduce places removed 127 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 146 rules applied. Total rules applied 273 place count 1209 transition count 2155
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 292 place count 1190 transition count 2155
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 292 place count 1190 transition count 2107
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 388 place count 1142 transition count 2107
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 33 rules applied. Total rules applied 421 place count 1125 transition count 2091
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 437 place count 1109 transition count 2091
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 437 place count 1109 transition count 2090
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 439 place count 1108 transition count 2090
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 449 place count 1098 transition count 2080
Iterating global reduction 5 with 10 rules applied. Total rules applied 459 place count 1098 transition count 2080
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 461 place count 1098 transition count 2078
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 464 place count 1095 transition count 2075
Iterating global reduction 6 with 3 rules applied. Total rules applied 467 place count 1095 transition count 2075
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 468 place count 1094 transition count 2074
Iterating global reduction 6 with 1 rules applied. Total rules applied 469 place count 1094 transition count 2074
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 470 place count 1093 transition count 2073
Iterating global reduction 6 with 1 rules applied. Total rules applied 471 place count 1093 transition count 2073
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 3 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 623 place count 1017 transition count 1997
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 628 place count 1012 transition count 1992
Iterating global reduction 6 with 5 rules applied. Total rules applied 633 place count 1012 transition count 1992
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 637 place count 1012 transition count 1988
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 638 place count 1012 transition count 1987
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 645 place count 1012 transition count 1980
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 655 place count 1005 transition count 1977
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 657 place count 1005 transition count 1975
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 8 with 27 rules applied. Total rules applied 684 place count 1005 transition count 1948
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 712 place count 977 transition count 1948
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 737 place count 977 transition count 1948
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 742 place count 977 transition count 1948
Applied a total of 742 rules in 691 ms. Remains 977 /1336 variables (removed 359) and now considering 1948/2301 (removed 353) transitions.
// Phase 1: matrix 1948 rows 977 cols
[2023-03-13 01:28:33] [INFO ] Computed 145 place invariants in 19 ms
[2023-03-13 01:28:34] [INFO ] Implicit Places using invariants in 712 ms returned [91, 97, 116, 117, 169, 203, 205, 211, 216, 217, 288, 294, 297, 299, 302, 307, 308, 360, 398, 408, 413, 414, 467, 485, 493, 496, 498, 504, 509, 510, 585, 591, 594, 601, 609, 610, 664, 683, 694, 696, 697, 702, 778, 789, 791, 794, 801, 802, 858, 887, 890, 896, 970, 974]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 728 ms to find 54 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 923/1443 places, 1948/2301 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 910 transition count 1935
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 910 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 909 transition count 1934
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 909 transition count 1934
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 54 place count 896 transition count 1921
Free-agglomeration rule applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 896 transition count 1905
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 86 place count 880 transition count 1905
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 880 transition count 1902
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 92 place count 877 transition count 1902
Applied a total of 92 rules in 158 ms. Remains 877 /923 variables (removed 46) and now considering 1902/1948 (removed 46) transitions.
// Phase 1: matrix 1902 rows 877 cols
[2023-03-13 01:28:34] [INFO ] Computed 91 place invariants in 20 ms
[2023-03-13 01:28:34] [INFO ] Implicit Places using invariants in 666 ms returned []
[2023-03-13 01:28:34] [INFO ] Invariant cache hit.
[2023-03-13 01:28:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 01:28:38] [INFO ] Implicit Places using invariants and state equation in 3391 ms returned []
Implicit Place search using SMT with State Equation took 4074 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 877/1443 places, 1902/2301 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7185 ms. Remains : 877/1443 places, 1902/2301 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 140470 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{2=1}
Probabilistic random walk after 140470 steps, saw 58214 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :1
FORMULA ASLink-PT-09a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2023-03-13 01:28:41] [INFO ] Invariant cache hit.
[2023-03-13 01:28:41] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-13 01:28:42] [INFO ] [Real]Absence check using 18 positive and 73 generalized place invariants in 90 ms returned sat
[2023-03-13 01:28:42] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 01:28:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-13 01:28:42] [INFO ] [Nat]Absence check using 18 positive and 73 generalized place invariants in 26 ms returned sat
[2023-03-13 01:29:07] [INFO ] After 24635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 01:29:07] [INFO ] State equation strengthened by 12 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 01:29:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:29:07] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 73 out of 877 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 877/877 places, 1902/1902 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 0 with 1 rules applied. Total rules applied 1 place count 877 transition count 1901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 876 transition count 1901
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 876 transition count 1897
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 872 transition count 1897
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 871 transition count 1895
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 15 place count 869 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 868 transition count 1894
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 868 transition count 1894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 18 place count 868 transition count 1893
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 20 place count 867 transition count 1892
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 867 transition count 1891
Applied a total of 21 rules in 110 ms. Remains 867 /877 variables (removed 10) and now considering 1891/1902 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 867/877 places, 1891/1902 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 137445 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137445 steps, saw 59302 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1891 rows 867 cols
[2023-03-13 01:29:10] [INFO ] Computed 90 place invariants in 17 ms
[2023-03-13 01:29:10] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-13 01:29:10] [INFO ] [Real]Absence check using 19 positive and 71 generalized place invariants in 38 ms returned sat
[2023-03-13 01:29:10] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 01:29:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-13 01:29:11] [INFO ] [Nat]Absence check using 19 positive and 71 generalized place invariants in 49 ms returned sat
[2023-03-13 01:29:35] [INFO ] After 24617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 01:29:36] [INFO ] State equation strengthened by 12 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 01:29:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:29:36] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 114 ms.
Support contains 73 out of 867 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 867/867 places, 1891/1891 transitions.
Applied a total of 0 rules in 53 ms. Remains 867 /867 variables (removed 0) and now considering 1891/1891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 867/867 places, 1891/1891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 867/867 places, 1891/1891 transitions.
Applied a total of 0 rules in 52 ms. Remains 867 /867 variables (removed 0) and now considering 1891/1891 (removed 0) transitions.
[2023-03-13 01:29:36] [INFO ] Invariant cache hit.
[2023-03-13 01:29:36] [INFO ] Implicit Places using invariants in 767 ms returned [73, 537]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 783 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 865/867 places, 1891/1891 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 865 transition count 1889
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 863 transition count 1889
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 862 transition count 1888
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 862 transition count 1887
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 862 transition count 1886
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 861 transition count 1886
Applied a total of 9 rules in 108 ms. Remains 861 /865 variables (removed 4) and now considering 1886/1891 (removed 5) transitions.
// Phase 1: matrix 1886 rows 861 cols
[2023-03-13 01:29:37] [INFO ] Computed 88 place invariants in 15 ms
[2023-03-13 01:29:37] [INFO ] Implicit Places using invariants in 633 ms returned [525, 526]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 635 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 859/867 places, 1886/1891 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 858 transition count 1885
Applied a total of 2 rules in 55 ms. Remains 858 /859 variables (removed 1) and now considering 1885/1886 (removed 1) transitions.
// Phase 1: matrix 1885 rows 858 cols
[2023-03-13 01:29:37] [INFO ] Computed 86 place invariants in 33 ms
[2023-03-13 01:29:38] [INFO ] Implicit Places using invariants in 736 ms returned []
[2023-03-13 01:29:38] [INFO ] Invariant cache hit.
[2023-03-13 01:29:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 01:29:41] [INFO ] Implicit Places using invariants and state equation in 3064 ms returned []
Implicit Place search using SMT with State Equation took 3825 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 858/867 places, 1885/1891 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5459 ms. Remains : 858/867 places, 1885/1891 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 134164 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134164 steps, saw 57288 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 01:29:45] [INFO ] Invariant cache hit.
[2023-03-13 01:29:45] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-13 01:29:45] [INFO ] [Real]Absence check using 16 positive and 70 generalized place invariants in 28 ms returned sat
[2023-03-13 01:29:45] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 01:29:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-13 01:29:45] [INFO ] [Nat]Absence check using 16 positive and 70 generalized place invariants in 33 ms returned sat
[2023-03-13 01:30:10] [INFO ] After 24649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 01:30:10] [INFO ] State equation strengthened by 7 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 01:30:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:30:10] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 111 ms.
Support contains 73 out of 858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 858/858 places, 1885/1885 transitions.
Applied a total of 0 rules in 24 ms. Remains 858 /858 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 858/858 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 858/858 places, 1885/1885 transitions.
Applied a total of 0 rules in 21 ms. Remains 858 /858 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-13 01:30:10] [INFO ] Invariant cache hit.
[2023-03-13 01:30:11] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-13 01:30:11] [INFO ] Invariant cache hit.
[2023-03-13 01:30:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 01:30:14] [INFO ] Implicit Places using invariants and state equation in 2778 ms returned []
Implicit Place search using SMT with State Equation took 3514 ms to find 0 implicit places.
[2023-03-13 01:30:14] [INFO ] Redundant transitions in 218 ms returned []
[2023-03-13 01:30:14] [INFO ] Invariant cache hit.
[2023-03-13 01:30:15] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4632 ms. Remains : 858/858 places, 1885/1885 transitions.
Applied a total of 0 rules in 30 ms. Remains 858 /858 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-13 01:30:15] [INFO ] Invariant cache hit.
[2023-03-13 01:30:15] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-13 01:30:15] [INFO ] [Real]Absence check using 16 positive and 70 generalized place invariants in 33 ms returned sat
[2023-03-13 01:30:15] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 01:30:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 01:30:15] [INFO ] [Nat]Absence check using 16 positive and 70 generalized place invariants in 32 ms returned sat
[2023-03-13 01:30:40] [INFO ] After 24649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 01:30:46] [INFO ] After 30736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9225 ms.
[2023-03-13 01:30:55] [INFO ] After 40273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 01:30:55] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 25 ms.
[2023-03-13 01:30:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 858 places, 1885 transitions and 7497 arcs took 22 ms.
[2023-03-13 01:30:56] [INFO ] Flatten gal took : 182 ms
Total runtime 231582 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ASLink_PT_09a
(NrP: 858 NrTr: 1885 NrArc: 7497)

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

net check time: 0m 0.001sec

init dd package: 0m 2.913sec


before gc: list nodes free: 759301

after gc: idd nodes used:10353, unused:63989647; list nodes free:259993111

before gc: list nodes free: 704943

after gc: idd nodes used:5696, unused:63994304; list nodes free:260018078

before gc: list nodes free: 337041

after gc: idd nodes used:6036, unused:63993964; list nodes free:260016272
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6648640 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095256 kB

BK_TIME_CONFINEMENT_REACHED

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

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

4533 5847 6106 6832 6537 6598 7250 8183 8130 8188 8625 8644 8452 9792 9618 9405 10141 10010 9642 10555 10783 9833 10645 10692 9830 10654 11033 10268 10432 10744 10386 10403 9244 7778 5709 5624 5932 5831 5528 5909 5882 5087 5895 6107 4837 5831 6147 4636 5819 6179 4506 5520 6426 4808 5407 6434 4883 5443 6425 4909 5307 6415 4995 5497 6424 5034 5338 6442 5098 5610 6730 5122 5810 6382 5108 5648 6395 5069 5812 6141 5157 5688 6299 5200 5790 6283 5227 5685 6282 5263 5714 6285 5283 5929 6273 5300 5767 6272 5441 5866 6261 5582 5775 6205 5608 5817 6104 5648 5985 5823 5725 5792 5773 5815 5858 5716 5977

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="ASLink-PT-09a"
export BK_EXAMINATION="ReachabilityCardinality"
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 ASLink-PT-09a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813598600142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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