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

About the Execution of ITS-Tools for ShieldIIPt-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16218.044 3600000.00 6789190.00 304105.30 TT??TTFT?FF?F?T? 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.r389-oct2-167903713400335.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 itstools
Input is ShieldIIPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 860K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679190792629

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 01:53:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 01:53:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:53:14] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-03-19 01:53:15] [INFO ] Transformed 3503 places.
[2023-03-19 01:53:15] [INFO ] Transformed 3253 transitions.
[2023-03-19 01:53:15] [INFO ] Found NUPN structural information;
[2023-03-19 01:53:15] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 01:53:15] [INFO ] Flatten gal took : 208 ms
[2023-03-19 01:53:15] [INFO ] Flatten gal took : 183 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 16) seen :3
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
[2023-03-19 01:53:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17332246839792170246.gal : 81 ms
[2023-03-19 01:53:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3264520431332840183.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17332246839792170246.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3264520431332840183.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Loading property file /tmp/ReachabilityCardinality3264520431332840183.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2023-03-19 01:53:16] [INFO ] Computed 451 place invariants in 33 ms
[2023-03-19 01:53:18] [INFO ] [Real]Absence check using 451 positive place invariants in 311 ms returned sat
[2023-03-19 01:53:20] [INFO ] After 3916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 01:53:22] [INFO ] [Nat]Absence check using 451 positive place invariants in 378 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
Invariant property ShieldIIPt-PT-050B-ReachabilityFireability-10 does not hold.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :10 after 19
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :19 after 28
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :28 after 45
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :45 after 79
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :79 after 739
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :739 after 35077
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :35077 after 5.78704e+08
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :5.78704e+08 after 1.93005e+20
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1.93005e+20 after 8.37817e+38
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :8.37817e+38 after 6.69069e+78
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-14 is true.
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2023-03-19 01:53:34] [INFO ] After 11361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-19 01:53:35] [INFO ] Deduced a trap composed of 38 places in 1396 ms of which 8 ms to minimize.
[2023-03-19 01:53:37] [INFO ] Deduced a trap composed of 30 places in 1180 ms of which 4 ms to minimize.
[2023-03-19 01:53:38] [INFO ] Deduced a trap composed of 27 places in 1162 ms of which 4 ms to minimize.
[2023-03-19 01:53:39] [INFO ] Deduced a trap composed of 17 places in 949 ms of which 3 ms to minimize.
[2023-03-19 01:53:40] [INFO ] Deduced a trap composed of 36 places in 1079 ms of which 3 ms to minimize.
[2023-03-19 01:53:42] [INFO ] Deduced a trap composed of 38 places in 1142 ms of which 2 ms to minimize.
[2023-03-19 01:53:43] [INFO ] Deduced a trap composed of 48 places in 1132 ms of which 16 ms to minimize.
[2023-03-19 01:53:44] [INFO ] Deduced a trap composed of 42 places in 968 ms of which 2 ms to minimize.
[2023-03-19 01:53:45] [INFO ] Deduced a trap composed of 32 places in 1122 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:53:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:53:45] [INFO ] After 25322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 1246 ms.
Support contains 117 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 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 3503 transition count 2489
Reduce places removed 764 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 766 rules applied. Total rules applied 1530 place count 2739 transition count 2487
Reduce places removed 1 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 45 rules applied. Total rules applied 1575 place count 2738 transition count 2443
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1619 place count 2694 transition count 2443
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 206 Pre rules applied. Total rules applied 1619 place count 2694 transition count 2237
Deduced a syphon composed of 206 places in 6 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 2031 place count 2488 transition count 2237
Discarding 317 places :
Symmetric choice reduction at 4 with 317 rule applications. Total rules 2348 place count 2171 transition count 1920
Iterating global reduction 4 with 317 rules applied. Total rules applied 2665 place count 2171 transition count 1920
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 126 Pre rules applied. Total rules applied 2665 place count 2171 transition count 1794
Deduced a syphon composed of 126 places in 13 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 4 with 252 rules applied. Total rules applied 2917 place count 2045 transition count 1794
Performed 801 Post agglomeration using F-continuation condition.Transition count delta: 801
Deduced a syphon composed of 801 places in 2 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 4 with 1602 rules applied. Total rules applied 4519 place count 1244 transition count 993
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4721 place count 1143 transition count 1044
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 4769 place count 1119 transition count 1058
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4770 place count 1119 transition count 1057
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 4775 place count 1119 transition count 1052
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 4780 place count 1114 transition count 1052
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 4826 place count 1114 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4827 place count 1113 transition count 1051
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4829 place count 1111 transition count 1051
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4829 place count 1111 transition count 1050
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4831 place count 1110 transition count 1050
Applied a total of 4831 rules in 1054 ms. Remains 1110 /3503 variables (removed 2393) and now considering 1050/3253 (removed 2203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1055 ms. Remains : 1110/3503 places, 1050/3253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 12) seen :1
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 80401 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80401 steps, saw 68147 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1050 rows 1110 cols
[2023-03-19 01:53:52] [INFO ] Computed 449 place invariants in 5 ms
[2023-03-19 01:53:53] [INFO ] [Real]Absence check using 449 positive place invariants in 200 ms returned sat
[2023-03-19 01:53:53] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 01:53:53] [INFO ] [Nat]Absence check using 449 positive place invariants in 140 ms returned sat
[2023-03-19 01:53:56] [INFO ] After 2042ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 01:53:56] [INFO ] State equation strengthened by 336 read => feed constraints.
[2023-03-19 01:53:58] [INFO ] After 2253ms SMT Verify possible using 336 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 01:53:58] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2023-03-19 01:53:59] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2023-03-19 01:53:59] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2023-03-19 01:53:59] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2023-03-19 01:53:59] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2023-03-19 01:53:59] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2023-03-19 01:53:59] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-19 01:54:00] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-19 01:54:00] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-19 01:54:00] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2023-03-19 01:54:00] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-19 01:54:00] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 0 ms to minimize.
[2023-03-19 01:54:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2469 ms
[2023-03-19 01:54:05] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-19 01:54:05] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-19 01:54:05] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 1 ms to minimize.
[2023-03-19 01:54:06] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-19 01:54:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1693 ms
[2023-03-19 01:54:07] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-19 01:54:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-19 01:54:08] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 17 ms to minimize.
[2023-03-19 01:54:08] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2023-03-19 01:54:08] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2023-03-19 01:54:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 598 ms
[2023-03-19 01:54:09] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2023-03-19 01:54:09] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
[2023-03-19 01:54:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 583 ms
[2023-03-19 01:54:09] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-19 01:54:10] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 0 ms to minimize.
[2023-03-19 01:54:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 666 ms
[2023-03-19 01:54:10] [INFO ] After 14095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3355 ms.
[2023-03-19 01:54:13] [INFO ] After 20294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 528 ms.
Support contains 115 out of 1110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1110/1110 places, 1050/1050 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1110 transition count 1049
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1109 transition count 1049
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 1107 transition count 1047
Applied a total of 6 rules in 117 ms. Remains 1107 /1110 variables (removed 3) and now considering 1047/1050 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1107/1110 places, 1047/1050 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 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 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 85826 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85826 steps, saw 70141 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1047 rows 1107 cols
[2023-03-19 01:54:18] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-19 01:54:18] [INFO ] [Real]Absence check using 449 positive place invariants in 111 ms returned sat
[2023-03-19 01:54:18] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 01:54:19] [INFO ] [Nat]Absence check using 449 positive place invariants in 114 ms returned sat
[2023-03-19 01:54:21] [INFO ] After 1599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 01:54:21] [INFO ] State equation strengthened by 336 read => feed constraints.
[2023-03-19 01:54:23] [INFO ] After 2191ms SMT Verify possible using 336 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 01:54:23] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-19 01:54:24] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2023-03-19 01:54:24] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-19 01:54:24] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2023-03-19 01:54:24] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-19 01:54:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1044 ms
[2023-03-19 01:54:27] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 39 ms to minimize.
[2023-03-19 01:54:27] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2023-03-19 01:54:27] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2023-03-19 01:54:27] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2023-03-19 01:54:28] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 1 ms to minimize.
[2023-03-19 01:54:28] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-19 01:54:28] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2023-03-19 01:54:28] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 0 ms to minimize.
[2023-03-19 01:54:29] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2023-03-19 01:54:29] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2023-03-19 01:54:29] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2023-03-19 01:54:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2831 ms
[2023-03-19 01:54:30] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 14 ms to minimize.
[2023-03-19 01:54:30] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-19 01:54:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2023-03-19 01:54:31] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-19 01:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-19 01:54:32] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-19 01:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-19 01:54:32] [INFO ] After 10833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2905 ms.
[2023-03-19 01:54:35] [INFO ] After 16227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 986 ms.
Support contains 115 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 1047/1047 transitions.
Applied a total of 0 rules in 29 ms. Remains 1107 /1107 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1107/1107 places, 1047/1047 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 1047/1047 transitions.
Applied a total of 0 rules in 33 ms. Remains 1107 /1107 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
[2023-03-19 01:54:36] [INFO ] Invariant cache hit.
[2023-03-19 01:54:36] [INFO ] Implicit Places using invariants in 515 ms returned [1095]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 521 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1106/1107 places, 1047/1047 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1105 transition count 1046
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1105 transition count 1046
Applied a total of 2 rules in 42 ms. Remains 1105 /1106 variables (removed 1) and now considering 1046/1047 (removed 1) transitions.
// Phase 1: matrix 1046 rows 1105 cols
[2023-03-19 01:54:36] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-19 01:54:37] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-19 01:54:37] [INFO ] Invariant cache hit.
[2023-03-19 01:54:38] [INFO ] State equation strengthened by 335 read => feed constraints.
[2023-03-19 01:54:42] [INFO ] Implicit Places using invariants and state equation in 5068 ms returned []
Implicit Place search using SMT with State Equation took 5576 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1105/1107 places, 1046/1047 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6173 ms. Remains : 1105/1107 places, 1046/1047 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 81289 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81289 steps, saw 62837 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-19 01:54:46] [INFO ] Invariant cache hit.
[2023-03-19 01:54:47] [INFO ] [Real]Absence check using 448 positive place invariants in 161 ms returned sat
[2023-03-19 01:54:47] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 01:54:47] [INFO ] [Nat]Absence check using 448 positive place invariants in 237 ms returned sat
[2023-03-19 01:54:50] [INFO ] After 1894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 01:54:50] [INFO ] State equation strengthened by 335 read => feed constraints.
[2023-03-19 01:54:52] [INFO ] After 2218ms SMT Verify possible using 335 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 01:54:52] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2023-03-19 01:54:52] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-19 01:54:52] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-19 01:54:53] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2023-03-19 01:54:53] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-19 01:54:53] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2023-03-19 01:54:53] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2023-03-19 01:54:53] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2023-03-19 01:54:53] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 14 ms to minimize.
[2023-03-19 01:54:53] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2023-03-19 01:54:54] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-19 01:54:54] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-19 01:54:54] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2023-03-19 01:54:54] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 2 ms to minimize.
[2023-03-19 01:54:54] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 14 ms to minimize.
[2023-03-19 01:54:55] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-19 01:54:55] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2023-03-19 01:54:55] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2925 ms
[2023-03-19 01:54:56] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-19 01:54:56] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2023-03-19 01:54:56] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2023-03-19 01:54:57] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2023-03-19 01:54:57] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-19 01:54:57] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-19 01:54:57] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-19 01:54:58] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2023-03-19 01:54:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1988 ms
[2023-03-19 01:54:58] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-19 01:54:58] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-19 01:54:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 416 ms
[2023-03-19 01:55:00] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-19 01:55:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-19 01:55:00] [INFO ] After 10444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3162 ms.
[2023-03-19 01:55:03] [INFO ] After 16521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 517 ms.
Support contains 115 out of 1105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1105/1105 places, 1046/1046 transitions.
Applied a total of 0 rules in 23 ms. Remains 1105 /1105 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 1105/1105 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1105/1105 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1105 /1105 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-19 01:55:04] [INFO ] Invariant cache hit.
[2023-03-19 01:55:04] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-03-19 01:55:04] [INFO ] Invariant cache hit.
[2023-03-19 01:55:05] [INFO ] State equation strengthened by 335 read => feed constraints.
[2023-03-19 01:55:09] [INFO ] Implicit Places using invariants and state equation in 4630 ms returned []
Implicit Place search using SMT with State Equation took 5276 ms to find 0 implicit places.
[2023-03-19 01:55:09] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-19 01:55:09] [INFO ] Invariant cache hit.
[2023-03-19 01:55:10] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6044 ms. Remains : 1105/1105 places, 1046/1046 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1105 transition count 1045
Partial Free-agglomeration rule applied 176 times.
Drop transitions removed 176 transitions
Iterating global reduction 0 with 176 rules applied. Total rules applied 177 place count 1105 transition count 1045
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 1105 transition count 1044
Applied a total of 178 rules in 148 ms. Remains 1105 /1105 variables (removed 0) and now considering 1044/1046 (removed 2) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1044 rows 1105 cols
[2023-03-19 01:55:10] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-19 01:55:10] [INFO ] [Real]Absence check using 448 positive place invariants in 69 ms returned sat
[2023-03-19 01:55:10] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 01:55:11] [INFO ] [Nat]Absence check using 448 positive place invariants in 72 ms returned sat
[2023-03-19 01:55:13] [INFO ] After 1757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 01:55:13] [INFO ] State equation strengthened by 165 read => feed constraints.
[2023-03-19 01:55:15] [INFO ] After 1977ms SMT Verify possible using 165 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 01:55:15] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-19 01:55:15] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-19 01:55:15] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-19 01:55:15] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-19 01:55:16] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2023-03-19 01:55:16] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-19 01:55:16] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2023-03-19 01:55:16] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2023-03-19 01:55:16] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2023-03-19 01:55:16] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-19 01:55:16] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-19 01:55:16] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 0 ms to minimize.
[2023-03-19 01:55:17] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-19 01:55:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1760 ms
[2023-03-19 01:55:18] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-19 01:55:18] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-19 01:55:18] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2023-03-19 01:55:18] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-19 01:55:18] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-03-19 01:55:18] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2023-03-19 01:55:18] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2023-03-19 01:55:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-19 01:55:19] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-19 01:55:19] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2023-03-19 01:55:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1614 ms
[2023-03-19 01:55:20] [INFO ] After 7491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2161 ms.
[2023-03-19 01:55:23] [INFO ] After 12132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-19 01:55:23] [INFO ] Flatten gal took : 90 ms
[2023-03-19 01:55:23] [INFO ] Flatten gal took : 53 ms
[2023-03-19 01:55:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1608841637718401378.gal : 8 ms
[2023-03-19 01:55:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6934150274897927324.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1608841637718401378.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6934150274897927324.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6934150274897927324.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :22 after 76
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :76 after 6916
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :6916 after 207364
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :207364 after 4.62829e+09
Detected timeout of ITS tools.
[2023-03-19 01:55:38] [INFO ] Flatten gal took : 47 ms
[2023-03-19 01:55:38] [INFO ] Applying decomposition
[2023-03-19 01:55:38] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph827546778573762635.txt' '-o' '/tmp/graph827546778573762635.bin' '-w' '/tmp/graph827546778573762635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph827546778573762635.bin' '-l' '-1' '-v' '-w' '/tmp/graph827546778573762635.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:55:38] [INFO ] Decomposing Gal with order
[2023-03-19 01:55:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:55:38] [INFO ] Removed a total of 573 redundant transitions.
[2023-03-19 01:55:39] [INFO ] Flatten gal took : 172 ms
[2023-03-19 01:55:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 42 ms.
[2023-03-19 01:55:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4193455726343179622.gal : 17 ms
[2023-03-19 01:55:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4161793048310255054.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4193455726343179622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4161793048310255054.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4161793048310255054.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 409
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :409 after 78169
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :78169 after 700249
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :700249 after 2.56649e+06
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :2.56649e+06 after 6.71848e+08
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :6.71848e+08 after 2.24935e+13
Invariant property ShieldIIPt-PT-050B-ReachabilityFireability-12 does not hold.
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-07 is true.
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-05 is true.
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-01 is true.
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-00 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.44465e+19 after 4.05157e+68
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6664532919926677573
[2023-03-19 01:55:54] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6664532919926677573
Running compilation step : cd /tmp/ltsmin6664532919926677573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2185 ms.
Running link step : cd /tmp/ltsmin6664532919926677573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6664532919926677573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldIIPtPT050BReachabilityFireability02==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 01:56:09] [INFO ] Flatten gal took : 113 ms
[2023-03-19 01:56:09] [INFO ] Applying decomposition
[2023-03-19 01:56:09] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1953640542939206390.txt' '-o' '/tmp/graph1953640542939206390.bin' '-w' '/tmp/graph1953640542939206390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1953640542939206390.bin' '-l' '-1' '-v' '-w' '/tmp/graph1953640542939206390.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:56:09] [INFO ] Decomposing Gal with order
[2023-03-19 01:56:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:56:10] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 01:56:10] [INFO ] Flatten gal took : 187 ms
[2023-03-19 01:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-19 01:56:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10191551282590778132.gal : 28 ms
[2023-03-19 01:56:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16098373725216110704.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10191551282590778132.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16098373725216110704.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16098373725216110704.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 3414
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :3414 after 4.10989e+18
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :4.10989e+18 after 3.88297e+148
Invariant property ShieldIIPt-PT-050B-ReachabilityFireability-12 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-07 is true.
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-05 is true.
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-00 is true.
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :3.88297e+148 after 7.27681e+161
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :7.27681e+161 after 7.27681e+161
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-01 is true.
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :7.27681e+161 after 3.0734e+164
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 02:26:24] [INFO ] Flatten gal took : 1011 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17821874333317691582
[2023-03-19 02:26:24] [INFO ] Computing symmetric may disable matrix : 1046 transitions.
[2023-03-19 02:26:24] [INFO ] Computation of Complete disable matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:26:24] [INFO ] Computing symmetric may enable matrix : 1046 transitions.
[2023-03-19 02:26:24] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:26:24] [INFO ] Applying decomposition
[2023-03-19 02:26:25] [INFO ] Flatten gal took : 332 ms
[2023-03-19 02:26:26] [INFO ] Computing Do-Not-Accords matrix : 1046 transitions.
[2023-03-19 02:26:26] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:26:26] [INFO ] Built C files in 2299ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17821874333317691582
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16885765342907978644.txt' '-o' '/tmp/graph16885765342907978644.bin' '-w' '/tmp/graph16885765342907978644.weights'
Running compilation step : cd /tmp/ltsmin17821874333317691582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16885765342907978644.bin' '-l' '-1' '-v' '-w' '/tmp/graph16885765342907978644.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:26:27] [INFO ] Decomposing Gal with order
[2023-03-19 02:26:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:26:27] [INFO ] Removed a total of 737 redundant transitions.
[2023-03-19 02:26:27] [INFO ] Flatten gal took : 104 ms
[2023-03-19 02:26:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 20 ms.
[2023-03-19 02:26:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3194479960406177186.gal : 10 ms
[2023-03-19 02:26:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12974666601398042370.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3194479960406177186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12974666601398042370.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability12974666601398042370.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :25 after 41485
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :41485 after 1.493e+07
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.69384e+19 after 2.30264e+59
Compilation finished in 3559 ms.
Running link step : cd /tmp/ltsmin17821874333317691582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin17821874333317691582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPtPT050BReachabilityFireability02==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.199: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.242: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.243: Initializing POR dependencies: labels 1057, guards 1046
pins2lts-mc-linux64( 6/ 8), 0.260: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.299: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.360: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.370: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.377: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.405: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 31.885: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 32.232: "ShieldIIPtPT050BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 32.231: "ShieldIIPtPT050BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 32.231: "ShieldIIPtPT050BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 32.231: "ShieldIIPtPT050BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 32.232: "ShieldIIPtPT050BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 32.233: "ShieldIIPtPT050BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 32.233: There are 1057 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 32.233: State length is 1105, there are 1046 groups
pins2lts-mc-linux64( 0/ 8), 32.233: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 32.233: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 32.233: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 32.233: Visible groups: 0 / 1046, labels: 1 / 1057
pins2lts-mc-linux64( 0/ 8), 32.233: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 32.233: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 32.234: "ShieldIIPtPT050BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 32.233: "ShieldIIPtPT050BReachabilityFireability02==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 32.352: ~74 levels ~960 states ~1536 transitions
pins2lts-mc-linux64( 0/ 8), 32.496: ~76 levels ~1920 states ~4832 transitions
pins2lts-mc-linux64( 6/ 8), 32.663: ~7 levels ~3840 states ~11360 transitions
pins2lts-mc-linux64( 6/ 8), 33.018: ~8 levels ~7680 states ~25264 transitions
pins2lts-mc-linux64( 6/ 8), 33.689: ~9 levels ~15360 states ~54488 transitions
pins2lts-mc-linux64( 6/ 8), 34.931: ~9 levels ~30720 states ~118032 transitions
pins2lts-mc-linux64( 6/ 8), 37.491: ~10 levels ~61440 states ~256424 transitions
pins2lts-mc-linux64( 6/ 8), 42.569: ~11 levels ~122880 states ~542648 transitions
pins2lts-mc-linux64( 6/ 8), 52.996: ~12 levels ~245760 states ~1201024 transitions
pins2lts-mc-linux64( 5/ 8), 73.088: ~15 levels ~491520 states ~2395096 transitions
pins2lts-mc-linux64( 5/ 8), 116.451: ~16 levels ~983040 states ~5269328 transitions
pins2lts-mc-linux64( 5/ 8), 202.706: ~17 levels ~1966080 states ~11084552 transitions
pins2lts-mc-linux64( 5/ 8), 387.393: ~18 levels ~3932160 states ~23980552 transitions
pins2lts-mc-linux64( 6/ 8), 568.593: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 568.736:
pins2lts-mc-linux64( 0/ 8), 568.736: mean standard work distribution: 9.9% (states) 13.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 568.736:
pins2lts-mc-linux64( 0/ 8), 568.736: Explored 5390807 states 37314834 transitions, fanout: 6.922
pins2lts-mc-linux64( 0/ 8), 568.736: Total exploration time 536.500 sec (536.360 sec minimum, 536.414 sec on average)
pins2lts-mc-linux64( 0/ 8), 568.736: States per second: 10048, Transitions per second: 69552
pins2lts-mc-linux64( 0/ 8), 568.736: Ignoring proviso: 3364681
pins2lts-mc-linux64( 0/ 8), 568.736:
pins2lts-mc-linux64( 0/ 8), 568.736: Queue width: 8B, total height: 5694106, memory: 43.44MB
pins2lts-mc-linux64( 0/ 8), 568.736: Tree memory: 340.6MB, 32.2 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 568.736: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 568.736: Stored 1071 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 568.736: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 568.736: Est. total memory use: 384.0MB (~1067.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17821874333317691582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPtPT050BReachabilityFireability02==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17821874333317691582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPtPT050BReachabilityFireability02==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 136356 kB
After kill :
MemTotal: 16393220 kB
MemFree: 8587948 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldIIPt-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPt-PT-050B, 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 r389-oct2-167903713400335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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