fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r010-oct2-167813598600094
Last Updated
May 14, 2023

About the Execution of Marcie+red for ASLink-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7888.044 3600000.00 3679918.00 135.30 T??F?FFFFFT?FTT? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813598600094.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-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598600094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:08 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.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 597K 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-06a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678663570807

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-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 23:26:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 23:26:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:26:13] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2023-03-12 23:26:13] [INFO ] Transformed 1406 places.
[2023-03-12 23:26:13] [INFO ] Transformed 2100 transitions.
[2023-03-12 23:26:13] [INFO ] Found NUPN structural information;
[2023-03-12 23:26:13] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 16) seen :6
FORMULA ASLink-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :1
FORMULA ASLink-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :1
FORMULA ASLink-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2078 rows 1406 cols
[2023-03-12 23:26:14] [INFO ] Computed 270 place invariants in 91 ms
[2023-03-12 23:26:15] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 23:26:16] [INFO ] [Nat]Absence check using 66 positive place invariants in 57 ms returned sat
[2023-03-12 23:26:16] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 69 ms returned sat
[2023-03-12 23:26:40] [INFO ] After 24331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 23:26:40] [INFO ] After 24355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-12 23:26:40] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 220 ms.
Support contains 88 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1371 transition count 1977
Reduce places removed 101 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 111 rules applied. Total rules applied 247 place count 1270 transition count 1967
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 257 place count 1260 transition count 1967
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 257 place count 1260 transition count 1851
Deduced a syphon composed of 116 places in 3 ms
Ensure Unique test removed 40 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 529 place count 1104 transition count 1851
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 538 place count 1095 transition count 1804
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 548 place count 1094 transition count 1804
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 554 place count 1093 transition count 1799
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 557 place count 1090 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 558 place count 1089 transition count 1791
Iterating global reduction 5 with 1 rules applied. Total rules applied 559 place count 1089 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 560 place count 1088 transition count 1783
Iterating global reduction 5 with 1 rules applied. Total rules applied 561 place count 1088 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 562 place count 1087 transition count 1775
Iterating global reduction 5 with 1 rules applied. Total rules applied 563 place count 1087 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 564 place count 1086 transition count 1767
Iterating global reduction 5 with 1 rules applied. Total rules applied 565 place count 1086 transition count 1767
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 566 place count 1085 transition count 1759
Iterating global reduction 5 with 1 rules applied. Total rules applied 567 place count 1085 transition count 1759
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 568 place count 1084 transition count 1751
Iterating global reduction 5 with 1 rules applied. Total rules applied 569 place count 1084 transition count 1751
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 570 place count 1083 transition count 1743
Iterating global reduction 5 with 1 rules applied. Total rules applied 571 place count 1083 transition count 1743
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 572 place count 1082 transition count 1735
Iterating global reduction 5 with 1 rules applied. Total rules applied 573 place count 1082 transition count 1735
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 647 place count 1045 transition count 1698
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 649 place count 1045 transition count 1696
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 651 place count 1043 transition count 1696
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 655 place count 1043 transition count 1692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 659 place count 1039 transition count 1692
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 666 place count 1039 transition count 1692
Applied a total of 666 rules in 984 ms. Remains 1039 /1406 variables (removed 367) and now considering 1692/2078 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 985 ms. Remains : 1039/1406 places, 1692/2078 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 159625 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159625 steps, saw 45717 distinct states, run finished after 3005 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1692 rows 1039 cols
[2023-03-12 23:26:45] [INFO ] Computed 193 place invariants in 32 ms
[2023-03-12 23:26:46] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 23:26:46] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-12 23:26:46] [INFO ] [Nat]Absence check using 52 positive and 141 generalized place invariants in 160 ms returned sat
[2023-03-12 23:27:11] [INFO ] After 24299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 23:27:11] [INFO ] State equation strengthened by 30 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-12 23:27:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:27:11] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 88 out of 1039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 1692/1692 transitions.
Applied a total of 0 rules in 34 ms. Remains 1039 /1039 variables (removed 0) and now considering 1692/1692 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1039/1039 places, 1692/1692 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 1692/1692 transitions.
Applied a total of 0 rules in 30 ms. Remains 1039 /1039 variables (removed 0) and now considering 1692/1692 (removed 0) transitions.
[2023-03-12 23:27:11] [INFO ] Invariant cache hit.
[2023-03-12 23:27:12] [INFO ] Implicit Places using invariants in 1056 ms returned [1, 19, 20, 22, 32, 50, 68, 149, 163, 165, 166, 167, 185, 203, 239, 277, 289, 302, 303, 304, 305, 306, 342, 381, 398, 418, 433, 447, 448, 449, 450, 451, 469, 487, 551, 571, 584, 585, 586, 587, 588, 606, 624, 712, 726, 729, 730, 731, 749, 767, 830, 850, 855, 866, 870, 871, 872, 898, 900, 903, 921, 922, 924, 925, 938, 944, 950, 956, 974, 980, 986, 992, 998, 1027]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 1060 ms to find 74 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 965/1039 places, 1692/1692 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 965 transition count 1602
Reduce places removed 90 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 101 rules applied. Total rules applied 191 place count 875 transition count 1591
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 202 place count 864 transition count 1591
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 202 place count 864 transition count 1559
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 266 place count 832 transition count 1559
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 18 rules applied. Total rules applied 284 place count 822 transition count 1551
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 293 place count 814 transition count 1550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 294 place count 813 transition count 1550
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 305 place count 802 transition count 1539
Iterating global reduction 6 with 11 rules applied. Total rules applied 316 place count 802 transition count 1539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 317 place count 802 transition count 1538
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 320 place count 799 transition count 1535
Iterating global reduction 7 with 3 rules applied. Total rules applied 323 place count 799 transition count 1535
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 324 place count 798 transition count 1534
Iterating global reduction 7 with 1 rules applied. Total rules applied 325 place count 798 transition count 1534
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 326 place count 797 transition count 1533
Iterating global reduction 7 with 1 rules applied. Total rules applied 327 place count 797 transition count 1533
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 417 place count 752 transition count 1488
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 419 place count 750 transition count 1486
Iterating global reduction 7 with 2 rules applied. Total rules applied 421 place count 750 transition count 1486
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 423 place count 750 transition count 1484
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 427 place count 750 transition count 1480
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 432 place count 746 transition count 1479
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 9 with 26 rules applied. Total rules applied 458 place count 746 transition count 1453
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 484 place count 720 transition count 1453
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 498 place count 720 transition count 1453
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 504 place count 720 transition count 1453
Applied a total of 504 rules in 290 ms. Remains 720 /965 variables (removed 245) and now considering 1453/1692 (removed 239) transitions.
// Phase 1: matrix 1453 rows 720 cols
[2023-03-12 23:27:12] [INFO ] Computed 109 place invariants in 31 ms
[2023-03-12 23:27:13] [INFO ] Implicit Places using invariants in 525 ms returned [92, 98, 101, 103, 107, 114, 115, 189, 198, 201, 210, 211, 216, 217, 271, 309, 323, 328, 329, 382, 401, 413, 415, 416, 510, 513, 515, 519, 606, 620, 623, 698, 701, 708, 714]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 529 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 685/1039 places, 1453/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 674 transition count 1442
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 674 transition count 1442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 673 transition count 1441
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 673 transition count 1441
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 667 transition count 1435
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 667 transition count 1426
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 658 transition count 1426
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 658 transition count 1424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 656 transition count 1424
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 656 transition count 1424
Applied a total of 61 rules in 142 ms. Remains 656 /685 variables (removed 29) and now considering 1424/1453 (removed 29) transitions.
// Phase 1: matrix 1424 rows 656 cols
[2023-03-12 23:27:13] [INFO ] Computed 74 place invariants in 30 ms
[2023-03-12 23:27:14] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-12 23:27:14] [INFO ] Invariant cache hit.
[2023-03-12 23:27:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 23:27:16] [INFO ] Implicit Places using invariants and state equation in 2247 ms returned []
Implicit Place search using SMT with State Equation took 2707 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 656/1039 places, 1424/1692 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4769 ms. Remains : 656/1039 places, 1424/1692 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 230340 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 230340 steps, saw 62300 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :2
FORMULA ASLink-PT-06a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
[2023-03-12 23:27:19] [INFO ] Invariant cache hit.
[2023-03-12 23:27:20] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:27:20] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-12 23:27:20] [INFO ] [Nat]Absence check using 18 positive and 56 generalized place invariants in 45 ms returned sat
[2023-03-12 23:27:38] [INFO ] After 17754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 23:27:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 23:27:45] [INFO ] After 6856ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:27:45] [INFO ] After 6857ms 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-12 23:27:45] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 196 ms.
Support contains 45 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 1424/1424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 1416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 1416
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 16 place count 648 transition count 1405
Deduced a syphon composed of 11 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 40 place count 635 transition count 1405
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 634 transition count 1405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 41 place count 634 transition count 1403
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 632 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 47 place count 630 transition count 1394
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 630 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 629 transition count 1386
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 629 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 628 transition count 1378
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 628 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 627 transition count 1370
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 627 transition count 1370
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 69 place count 620 transition count 1363
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 74 place count 620 transition count 1358
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 620 transition count 1354
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 82 place count 616 transition count 1354
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 616 transition count 1353
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 86 place count 616 transition count 1350
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 89 place count 613 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 612 transition count 1349
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 612 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 612 transition count 1348
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 93 place count 612 transition count 1347
Applied a total of 93 rules in 204 ms. Remains 612 /656 variables (removed 44) and now considering 1347/1424 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 612/656 places, 1347/1424 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 223821 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223821 steps, saw 62544 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1347 rows 612 cols
[2023-03-12 23:27:48] [INFO ] Computed 71 place invariants in 10 ms
[2023-03-12 23:27:48] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:27:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-12 23:27:49] [INFO ] [Nat]Absence check using 17 positive and 54 generalized place invariants in 59 ms returned sat
[2023-03-12 23:28:08] [INFO ] After 19163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:28:08] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 23:28:13] [INFO ] After 4663ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:28:14] [INFO ] After 5564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 23:28:14] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 5 different solutions.
FORMULA ASLink-PT-06a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 614 ms.
Support contains 44 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1347/1347 transitions.
Applied a total of 0 rules in 16 ms. Remains 612 /612 variables (removed 0) and now considering 1347/1347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 612/612 places, 1347/1347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1347/1347 transitions.
Applied a total of 0 rules in 15 ms. Remains 612 /612 variables (removed 0) and now considering 1347/1347 (removed 0) transitions.
[2023-03-12 23:28:14] [INFO ] Invariant cache hit.
[2023-03-12 23:28:15] [INFO ] Implicit Places using invariants in 350 ms returned [97, 268, 431, 450, 523, 604]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 353 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 606/612 places, 1347/1347 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 606 transition count 1343
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 602 transition count 1343
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 599 transition count 1340
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 599 transition count 1340
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 597 transition count 1338
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 597 transition count 1338
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 594 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 593 transition count 1334
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 593 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 592 transition count 1333
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 592 transition count 1333
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 592 transition count 1330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 34 place count 589 transition count 1330
Applied a total of 34 rules in 77 ms. Remains 589 /606 variables (removed 17) and now considering 1330/1347 (removed 17) transitions.
// Phase 1: matrix 1330 rows 589 cols
[2023-03-12 23:28:15] [INFO ] Computed 65 place invariants in 9 ms
[2023-03-12 23:28:15] [INFO ] Implicit Places using invariants in 397 ms returned [89, 90, 422, 423]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 400 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 585/612 places, 1330/1347 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 584 transition count 1329
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 584 transition count 1329
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 582 transition count 1327
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 582 transition count 1325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 580 transition count 1325
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 580 transition count 1325
Applied a total of 11 rules in 68 ms. Remains 580 /585 variables (removed 5) and now considering 1325/1330 (removed 5) transitions.
// Phase 1: matrix 1325 rows 580 cols
[2023-03-12 23:28:15] [INFO ] Computed 61 place invariants in 26 ms
[2023-03-12 23:28:16] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-12 23:28:16] [INFO ] Invariant cache hit.
[2023-03-12 23:28:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 23:28:17] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2407 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 580/612 places, 1325/1347 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3321 ms. Remains : 580/612 places, 1325/1347 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 221732 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221732 steps, saw 70103 distinct states, run finished after 3003 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 23:28:21] [INFO ] Invariant cache hit.
[2023-03-12 23:28:21] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 23:28:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 23:28:21] [INFO ] [Nat]Absence check using 16 positive and 45 generalized place invariants in 35 ms returned sat
[2023-03-12 23:28:31] [INFO ] After 9705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:28:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 23:28:31] [INFO ] After 483ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:28:41] [INFO ] After 9878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-12 23:28:41] [INFO ] After 20110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 77 ms.
Support contains 44 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1325/1325 transitions.
Applied a total of 0 rules in 14 ms. Remains 580 /580 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 580/580 places, 1325/1325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1325/1325 transitions.
Applied a total of 0 rules in 13 ms. Remains 580 /580 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
[2023-03-12 23:28:41] [INFO ] Invariant cache hit.
[2023-03-12 23:28:42] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-12 23:28:42] [INFO ] Invariant cache hit.
[2023-03-12 23:28:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 23:28:44] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
[2023-03-12 23:28:44] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-12 23:28:44] [INFO ] Invariant cache hit.
[2023-03-12 23:28:44] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3160 ms. Remains : 580/580 places, 1325/1325 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 580 transition count 1324
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 579 transition count 1324
Applied a total of 2 rules in 30 ms. Remains 579 /580 variables (removed 1) and now considering 1324/1325 (removed 1) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1324 rows 579 cols
[2023-03-12 23:28:44] [INFO ] Computed 61 place invariants in 22 ms
[2023-03-12 23:28:44] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 23:28:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-12 23:28:45] [INFO ] [Nat]Absence check using 14 positive and 47 generalized place invariants in 21 ms returned sat
[2023-03-12 23:29:04] [INFO ] After 19092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:29:04] [INFO ] After 19517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 366 ms.
[2023-03-12 23:29:05] [INFO ] After 20114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:29:05] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-12 23:29:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 580 places, 1325 transitions and 5313 arcs took 13 ms.
[2023-03-12 23:29:05] [INFO ] Flatten gal took : 213 ms
Total runtime 172491 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_06a
(NrP: 580 NrTr: 1325 NrArc: 5313)

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

