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.r011-oct2-167813599800151.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 smartxred
Input is ASLink-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599800151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:05 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.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:06 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 1.3M 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-09b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678728385671

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 17:26:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:26:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:26:29] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2023-03-13 17:26:29] [INFO ] Transformed 4014 places.
[2023-03-13 17:26:29] [INFO ] Transformed 4932 transitions.
[2023-03-13 17:26:29] [INFO ] Found NUPN structural information;
[2023-03-13 17:26:29] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 693 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 16) seen :2
FORMULA ASLink-PT-09b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 4932 rows 4014 cols
[2023-03-13 17:26:31] [INFO ] Computed 394 place invariants in 184 ms
[2023-03-13 17:26:34] [INFO ] After 2479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 17:26:36] [INFO ] [Nat]Absence check using 93 positive place invariants in 74 ms returned sat
[2023-03-13 17:26:36] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 406 ms returned sat
[2023-03-13 17:26:59] [INFO ] After 21071ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-13 17:26:59] [INFO ] After 21087ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 17:26:59] [INFO ] After 25104ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
FORMULA ASLink-PT-09b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 273 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions removed 764 transitions
Trivial Post-agglo rules discarded 764 transitions
Performed 764 trivial Post agglomeration. Transition count delta: 764
Iterating post reduction 0 with 764 rules applied. Total rules applied 764 place count 4014 transition count 4168
Reduce places removed 764 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 790 rules applied. Total rules applied 1554 place count 3250 transition count 4142
Reduce places removed 6 places and 0 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 2 with 66 rules applied. Total rules applied 1620 place count 3244 transition count 4082
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 70 rules applied. Total rules applied 1690 place count 3184 transition count 4072
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1692 place count 3182 transition count 4072
Performed 865 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 865 Pre rules applied. Total rules applied 1692 place count 3182 transition count 3207
Deduced a syphon composed of 865 places in 8 ms
Ensure Unique test removed 80 places
Reduce places removed 945 places and 0 transitions.
Iterating global reduction 5 with 1810 rules applied. Total rules applied 3502 place count 2237 transition count 3207
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 5 with 57 rules applied. Total rules applied 3559 place count 2225 transition count 3162
Reduce places removed 45 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 6 with 50 rules applied. Total rules applied 3609 place count 2180 transition count 3157
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 3614 place count 2175 transition count 3157
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 31 Pre rules applied. Total rules applied 3614 place count 2175 transition count 3126
Deduced a syphon composed of 31 places in 27 ms
Ensure Unique test removed 24 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 3700 place count 2120 transition count 3126
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 3701 place count 2119 transition count 3126
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 23 Pre rules applied. Total rules applied 3701 place count 2119 transition count 3103
Deduced a syphon composed of 23 places in 23 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 3747 place count 2096 transition count 3103
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 3871 place count 1972 transition count 2979
Iterating global reduction 9 with 124 rules applied. Total rules applied 3995 place count 1972 transition count 2979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3996 place count 1972 transition count 2978
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 30 Pre rules applied. Total rules applied 3996 place count 1972 transition count 2948
Deduced a syphon composed of 30 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 10 with 61 rules applied. Total rules applied 4057 place count 1941 transition count 2948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 4057 place count 1941 transition count 2947
Deduced a syphon composed of 1 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 4060 place count 1939 transition count 2947
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 4066 place count 1933 transition count 2911
Iterating global reduction 10 with 6 rules applied. Total rules applied 4072 place count 1933 transition count 2911
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 4072 place count 1933 transition count 2907
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4080 place count 1929 transition count 2907
Performed 221 Post agglomeration using F-continuation condition.Transition count delta: 221
Deduced a syphon composed of 221 places in 7 ms
Ensure Unique test removed 4 places
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 10 with 446 rules applied. Total rules applied 4526 place count 1704 transition count 2686
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 4527 place count 1703 transition count 2685
Ensure Unique test removed 1 places
Iterating global reduction 10 with 2 rules applied. Total rules applied 4529 place count 1702 transition count 2685
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 4530 place count 1701 transition count 2684
Iterating global reduction 10 with 1 rules applied. Total rules applied 4531 place count 1701 transition count 2684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 4533 place count 1701 transition count 2682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4534 place count 1700 transition count 2682
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4536 place count 1699 transition count 2691
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 4538 place count 1699 transition count 2689
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 12 with 4 rules applied. Total rules applied 4542 place count 1697 transition count 2687
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 4544 place count 1695 transition count 2687
Free-agglomeration rule applied 13 times.
Iterating global reduction 14 with 13 rules applied. Total rules applied 4557 place count 1695 transition count 2674
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 4570 place count 1682 transition count 2674
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 15 with 10 rules applied. Total rules applied 4580 place count 1682 transition count 2664
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 4590 place count 1672 transition count 2664
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 4591 place count 1672 transition count 2664
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 4592 place count 1671 transition count 2663
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 16 with 11 rules applied. Total rules applied 4603 place count 1662 transition count 2661
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 4605 place count 1660 transition count 2661
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 13 Pre rules applied. Total rules applied 4605 place count 1660 transition count 2648
Deduced a syphon composed of 13 places in 7 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 18 with 26 rules applied. Total rules applied 4631 place count 1647 transition count 2648
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 18 with 3 rules applied. Total rules applied 4634 place count 1644 transition count 2648
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 19 with 20 rules applied. Total rules applied 4654 place count 1634 transition count 2638
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 4656 place count 1632 transition count 2636
Iterating global reduction 19 with 2 rules applied. Total rules applied 4658 place count 1632 transition count 2636
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 4660 place count 1632 transition count 2634
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 4662 place count 1630 transition count 2634
Applied a total of 4662 rules in 2392 ms. Remains 1630 /4014 variables (removed 2384) and now considering 2634/4932 (removed 2298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2392 ms. Remains : 1630/4014 places, 2634/4932 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 13) seen :2
FORMULA ASLink-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2634 rows 1630 cols
[2023-03-13 17:27:02] [INFO ] Computed 256 place invariants in 50 ms
[2023-03-13 17:27:03] [INFO ] After 783ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 17:27:04] [INFO ] [Nat]Absence check using 62 positive place invariants in 19 ms returned sat
[2023-03-13 17:27:04] [INFO ] [Nat]Absence check using 62 positive and 194 generalized place invariants in 88 ms returned sat
[2023-03-13 17:27:28] [INFO ] After 23400ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-13 17:27:28] [INFO ] State equation strengthened by 8 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 17:27:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:27:28] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ASLink-PT-09b-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 249 ms.
Support contains 261 out of 1630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1630/1630 places, 2634/2634 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 1630 transition count 2633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1629 transition count 2633
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 1629 transition count 2627
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 1623 transition count 2627
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 1621 transition count 2620
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 1621 transition count 2620
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 1620 transition count 2620
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 1618 transition count 2618
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 1617 transition count 2617
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 1617 transition count 2617
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 1617 transition count 2616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 1616 transition count 2616
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 1616 transition count 2616
Applied a total of 28 rules in 513 ms. Remains 1616 /1630 variables (removed 14) and now considering 2616/2634 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 1616/1630 places, 2616/2634 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 113326 steps, run timeout after 3007 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113326 steps, saw 28258 distinct states, run finished after 3009 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2616 rows 1616 cols
[2023-03-13 17:27:33] [INFO ] Computed 255 place invariants in 33 ms
[2023-03-13 17:27:34] [INFO ] [Real]Absence check using 60 positive place invariants in 48 ms returned sat
[2023-03-13 17:27:34] [INFO ] [Real]Absence check using 60 positive and 195 generalized place invariants in 249 ms returned sat
[2023-03-13 17:27:34] [INFO ] After 973ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 17:27:35] [INFO ] [Nat]Absence check using 60 positive place invariants in 20 ms returned sat
[2023-03-13 17:27:35] [INFO ] [Nat]Absence check using 60 positive and 195 generalized place invariants in 218 ms returned sat
[2023-03-13 17:27:59] [INFO ] After 23616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 17:27:59] [INFO ] State equation strengthened by 8 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 17:27:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:27:59] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 170 ms.
Support contains 261 out of 1616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1616/1616 places, 2616/2616 transitions.
Applied a total of 0 rules in 56 ms. Remains 1616 /1616 variables (removed 0) and now considering 2616/2616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1616/1616 places, 2616/2616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1616/1616 places, 2616/2616 transitions.
Applied a total of 0 rules in 60 ms. Remains 1616 /1616 variables (removed 0) and now considering 2616/2616 (removed 0) transitions.
[2023-03-13 17:27:59] [INFO ] Invariant cache hit.
[2023-03-13 17:28:02] [INFO ] Implicit Places using invariants in 2217 ms returned [1, 24, 25, 29, 42, 82, 172, 178, 192, 193, 240, 318, 326, 327, 339, 343, 364, 382, 461, 488, 489, 491, 494, 511, 529, 603, 619, 623, 624, 637, 638, 639, 689, 749, 805, 809, 810, 814, 852, 931, 946, 947, 950, 992, 1032, 1064, 1067, 1086, 1102, 1103, 1106, 1130, 1148, 1208, 1219, 1231, 1237, 1250, 1251, 1253, 1275, 1294, 1360, 1373, 1399, 1400, 1417, 1418, 1467, 1472, 1493, 1494, 1496, 1517, 1523, 1531, 1537, 1543, 1549, 1555, 1567, 1573, 1579]
Discarding 83 places :
Implicit Place search using SMT only with invariants took 2236 ms to find 83 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1533/1616 places, 2616/2616 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1533 transition count 2531
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 109 rules applied. Total rules applied 194 place count 1448 transition count 2507
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 217 place count 1425 transition count 2507
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 217 place count 1425 transition count 2478
Deduced a syphon composed of 29 places in 11 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 275 place count 1396 transition count 2478
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 276 place count 1395 transition count 2478
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 286 place count 1385 transition count 2468
Iterating global reduction 4 with 10 rules applied. Total rules applied 296 place count 1385 transition count 2468
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 296 place count 1385 transition count 2467
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 1384 transition count 2467
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 301 place count 1381 transition count 2464
Iterating global reduction 4 with 3 rules applied. Total rules applied 304 place count 1381 transition count 2464
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 307 place count 1378 transition count 2459
Iterating global reduction 4 with 3 rules applied. Total rules applied 310 place count 1378 transition count 2459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 311 place count 1378 transition count 2458
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 5 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 417 place count 1325 transition count 2405
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 421 place count 1321 transition count 2400
Iterating global reduction 5 with 4 rules applied. Total rules applied 425 place count 1321 transition count 2400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 426 place count 1321 transition count 2399
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 428 place count 1319 transition count 2397
Iterating global reduction 6 with 2 rules applied. Total rules applied 430 place count 1319 transition count 2397
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 431 place count 1319 transition count 2396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 432 place count 1318 transition count 2396
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 7 with 27 rules applied. Total rules applied 459 place count 1318 transition count 2369
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 486 place count 1291 transition count 2369
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 489 place count 1291 transition count 2366
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 499 place count 1291 transition count 2366
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 500 place count 1291 transition count 2366
Applied a total of 500 rules in 552 ms. Remains 1291 /1533 variables (removed 242) and now considering 2366/2616 (removed 250) transitions.
// Phase 1: matrix 2366 rows 1291 cols
[2023-03-13 17:28:02] [INFO ] Computed 171 place invariants in 54 ms
[2023-03-13 17:28:03] [INFO ] Implicit Places using invariants in 879 ms returned [93, 152, 349, 380, 392, 397, 398, 453, 478, 490, 492, 635, 644, 653, 744, 752, 758, 761, 768, 769, 862, 882, 887, 967, 1000, 1002, 1010, 1011, 1270, 1274, 1283, 1287]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 882 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1259/1616 places, 2366/2616 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1259 transition count 2365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1258 transition count 2365
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 1252 transition count 2359
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 1252 transition count 2359
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 1251 transition count 2358
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 1251 transition count 2358
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1250 transition count 2357
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1250 transition count 2357
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 1242 transition count 2349
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 1242 transition count 2348
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 44 place count 1242 transition count 2339
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 53 place count 1233 transition count 2339
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 1233 transition count 2338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 1232 transition count 2338
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 1232 transition count 2338
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 1232 transition count 2338
Applied a total of 57 rules in 371 ms. Remains 1232 /1259 variables (removed 27) and now considering 2338/2366 (removed 28) transitions.
// Phase 1: matrix 2338 rows 1232 cols
[2023-03-13 17:28:04] [INFO ] Computed 139 place invariants in 54 ms
[2023-03-13 17:28:05] [INFO ] Implicit Places using invariants in 997 ms returned []
[2023-03-13 17:28:05] [INFO ] Invariant cache hit.
[2023-03-13 17:28:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:28:07] [INFO ] Implicit Places using invariants and state equation in 2494 ms returned []
Implicit Place search using SMT with State Equation took 3494 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1232/1616 places, 2338/2616 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7599 ms. Remains : 1232/1616 places, 2338/2616 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :1
FORMULA ASLink-PT-09b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-13 17:28:08] [INFO ] Invariant cache hit.
[2023-03-13 17:28:09] [INFO ] [Real]Absence check using 37 positive place invariants in 59 ms returned sat
[2023-03-13 17:28:09] [INFO ] [Real]Absence check using 37 positive and 102 generalized place invariants in 100 ms returned sat
[2023-03-13 17:28:09] [INFO ] After 726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 17:28:09] [INFO ] [Nat]Absence check using 37 positive place invariants in 25 ms returned sat
[2023-03-13 17:28:10] [INFO ] [Nat]Absence check using 37 positive and 102 generalized place invariants in 159 ms returned sat
[2023-03-13 17:28:34] [INFO ] After 24045ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-13 17:28:34] [INFO ] State equation strengthened by 6 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 17:28:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:28:34] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ASLink-PT-09b-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 144 ms.
Support contains 194 out of 1232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1232/1232 places, 2338/2338 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1232 transition count 2327
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 1221 transition count 2326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 1220 transition count 2326
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 24 place count 1220 transition count 2295
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 86 place count 1189 transition count 2295
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 1188 transition count 2295
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 101 place count 1181 transition count 2288
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 1181 transition count 2286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 105 place count 1179 transition count 2286
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 1179 transition count 2285
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 108 place count 1177 transition count 2285
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 109 place count 1176 transition count 2284
Iterating global reduction 6 with 1 rules applied. Total rules applied 110 place count 1176 transition count 2284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 111 place count 1176 transition count 2283
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 114 place count 1173 transition count 2280
Applied a total of 114 rules in 308 ms. Remains 1173 /1232 variables (removed 59) and now considering 2280/2338 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 1173/1232 places, 2280/2338 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 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 8 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 91712 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91712 steps, saw 63792 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2280 rows 1173 cols
[2023-03-13 17:28:38] [INFO ] Computed 137 place invariants in 19 ms
[2023-03-13 17:28:38] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-13 17:28:39] [INFO ] [Real]Absence check using 35 positive and 102 generalized place invariants in 43 ms returned sat
[2023-03-13 17:28:39] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 17:28:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2023-03-13 17:28:39] [INFO ] [Nat]Absence check using 35 positive and 102 generalized place invariants in 95 ms returned sat
[2023-03-13 17:28:57] [INFO ] After 17919ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-13 17:28:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 17:29:01] [INFO ] After 3351ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-13 17:29:04] [INFO ] After 6373ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 17:29:04] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA ASLink-PT-09b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 306 ms.
Support contains 80 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 2280/2280 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1173 transition count 2258
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 1151 transition count 2257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 1150 transition count 2257
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 46 place count 1150 transition count 2198
Deduced a syphon composed of 59 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 166 place count 1089 transition count 2198
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 167 place count 1089 transition count 2197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 169 place count 1087 transition count 2197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 169 place count 1087 transition count 2196
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 1086 transition count 2196
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 174 place count 1083 transition count 2185
Iterating global reduction 5 with 3 rules applied. Total rules applied 177 place count 1083 transition count 2185
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 178 place count 1082 transition count 2185
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 182 place count 1078 transition count 2174
Iterating global reduction 6 with 4 rules applied. Total rules applied 186 place count 1078 transition count 2174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 187 place count 1078 transition count 2173
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 190 place count 1075 transition count 2163
Iterating global reduction 7 with 3 rules applied. Total rules applied 193 place count 1075 transition count 2163
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 196 place count 1072 transition count 2153
Iterating global reduction 7 with 3 rules applied. Total rules applied 199 place count 1072 transition count 2153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 200 place count 1072 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 201 place count 1071 transition count 2144
Iterating global reduction 8 with 1 rules applied. Total rules applied 202 place count 1071 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 203 place count 1070 transition count 2136
Iterating global reduction 8 with 1 rules applied. Total rules applied 204 place count 1070 transition count 2136
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 50 rules applied. Total rules applied 254 place count 1044 transition count 2112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 4 rules applied. Total rules applied 258 place count 1043 transition count 2109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 258 place count 1043 transition count 2103
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 270 place count 1037 transition count 2103
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 273 place count 1034 transition count 2100
Iterating global reduction 9 with 3 rules applied. Total rules applied 276 place count 1034 transition count 2100
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 278 place count 1032 transition count 2098
Iterating global reduction 9 with 2 rules applied. Total rules applied 280 place count 1032 transition count 2098
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 281 place count 1032 transition count 2097
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 285 place count 1030 transition count 2095
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 287 place count 1029 transition count 2094
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 290 place count 1029 transition count 2091
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 293 place count 1026 transition count 2091
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 294 place count 1026 transition count 2090
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 298 place count 1026 transition count 2086
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 302 place count 1022 transition count 2086
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 307 place count 1022 transition count 2086
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 12 with 5 rules applied. Total rules applied 312 place count 1017 transition count 2081
Applied a total of 312 rules in 645 ms. Remains 1017 /1173 variables (removed 156) and now considering 2081/2280 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 646 ms. Remains : 1017/1173 places, 2081/2280 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 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 14 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 104581 steps, run timeout after 3006 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104581 steps, saw 35626 distinct states, run finished after 3007 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2081 rows 1017 cols
[2023-03-13 17:29:08] [INFO ] Computed 130 place invariants in 39 ms
[2023-03-13 17:29:08] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2023-03-13 17:29:08] [INFO ] [Real]Absence check using 35 positive and 95 generalized place invariants in 91 ms returned sat
[2023-03-13 17:29:09] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 17:29:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2023-03-13 17:29:09] [INFO ] [Nat]Absence check using 35 positive and 95 generalized place invariants in 61 ms returned sat
[2023-03-13 17:29:20] [INFO ] After 10903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 17:29:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 17:29:29] [INFO ] After 9314ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 17:29:30] [INFO ] After 9769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 224 ms.
[2023-03-13 17:29:30] [INFO ] After 21356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 80 out of 1017 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1017/1017 places, 2081/2081 transitions.
Applied a total of 0 rules in 37 ms. Remains 1017 /1017 variables (removed 0) and now considering 2081/2081 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1017/1017 places, 2081/2081 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1017/1017 places, 2081/2081 transitions.
Applied a total of 0 rules in 33 ms. Remains 1017 /1017 variables (removed 0) and now considering 2081/2081 (removed 0) transitions.
[2023-03-13 17:29:30] [INFO ] Invariant cache hit.
[2023-03-13 17:29:31] [INFO ] Implicit Places using invariants in 1184 ms returned [43, 120, 123, 147, 185, 211, 219, 225, 327, 332, 409, 448, 523, 530, 534, 535, 536, 541, 561, 645, 682, 708, 710, 791, 860, 916, 917, 918, 947, 969]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 1187 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 987/1017 places, 2081/2081 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 987 transition count 2059
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 965 transition count 2059
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 44 place count 965 transition count 2051
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 60 place count 957 transition count 2051
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 63 place count 956 transition count 2049
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 954 transition count 2049
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 70 place count 949 transition count 2044
Iterating global reduction 4 with 5 rules applied. Total rules applied 75 place count 949 transition count 2044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 949 transition count 2043
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 79 place count 946 transition count 2040
Iterating global reduction 5 with 3 rules applied. Total rules applied 82 place count 946 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 83 place count 945 transition count 2039
Iterating global reduction 5 with 1 rules applied. Total rules applied 84 place count 945 transition count 2039
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 4 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 152 place count 911 transition count 2005
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 154 place count 909 transition count 2002
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 909 transition count 2002
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 908 transition count 2001
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 908 transition count 2001
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 5 with 2 rules applied. Total rules applied 160 place count 907 transition count 2002
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 167 place count 907 transition count 1995
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 174 place count 900 transition count 1995
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 182 place count 900 transition count 1987
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 190 place count 892 transition count 1987
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 195 place count 892 transition count 1987
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 196 place count 892 transition count 1987
Applied a total of 196 rules in 341 ms. Remains 892 /987 variables (removed 95) and now considering 1987/2081 (removed 94) transitions.
// Phase 1: matrix 1987 rows 892 cols
[2023-03-13 17:29:32] [INFO ] Computed 99 place invariants in 67 ms
[2023-03-13 17:29:33] [INFO ] Implicit Places using invariants in 1118 ms returned [107, 199, 200, 271, 277, 375, 376, 792]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1137 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 884/1017 places, 1987/2081 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 882 transition count 1985
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 882 transition count 1985
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 881 transition count 1984
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 881 transition count 1984
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 879 transition count 1982
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 879 transition count 1979
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 876 transition count 1979
Applied a total of 16 rules in 179 ms. Remains 876 /884 variables (removed 8) and now considering 1979/1987 (removed 8) transitions.
// Phase 1: matrix 1979 rows 876 cols
[2023-03-13 17:29:33] [INFO ] Computed 91 place invariants in 37 ms
[2023-03-13 17:29:34] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2023-03-13 17:29:34] [INFO ] Invariant cache hit.
[2023-03-13 17:29:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 17:29:37] [INFO ] Implicit Places using invariants and state equation in 3493 ms returned []
Implicit Place search using SMT with State Equation took 4554 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 876/1017 places, 1979/2081 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7445 ms. Remains : 876/1017 places, 1979/2081 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) 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 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 121737 steps, run timeout after 3009 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121737 steps, saw 33121 distinct states, run finished after 3009 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 17:29:41] [INFO ] Invariant cache hit.
[2023-03-13 17:29:41] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-13 17:29:41] [INFO ] [Real]Absence check using 19 positive and 72 generalized place invariants in 101 ms returned sat
[2023-03-13 17:29:41] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 17:29:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-13 17:29:42] [INFO ] [Nat]Absence check using 19 positive and 72 generalized place invariants in 63 ms returned sat
[2023-03-13 17:29:57] [INFO ] After 14814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 17:29:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 17:30:00] [INFO ] After 3268ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 17:30:01] [INFO ] Deduced a trap composed of 93 places in 1076 ms of which 1 ms to minimize.
[2023-03-13 17:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1262 ms
[2023-03-13 17:30:02] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 27 ms to minimize.
[2023-03-13 17:30:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2023-03-13 17:30:08] [INFO ] Deduced a trap composed of 4 places in 1182 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 17:30:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:30:08] [INFO ] After 26223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 118 ms.
Support contains 80 out of 876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 876/876 places, 1979/1979 transitions.
Applied a total of 0 rules in 35 ms. Remains 876 /876 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 876/876 places, 1979/1979 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 876/876 places, 1979/1979 transitions.
Applied a total of 0 rules in 28 ms. Remains 876 /876 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
[2023-03-13 17:30:08] [INFO ] Invariant cache hit.
[2023-03-13 17:30:09] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-13 17:30:09] [INFO ] Invariant cache hit.
[2023-03-13 17:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 17:30:13] [INFO ] Implicit Places using invariants and state equation in 4268 ms returned []
Implicit Place search using SMT with State Equation took 5033 ms to find 0 implicit places.
[2023-03-13 17:30:13] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-13 17:30:13] [INFO ] Invariant cache hit.
[2023-03-13 17:30:14] [INFO ] Dead Transitions using invariants and state equation in 975 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6276 ms. Remains : 876/876 places, 1979/1979 transitions.
Applied a total of 0 rules in 31 ms. Remains 876 /876 variables (removed 0) and now considering 1979/1979 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-13 17:30:14] [INFO ] Invariant cache hit.
[2023-03-13 17:30:14] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-13 17:30:14] [INFO ] [Real]Absence check using 19 positive and 72 generalized place invariants in 108 ms returned sat
[2023-03-13 17:30:14] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 17:30:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 129 ms returned sat
[2023-03-13 17:30:15] [INFO ] [Nat]Absence check using 19 positive and 72 generalized place invariants in 39 ms returned sat
[2023-03-13 17:30:30] [INFO ] After 15099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 17:30:35] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 1 ms to minimize.
[2023-03-13 17:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2023-03-13 17:30:35] [INFO ] After 20423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9349 ms.
[2023-03-13 17:30:45] [INFO ] After 30356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 17:30:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2023-03-13 17:30:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 876 places, 1979 transitions and 7845 arcs took 16 ms.
[2023-03-13 17:30:46] [INFO ] Flatten gal took : 292 ms
Total runtime 257433 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 09b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 876 places, 1979 transitions, 7845 arcs.
Final Score: 60310.137
Took : 104 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678728751572

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 10735:
syntax error

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-09b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ASLink-PT-09b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r011-oct2-167813599800151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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