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

About the Execution of Smart+red for ASLink-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10200.147 3600000.00 3683814.00 115.40 TFT????TFT?FF?FT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 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 920K 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-10a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678729137464

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 17:38:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:38:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:38:59] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-13 17:38:59] [INFO ] Transformed 2186 places.
[2023-03-13 17:38:59] [INFO ] Transformed 3192 transitions.
[2023-03-13 17:38:59] [INFO ] Found NUPN structural information;
[2023-03-13 17:38:59] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 38 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 13) seen :5
FORMULA ASLink-PT-10a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3158 rows 2186 cols
[2023-03-13 17:39:01] [INFO ] Computed 422 place invariants in 188 ms
[2023-03-13 17:39:02] [INFO ] After 855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 17:39:02] [INFO ] [Nat]Absence check using 105 positive place invariants in 54 ms returned sat
[2023-03-13 17:39:03] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 279 ms returned sat
[2023-03-13 17:39:27] [INFO ] After 23406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 17:39:27] [INFO ] After 23422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-13 17:39:27] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 143 ms.
Support contains 103 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 38 places
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 2129 transition count 2979
Reduce places removed 179 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 188 rules applied. Total rules applied 424 place count 1950 transition count 2970
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 433 place count 1941 transition count 2970
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 190 Pre rules applied. Total rules applied 433 place count 1941 transition count 2780
Deduced a syphon composed of 190 places in 6 ms
Ensure Unique test removed 70 places
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 883 place count 1681 transition count 2780
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 884 place count 1681 transition count 2779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 885 place count 1680 transition count 2779
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 897 place count 1668 transition count 2709
Ensure Unique test removed 1 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 910 place count 1667 transition count 2709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 911 place count 1667 transition count 2708
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 912 place count 1666 transition count 2700
Iterating global reduction 6 with 1 rules applied. Total rules applied 913 place count 1666 transition count 2700
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 914 place count 1665 transition count 2692
Iterating global reduction 6 with 1 rules applied. Total rules applied 915 place count 1665 transition count 2692
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 916 place count 1664 transition count 2684
Iterating global reduction 6 with 1 rules applied. Total rules applied 917 place count 1664 transition count 2684
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 918 place count 1663 transition count 2676
Iterating global reduction 6 with 1 rules applied. Total rules applied 919 place count 1663 transition count 2676
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 1031 place count 1607 transition count 2620
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1033 place count 1606 transition count 2623
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1036 place count 1606 transition count 2620
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1039 place count 1603 transition count 2620
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1047 place count 1603 transition count 2612
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1055 place count 1595 transition count 2612
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1068 place count 1595 transition count 2612
Applied a total of 1068 rules in 1448 ms. Remains 1595 /2186 variables (removed 591) and now considering 2612/3158 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1449 ms. Remains : 1595/2186 places, 2612/3158 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 8) seen :1
FORMULA ASLink-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2612 rows 1595 cols
[2023-03-13 17:39:29] [INFO ] Computed 294 place invariants in 28 ms
[2023-03-13 17:39:29] [INFO ] [Real]Absence check using 71 positive place invariants in 33 ms returned sat
[2023-03-13 17:39:29] [INFO ] [Real]Absence check using 71 positive and 223 generalized place invariants in 98 ms returned sat
[2023-03-13 17:39:29] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 17:39:30] [INFO ] [Nat]Absence check using 71 positive place invariants in 29 ms returned sat
[2023-03-13 17:39:30] [INFO ] [Nat]Absence check using 71 positive and 223 generalized place invariants in 138 ms returned sat
[2023-03-13 17:39:55] [INFO ] After 23997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 17:39:55] [INFO ] State equation strengthened by 54 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:39:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:39:55] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 291 ms.
Support contains 99 out of 1595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1595/1595 places, 2612/2612 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1595 transition count 2611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1594 transition count 2611
Applied a total of 2 rules in 135 ms. Remains 1594 /1595 variables (removed 1) and now considering 2611/2612 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 1594/1595 places, 2611/2612 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 79711 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{5=1}
Probabilistic random walk after 79711 steps, saw 45110 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :1
FORMULA ASLink-PT-10a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 2611 rows 1594 cols
[2023-03-13 17:39:59] [INFO ] Computed 294 place invariants in 66 ms
[2023-03-13 17:39:59] [INFO ] [Real]Absence check using 74 positive place invariants in 32 ms returned sat
[2023-03-13 17:39:59] [INFO ] [Real]Absence check using 74 positive and 220 generalized place invariants in 98 ms returned sat
[2023-03-13 17:39:59] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 17:40:00] [INFO ] [Nat]Absence check using 74 positive place invariants in 23 ms returned sat
[2023-03-13 17:40:00] [INFO ] [Nat]Absence check using 74 positive and 220 generalized place invariants in 111 ms returned sat
[2023-03-13 17:40:24] [INFO ] After 24307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 17:40:24] [INFO ] State equation strengthened by 54 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:40:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:40:24] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 160 ms.
Support contains 97 out of 1594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1594/1594 places, 2611/2611 transitions.
Applied a total of 0 rules in 86 ms. Remains 1594 /1594 variables (removed 0) and now considering 2611/2611 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1594/1594 places, 2611/2611 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 88689 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88689 steps, saw 49497 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-13 17:40:28] [INFO ] Invariant cache hit.
[2023-03-13 17:40:29] [INFO ] [Real]Absence check using 74 positive place invariants in 30 ms returned sat
[2023-03-13 17:40:29] [INFO ] [Real]Absence check using 74 positive and 220 generalized place invariants in 99 ms returned sat
[2023-03-13 17:40:29] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 17:40:29] [INFO ] [Nat]Absence check using 74 positive place invariants in 115 ms returned sat
[2023-03-13 17:40:29] [INFO ] [Nat]Absence check using 74 positive and 220 generalized place invariants in 72 ms returned sat
[2023-03-13 17:40:54] [INFO ] After 24144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 17:40:54] [INFO ] State equation strengthened by 54 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:40:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:40:54] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 136 ms.
Support contains 97 out of 1594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1594/1594 places, 2611/2611 transitions.
Applied a total of 0 rules in 73 ms. Remains 1594 /1594 variables (removed 0) and now considering 2611/2611 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1594/1594 places, 2611/2611 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1594/1594 places, 2611/2611 transitions.
Applied a total of 0 rules in 58 ms. Remains 1594 /1594 variables (removed 0) and now considering 2611/2611 (removed 0) transitions.
[2023-03-13 17:40:54] [INFO ] Invariant cache hit.
[2023-03-13 17:40:56] [INFO ] Implicit Places using invariants in 2026 ms returned [1, 20, 21, 23, 33, 51, 69, 134, 155, 168, 171, 172, 173, 191, 209, 283, 295, 308, 309, 310, 311, 312, 330, 348, 411, 431, 447, 448, 449, 450, 451, 469, 487, 539, 560, 572, 585, 588, 589, 590, 608, 626, 679, 711, 724, 728, 729, 730, 748, 829, 841, 853, 866, 867, 868, 869, 870, 888, 906, 977, 990, 1003, 1005, 1006, 1007, 1025, 1043, 1114, 1128, 1143, 1145, 1146, 1147, 1165, 1183, 1246, 1257, 1269, 1284, 1286, 1287, 1288, 1306, 1324, 1387, 1407, 1412, 1423, 1424, 1425, 1426, 1427, 1457, 1459, 1462, 1480, 1481, 1482, 1483, 1495, 1501, 1507, 1513, 1519, 1525, 1531, 1537, 1543, 1549, 1555, 1593]
Discarding 111 places :
Implicit Place search using SMT only with invariants took 2033 ms to find 111 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1483/1594 places, 2611/2611 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 1483 transition count 2480
Reduce places removed 131 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 1 with 159 rules applied. Total rules applied 290 place count 1352 transition count 2452
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 318 place count 1324 transition count 2452
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 318 place count 1324 transition count 2400
Deduced a syphon composed of 52 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 105 rules applied. Total rules applied 423 place count 1271 transition count 2400
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 16 rules applied. Total rules applied 439 place count 1259 transition count 2396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 443 place count 1255 transition count 2396
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 454 place count 1244 transition count 2385
Iterating global reduction 5 with 11 rules applied. Total rules applied 465 place count 1244 transition count 2385
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 468 place count 1241 transition count 2382
Iterating global reduction 5 with 3 rules applied. Total rules applied 471 place count 1241 transition count 2382
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 5 with 178 rules applied. Total rules applied 649 place count 1152 transition count 2293
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 652 place count 1149 transition count 2290
Iterating global reduction 5 with 3 rules applied. Total rules applied 655 place count 1149 transition count 2290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 657 place count 1149 transition count 2288
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 662 place count 1149 transition count 2283
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 672 place count 1149 transition count 2273
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 684 place count 1139 transition count 2271
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 685 place count 1139 transition count 2270
Free-agglomeration rule (complex) applied 50 times.
Iterating global reduction 7 with 50 rules applied. Total rules applied 735 place count 1139 transition count 2220
Ensure Unique test removed 5 places
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 7 with 55 rules applied. Total rules applied 790 place count 1084 transition count 2220
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 792 place count 1082 transition count 2218
Iterating global reduction 8 with 2 rules applied. Total rules applied 794 place count 1082 transition count 2218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 796 place count 1082 transition count 2216
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 799 place count 1082 transition count 2213
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 800 place count 1082 transition count 2212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 801 place count 1081 transition count 2212
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 822 place count 1081 transition count 2212
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 827 place count 1081 transition count 2212
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 828 place count 1081 transition count 2211
Applied a total of 828 rules in 887 ms. Remains 1081 /1483 variables (removed 402) and now considering 2211/2611 (removed 400) transitions.
// Phase 1: matrix 2211 rows 1081 cols
[2023-03-13 17:40:57] [INFO ] Computed 165 place invariants in 46 ms
[2023-03-13 17:40:58] [INFO ] Implicit Places using invariants in 914 ms returned [94, 105, 107, 111, 119, 120, 192, 198, 210, 211, 216, 217, 269, 287, 298, 300, 301, 306, 307, 384, 396, 403, 404, 487, 492, 495, 502, 503, 559, 577, 590, 600, 605, 606, 677, 683, 686, 694, 704, 776, 782, 798, 880, 893, 900, 908, 909, 962, 980, 992, 994, 995, 1078]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 917 ms to find 53 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1028/1594 places, 2211/2611 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 1028 transition count 2210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1027 transition count 2210
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 17 place count 1012 transition count 2195
Iterating global reduction 2 with 15 rules applied. Total rules applied 32 place count 1012 transition count 2195
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 1008 transition count 2191
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 1008 transition count 2191
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 64 place count 996 transition count 2179
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 996 transition count 2176
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 83 place count 996 transition count 2160
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 99 place count 980 transition count 2160
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 980 transition count 2158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 978 transition count 2158
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 978 transition count 2158
Applied a total of 104 rules in 301 ms. Remains 978 /1028 variables (removed 50) and now considering 2158/2211 (removed 53) transitions.
// Phase 1: matrix 2158 rows 978 cols
[2023-03-13 17:40:58] [INFO ] Computed 112 place invariants in 27 ms
[2023-03-13 17:40:59] [INFO ] Implicit Places using invariants in 721 ms returned []
[2023-03-13 17:40:59] [INFO ] Invariant cache hit.
[2023-03-13 17:41:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 17:41:02] [INFO ] Implicit Places using invariants and state equation in 3371 ms returned []
Implicit Place search using SMT with State Equation took 4095 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 978/1594 places, 2158/2611 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8292 ms. Remains : 978/1594 places, 2158/2611 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 168558 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168558 steps, saw 62132 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-13 17:41:06] [INFO ] Invariant cache hit.
[2023-03-13 17:41:06] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-13 17:41:06] [INFO ] [Real]Absence check using 27 positive and 85 generalized place invariants in 66 ms returned sat
[2023-03-13 17:41:06] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 17:41:07] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2023-03-13 17:41:07] [INFO ] [Nat]Absence check using 27 positive and 85 generalized place invariants in 51 ms returned sat
[2023-03-13 17:41:31] [INFO ] After 24468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 17:41:31] [INFO ] State equation strengthened by 20 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:41:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:41:31] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 481 ms.
Support contains 97 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 2158/2158 transitions.
Applied a total of 0 rules in 27 ms. Remains 978 /978 variables (removed 0) and now considering 2158/2158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 978/978 places, 2158/2158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 2158/2158 transitions.
Applied a total of 0 rules in 27 ms. Remains 978 /978 variables (removed 0) and now considering 2158/2158 (removed 0) transitions.
[2023-03-13 17:41:32] [INFO ] Invariant cache hit.
[2023-03-13 17:41:32] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-13 17:41:32] [INFO ] Invariant cache hit.
[2023-03-13 17:41:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 17:41:35] [INFO ] Implicit Places using invariants and state equation in 3053 ms returned []
Implicit Place search using SMT with State Equation took 3641 ms to find 0 implicit places.
[2023-03-13 17:41:36] [INFO ] Redundant transitions in 183 ms returned []
[2023-03-13 17:41:36] [INFO ] Invariant cache hit.
[2023-03-13 17:41:36] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4782 ms. Remains : 978/978 places, 2158/2158 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 978 transition count 2152
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 972 transition count 2152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 972 transition count 2151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 971 transition count 2151
Applied a total of 14 rules in 87 ms. Remains 971 /978 variables (removed 7) and now considering 2151/2158 (removed 7) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2151 rows 971 cols
[2023-03-13 17:41:37] [INFO ] Computed 112 place invariants in 38 ms
[2023-03-13 17:41:37] [INFO ] [Real]Absence check using 24 positive place invariants in 9 ms returned sat
[2023-03-13 17:41:37] [INFO ] [Real]Absence check using 24 positive and 88 generalized place invariants in 44 ms returned sat
[2023-03-13 17:41:37] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 17:41:37] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2023-03-13 17:41:38] [INFO ] [Nat]Absence check using 24 positive and 88 generalized place invariants in 75 ms returned sat
[2023-03-13 17:42:03] [INFO ] After 24992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 17:42:27] [INFO ] After 49031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9256 ms.
[2023-03-13 17:42:36] [INFO ] After 59004ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 17:42:36] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-13 17:42:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 978 places, 2158 transitions and 8650 arcs took 19 ms.
[2023-03-13 17:42:37] [INFO ] Flatten gal took : 203 ms
Total runtime 217348 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 10a
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 978 places, 2158 transitions, 8650 arcs.
Final Score: 140003.453
Took : 106 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-10a-ReachabilityCardinality-03 (reachable & potential(( ( (tk(P253)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P253)) ) )))
PROPERTY: ASLink-PT-10a-ReachabilityCardinality-04 (reachable &!potential( ( ( (tk(P12)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P12)) ) )))
PROPERTY: ASLink-PT-10a-ReachabilityCardinality-05 (reachable &!potential( ( ( ( (tk(P350)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P350)) ) ) | ( ( (tk(P454)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P454)) ) ) )))
PROPERTY: ASLink-PT-10a-ReachabilityCardinality-06 (reachable & potential(( ( ( ( (tk(P816)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P816)) ) ) & ( ( (tk(P592)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P592)) ) ) ) & ( ( ( ( (tk(P539)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P539)) ) ) | ( ( (tk(P800)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P800)) ) ) ) & ( ( ( (tk(P403)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P403)) ) ) | ( ( ( ( ( (tk(P364)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P364)) ) ) & ( ( (tk(P456)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P456)) ) ) ) & ( ( ( (tk(P527)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P527)) ) ) & ( ( ( (tk(P268)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P268)) ) ) & ( ( (tk(P616)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P616)) ) ) ) ) ) & ( ( ( ( (tk(P877)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P877)) ) ) & ( ( ( (tk(P706)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P706)) ) ) & ( ( (tk(P4)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P4)) ) ) ) ) & ( ( ( (tk(P422)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P422)) ) ) & ( ( ( (tk(P631)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P631)) ) ) & ( ( ( (tk(P712)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P712)) ) ) | ( ( (tk(P154)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P154)) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-10a-ReachabilityCardinality-10 (reachable &!potential( ( ( ( ( (tk(P972)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P972)) ) ) | ( ( ( (tk(P91)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P91)) ) ) | ( ( (tk(P209)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P209)) ) ) ) ) | ( ( ( ( (tk(P17)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P17)) ) ) | ( ( ( (tk(P530)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P530)) ) ) & ( ( (tk(P540)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P540)) ) ) ) ) | ( ( ( ( (tk(P818)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P818)) ) ) & ( ( ( (tk(P181)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P181)) ) ) & ( ( ( (tk(P889)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P889)) ) ) | ( ( (tk(P607)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P607)) ) ) ) ) ) | ( ( ( ( ( (tk(P321)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P321)) ) ) & ( ( (tk(P604)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P604)) ) ) ) & ( ( ( (tk(P774)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P774)) ) ) & ( ( ( (tk(P490)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P490)) ) ) | ( ( (tk(P65)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P65)) ) ) ) ) ) & ( ( ( ( ( (tk(P688)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P688)) ) ) | ( ( (tk(P410)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P410)) ) ) ) & ( ( ( (tk(P543)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P543)) ) ) | ( ( (tk(P746)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P746)) ) ) ) ) & ( ( ( ( ( (tk(P190)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P190)) ) ) | ( ( (tk(P178)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P178)) ) ) ) | ( ( ( (tk(P133)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P133)) ) ) | ( ( (tk(P911)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P911)) ) ) ) ) & ( ( ( (tk(P205)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P205)) ) ) | ( ( (tk(P976)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P976)) ) ) ) ) ) ) ) ) )))
PROPERTY: ASLink-PT-10a-ReachabilityCardinality-13 (reachable & potential(( ( ( (tk(P383)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P383)) ) ) & ( ( ( ( ( (tk(P563)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P563)) ) ) & ( ( ( (tk(P797)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P797)) ) ) & ( ( ( ( (tk(P22)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P22)) ) ) | ( ( (tk(P721)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P721)) ) ) ) | ( ( ( (tk(P419)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P419)) ) ) | ( ( ( (tk(P624)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P624)) ) ) & ( ( (tk(P964)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P964)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P446)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P446)) ) ) | ( ( ( (tk(P191)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P191)) ) ) & ( ( (tk(P184)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P184)) ) ) ) ) & ( ( ( ( (tk(P968)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P968)) ) ) | ( ( (tk(P3)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P3)) ) ) ) | ( ( ( (tk(P789)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P789)) ) ) | ( ( ( (tk(P541)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P541)) ) ) | ( ( ( (tk(P215)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P215)) ) ) & ( ( (tk(P254)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P254)) ) ) ) ) ) ) ) ) & ( ( ( ( ( (tk(P100)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P100)) ) ) & ( ( (tk(P407)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P407)) ) ) ) & ( ( ( (tk(P894)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P894)) ) ) & ( ( ( (tk(P431)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P431)) ) ) & ( ( ( (tk(P806)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P806)) ) ) | ( ( (tk(P957)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P957)) ) ) ) ) ) ) | ( ( ( ( (tk(P506)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P506)) ) ) & ( ( ( (tk(P322)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P322)) ) ) & ( ( ( (tk(P499)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P499)) ) ) | ( ( ( (tk(P453)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P453)) ) ) & ( ( (tk(P978)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P978)) ) ) ) ) ) ) | ( ( ( ( (tk(P356)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P356)) ) ) | ( ( ( ( (tk(P103)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P103)) ) ) | ( ( ( (tk(P417)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P417)) ) ) & ( ( (tk(P536)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P536)) ) ) ) ) & ( ( ( ( (tk(P440)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P440)) ) ) | ( ( (tk(P19)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P19)) ) ) ) | ( ( ( (tk(P74)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P74)) ) ) | ( ( ( (tk(P812)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P812)) ) ) | ( ( ( (tk(P532)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P532)) ) ) & ( ( ( (tk(P750)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P750)) ) ) | ( ( (tk(P720)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P720)) ) ) ) ) ) ) ) ) ) & ( ( ( ( ( (tk(P111)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P111)) ) ) & ( ( ( (tk(P452)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P452)) ) ) & ( ( (tk(P622)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P622)) ) ) ) ) & ( ( ( (tk(P649)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P649)) ) ) & ( ( ( (tk(P525)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P525)) ) ) & ( ( (tk(P36)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P36)) ) ) ) ) ) | ( ( ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) & ( ( ( (tk(P92)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P92)) ) ) | ( ( ( (tk(P272)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P272)) ) ) | ( ( (tk(P344)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P344)) ) ) ) ) ) | ( ( ( (tk(P104)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P104)) ) ) & ( ( (tk(P713)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P713)) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5949632 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16104148 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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

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

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