net check time: 0m 0.000sec

init dd package: 0m 2.836sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 8257168 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16094124 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 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.008sec

24178 38228 60551 79381 100823 103381 102495 101997 114020 118839 103846 107682 104380 104186 104679 105724 105383 111523 108462 108130 109231 107895 108915 107493 115058 107006 111026 114058 117861 117175 122350 121214 129560 118122 113434 120159 117430 119010 122286 115792 130831 118710 121343 118356 118027 122818 122353 118523 125193 122461 120414 126961 121263 123208 125032 121833 138369 131065 126227 123415 127060 126125 127776 144479 125886 129426 128058 126394 133590 129881 131420 148969 129655 135304 131785 129479 137286 136103 134752 152936 132792 139051 134956 132691 140998 136361 137561 149683 134397 139683 138170 135806 140395 139437 137087 143292 169065 141172 139642 150815 140583 156230 151063 138085 148037 151853 148866 144482 142618 144975 162874 145680 165352 164493 153370 148239 148520 147393 147769 153622 173030 150296 158514 152219 149136 154524 176172 151102 160884 155699 153717 163282 175607 158747 185812 156495 159561 168618 156919 168315 153702 164321 169941 159022 162451 173984 160903 177897 156667 166231 172801 161673 166083 186995 162885 188046 163267 169219 178406 165514 172848 199651 165831 181123 165925 172951 188949 169691 191007 165791 177091 193088 171055 177644

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-06a"
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-06a, 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-167813598600094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06a.tgz
mv ASLink-PT-06a 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 ;