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-167903713200159.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 ShieldIIPs-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-167903713200159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 846K 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 ShieldIIPs-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679179306920

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=ShieldIIPs-PT-050B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-18 22:41:49] [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-18 22:41:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:41:49] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-03-18 22:41:49] [INFO ] Transformed 3003 places.
[2023-03-18 22:41:49] [INFO ] Transformed 2953 transitions.
[2023-03-18 22:41:49] [INFO ] Found NUPN structural information;
[2023-03-18 22:41:49] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
[2023-03-18 22:41:50] [INFO ] Flatten gal took : 261 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
[2023-03-18 22:41:50] [INFO ] Flatten gal took : 192 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2953 rows 3003 cols
[2023-03-18 22:41:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10123349522893900039.gal : 59 ms
[2023-03-18 22:41:50] [INFO ] Computed 451 place invariants in 62 ms
[2023-03-18 22:41:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4888074593580657855.prop : 2 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/ReachabilityCardinality10123349522893900039.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4888074593580657855.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 ...329
Loading property file /tmp/ReachabilityCardinality4888074593580657855.prop.
[2023-03-18 22:41:51] [INFO ] After 950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 22:41:52] [INFO ] [Nat]Absence check using 451 positive place invariants in 158 ms returned sat
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 73
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :73 after 432
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :432 after 616
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :616 after 1.18742e+08
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1.18742e+08 after 5.73678e+13
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :5.73678e+13 after 5.07018e+29
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :5.07018e+29 after 3.24054e+60
[2023-03-18 22:42:00] [INFO ] After 7794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 22:42:03] [INFO ] Deduced a trap composed of 12 places in 1443 ms of which 11 ms to minimize.
[2023-03-18 22:42:05] [INFO ] Deduced a trap composed of 23 places in 1485 ms of which 5 ms to minimize.
[2023-03-18 22:42:06] [INFO ] Deduced a trap composed of 16 places in 1241 ms of which 26 ms to minimize.
[2023-03-18 22:42:08] [INFO ] Deduced a trap composed of 21 places in 1253 ms of which 2 ms to minimize.
[2023-03-18 22:42:09] [INFO ] Deduced a trap composed of 21 places in 1182 ms of which 16 ms to minimize.
[2023-03-18 22:42:11] [INFO ] Deduced a trap composed of 19 places in 1403 ms of which 3 ms to minimize.
[2023-03-18 22:42:12] [INFO ] Deduced a trap composed of 23 places in 1216 ms of which 19 ms to minimize.
[2023-03-18 22:42:13] [INFO ] Deduced a trap composed of 24 places in 1357 ms of which 2 ms to minimize.
[2023-03-18 22:42:15] [INFO ] Deduced a trap composed of 23 places in 1200 ms of which 3 ms to minimize.
[2023-03-18 22:42:16] [INFO ] Deduced a trap composed of 29 places in 1143 ms of which 2 ms to minimize.
[2023-03-18 22:42:17] [INFO ] Deduced a trap composed of 17 places in 1198 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 22:42:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 22:42:17] [INFO ] After 26068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 600 ms.
Support contains 194 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 3003 transition count 2727
Reduce places removed 226 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 234 rules applied. Total rules applied 460 place count 2777 transition count 2719
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 468 place count 2769 transition count 2719
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 236 Pre rules applied. Total rules applied 468 place count 2769 transition count 2483
Deduced a syphon composed of 236 places in 7 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 3 with 472 rules applied. Total rules applied 940 place count 2533 transition count 2483
Discarding 315 places :
Symmetric choice reduction at 3 with 315 rule applications. Total rules 1255 place count 2218 transition count 2168
Iterating global reduction 3 with 315 rules applied. Total rules applied 1570 place count 2218 transition count 2168
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 1570 place count 2218 transition count 2063
Deduced a syphon composed of 105 places in 14 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 1780 place count 2113 transition count 2063
Performed 695 Post agglomeration using F-continuation condition.Transition count delta: 695
Deduced a syphon composed of 695 places in 5 ms
Reduce places removed 695 places and 0 transitions.
Iterating global reduction 3 with 1390 rules applied. Total rules applied 3170 place count 1418 transition count 1368
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 3 with 296 rules applied. Total rules applied 3466 place count 1418 transition count 1368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3467 place count 1417 transition count 1367
Applied a total of 3467 rules in 1195 ms. Remains 1417 /3003 variables (removed 1586) and now considering 1367/2953 (removed 1586) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1196 ms. Remains : 1417/3003 places, 1367/2953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 6) seen :2
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1367 rows 1417 cols
[2023-03-18 22:42:20] [INFO ] Computed 451 place invariants in 32 ms
[2023-03-18 22:42:20] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 22:42:21] [INFO ] [Nat]Absence check using 441 positive place invariants in 139 ms returned sat
[2023-03-18 22:42:21] [INFO ] [Nat]Absence check using 441 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-18 22:42:22] [INFO ] After 1594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 22:42:23] [INFO ] Deduced a trap composed of 10 places in 418 ms of which 1 ms to minimize.
[2023-03-18 22:42:23] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 0 ms to minimize.
[2023-03-18 22:42:24] [INFO ] Deduced a trap composed of 8 places in 318 ms of which 1 ms to minimize.
[2023-03-18 22:42:24] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 0 ms to minimize.
[2023-03-18 22:42:24] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 1 ms to minimize.
[2023-03-18 22:42:25] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 1 ms to minimize.
[2023-03-18 22:42:25] [INFO ] Deduced a trap composed of 16 places in 347 ms of which 1 ms to minimize.
[2023-03-18 22:42:25] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 1 ms to minimize.
[2023-03-18 22:42:26] [INFO ] Deduced a trap composed of 17 places in 340 ms of which 1 ms to minimize.
[2023-03-18 22:42:26] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2023-03-18 22:42:26] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 11 ms to minimize.
[2023-03-18 22:42:27] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 1 ms to minimize.
[2023-03-18 22:42:27] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 0 ms to minimize.
[2023-03-18 22:42:28] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 0 ms to minimize.
[2023-03-18 22:42:28] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 1 ms to minimize.
[2023-03-18 22:42:28] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 1 ms to minimize.
[2023-03-18 22:42:29] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 1 ms to minimize.
[2023-03-18 22:42:29] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-18 22:42:29] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-18 22:42:30] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 1 ms to minimize.
[2023-03-18 22:42:30] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2023-03-18 22:42:30] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 0 ms to minimize.
[2023-03-18 22:42:31] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 18 ms to minimize.
[2023-03-18 22:42:31] [INFO ] Deduced a trap composed of 10 places in 327 ms of which 0 ms to minimize.
[2023-03-18 22:42:31] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 1 ms to minimize.
[2023-03-18 22:42:32] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 1 ms to minimize.
[2023-03-18 22:42:32] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-18 22:42:32] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 10 ms to minimize.
[2023-03-18 22:42:33] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 14 ms to minimize.
[2023-03-18 22:42:33] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 1 ms to minimize.
[2023-03-18 22:42:33] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 0 ms to minimize.
[2023-03-18 22:42:34] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-18 22:42:34] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 1 ms to minimize.
[2023-03-18 22:42:34] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 0 ms to minimize.
[2023-03-18 22:42:35] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2023-03-18 22:42:35] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2023-03-18 22:42:35] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
[2023-03-18 22:42:36] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 19 ms to minimize.
[2023-03-18 22:42:36] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 0 ms to minimize.
[2023-03-18 22:42:36] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 10 ms to minimize.
[2023-03-18 22:42:37] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 0 ms to minimize.
[2023-03-18 22:42:37] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 0 ms to minimize.
[2023-03-18 22:42:37] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2023-03-18 22:42:37] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-18 22:42:38] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 21 ms to minimize.
[2023-03-18 22:42:38] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-18 22:42:38] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 0 ms to minimize.
[2023-03-18 22:42:38] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 1 ms to minimize.
[2023-03-18 22:42:39] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2023-03-18 22:42:39] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 0 ms to minimize.
[2023-03-18 22:42:39] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 0 ms to minimize.
[2023-03-18 22:42:39] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 0 ms to minimize.
[2023-03-18 22:42:40] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 8 ms to minimize.
[2023-03-18 22:42:40] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 2 ms to minimize.
[2023-03-18 22:42:40] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-18 22:42:41] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 14 ms to minimize.
[2023-03-18 22:42:41] [INFO ] Deduced a trap composed of 22 places in 303 ms of which 20 ms to minimize.
[2023-03-18 22:42:41] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 1 ms to minimize.
[2023-03-18 22:42:42] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 0 ms to minimize.
[2023-03-18 22:42:42] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2023-03-18 22:42:42] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 19657 ms
[2023-03-18 22:42:43] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2023-03-18 22:42:43] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 1 ms to minimize.
[2023-03-18 22:42:43] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 0 ms to minimize.
[2023-03-18 22:42:44] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-18 22:42:44] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 1 ms to minimize.
[2023-03-18 22:42:44] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2023-03-18 22:42:45] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 0 ms to minimize.
[2023-03-18 22:42:45] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 0 ms to minimize.
[2023-03-18 22:42:45] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 0 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-18 22:42:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 22:42:45] [INFO ] After 25113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 128 ms.
Support contains 134 out of 1417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1417/1417 places, 1367/1367 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1417 transition count 1365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1415 transition count 1365
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 4 place count 1415 transition count 1354
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 26 place count 1404 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 1403 transition count 1353
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 1403 transition count 1353
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 100 place count 1367 transition count 1317
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 2 with 19 rules applied. Total rules applied 119 place count 1367 transition count 1317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 1366 transition count 1316
Applied a total of 120 rules in 529 ms. Remains 1366 /1417 variables (removed 51) and now considering 1316/1367 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 529 ms. Remains : 1366/1417 places, 1316/1367 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 87948 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87948 steps, saw 78802 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1316 rows 1366 cols
[2023-03-18 22:42:50] [INFO ] Computed 451 place invariants in 22 ms
[2023-03-18 22:42:50] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 22:42:50] [INFO ] [Nat]Absence check using 435 positive place invariants in 77 ms returned sat
[2023-03-18 22:42:50] [INFO ] [Nat]Absence check using 435 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-18 22:42:51] [INFO ] After 1281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 22:42:52] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 1 ms to minimize.
[2023-03-18 22:42:52] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 0 ms to minimize.
[2023-03-18 22:42:53] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2023-03-18 22:42:53] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 1 ms to minimize.
[2023-03-18 22:42:53] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-18 22:42:53] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
[2023-03-18 22:42:54] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 0 ms to minimize.
[2023-03-18 22:42:54] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2023-03-18 22:42:55] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-18 22:42:55] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2023-03-18 22:42:55] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2023-03-18 22:42:56] [INFO ] Deduced a trap composed of 7 places in 280 ms of which 0 ms to minimize.
[2023-03-18 22:42:56] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-18 22:42:56] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 0 ms to minimize.
[2023-03-18 22:42:57] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 1 ms to minimize.
[2023-03-18 22:42:57] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2023-03-18 22:42:57] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 1 ms to minimize.
[2023-03-18 22:42:58] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2023-03-18 22:42:58] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 1 ms to minimize.
[2023-03-18 22:42:58] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 0 ms to minimize.
[2023-03-18 22:42:59] [INFO ] Deduced a trap composed of 18 places in 492 ms of which 1 ms to minimize.
[2023-03-18 22:42:59] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2023-03-18 22:42:59] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 1 ms to minimize.
[2023-03-18 22:43:00] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-18 22:43:00] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2023-03-18 22:43:00] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 1 ms to minimize.
[2023-03-18 22:43:01] [INFO ] Deduced a trap composed of 8 places in 397 ms of which 1 ms to minimize.
[2023-03-18 22:43:01] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2023-03-18 22:43:01] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2023-03-18 22:43:02] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-18 22:43:02] [INFO ] Deduced a trap composed of 10 places in 435 ms of which 1 ms to minimize.
[2023-03-18 22:43:02] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2023-03-18 22:43:03] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 1 ms to minimize.
[2023-03-18 22:43:03] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 0 ms to minimize.
[2023-03-18 22:43:03] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2023-03-18 22:43:04] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-18 22:43:04] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 12200 ms
[2023-03-18 22:43:04] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 1 ms to minimize.
[2023-03-18 22:43:05] [INFO ] Deduced a trap composed of 6 places in 455 ms of which 1 ms to minimize.
[2023-03-18 22:43:06] [INFO ] Deduced a trap composed of 5 places in 948 ms of which 1 ms to minimize.
[2023-03-18 22:43:06] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2023-03-18 22:43:07] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 1 ms to minimize.
[2023-03-18 22:43:07] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 0 ms to minimize.
[2023-03-18 22:43:08] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 14 ms to minimize.
[2023-03-18 22:43:08] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 0 ms to minimize.
[2023-03-18 22:43:09] [INFO ] Deduced a trap composed of 6 places in 645 ms of which 0 ms to minimize.
[2023-03-18 22:43:09] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-18 22:43:09] [INFO ] Deduced a trap composed of 7 places in 308 ms of which 1 ms to minimize.
[2023-03-18 22:43:10] [INFO ] Deduced a trap composed of 9 places in 684 ms of which 0 ms to minimize.
[2023-03-18 22:43:10] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 0 ms to minimize.
[2023-03-18 22:43:11] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2023-03-18 22:43:11] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2023-03-18 22:43:12] [INFO ] Deduced a trap composed of 9 places in 771 ms of which 1 ms to minimize.
[2023-03-18 22:43:12] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 1 ms to minimize.
[2023-03-18 22:43:13] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 0 ms to minimize.
[2023-03-18 22:43:13] [INFO ] Deduced a trap composed of 8 places in 335 ms of which 1 ms to minimize.
[2023-03-18 22:43:14] [INFO ] Deduced a trap composed of 6 places in 566 ms of which 1 ms to minimize.
[2023-03-18 22:43:15] [INFO ] Deduced a trap composed of 7 places in 743 ms of which 1 ms to minimize.
[2023-03-18 22:43:16] [INFO ] Deduced a trap composed of 2 places in 941 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-18 22:43:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 22:43:16] [INFO ] After 25998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 170 ms.
Support contains 134 out of 1366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1366/1366 places, 1316/1316 transitions.
Applied a total of 0 rules in 31 ms. Remains 1366 /1366 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1366/1366 places, 1316/1316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1366/1366 places, 1316/1316 transitions.
Applied a total of 0 rules in 28 ms. Remains 1366 /1366 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
[2023-03-18 22:43:16] [INFO ] Invariant cache hit.
[2023-03-18 22:43:17] [INFO ] Implicit Places using invariants in 721 ms returned []
[2023-03-18 22:43:17] [INFO ] Invariant cache hit.
[2023-03-18 22:43:19] [INFO ] Implicit Places using invariants and state equation in 2704 ms returned []
Implicit Place search using SMT with State Equation took 3432 ms to find 0 implicit places.
[2023-03-18 22:43:20] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-18 22:43:20] [INFO ] Invariant cache hit.
[2023-03-18 22:43:21] [INFO ] Dead Transitions using invariants and state equation in 1596 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5180 ms. Remains : 1366/1366 places, 1316/1316 transitions.
Applied a total of 0 rules in 32 ms. Remains 1366 /1366 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-18 22:43:21] [INFO ] Invariant cache hit.
[2023-03-18 22:43:21] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 22:43:22] [INFO ] [Nat]Absence check using 435 positive place invariants in 75 ms returned sat
[2023-03-18 22:43:22] [INFO ] [Nat]Absence check using 435 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-18 22:43:23] [INFO ] After 1399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 22:43:24] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 0 ms to minimize.
[2023-03-18 22:43:24] [INFO ] Deduced a trap composed of 8 places in 399 ms of which 0 ms to minimize.
[2023-03-18 22:43:25] [INFO ] Deduced a trap composed of 9 places in 355 ms of which 0 ms to minimize.
[2023-03-18 22:43:25] [INFO ] Deduced a trap composed of 6 places in 382 ms of which 14 ms to minimize.
[2023-03-18 22:43:26] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 1 ms to minimize.
[2023-03-18 22:43:26] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 1 ms to minimize.
[2023-03-18 22:43:27] [INFO ] Deduced a trap composed of 6 places in 619 ms of which 1 ms to minimize.
[2023-03-18 22:43:27] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 1 ms to minimize.
[2023-03-18 22:43:28] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 1 ms to minimize.
[2023-03-18 22:43:28] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2023-03-18 22:43:28] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2023-03-18 22:43:29] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 1 ms to minimize.
[2023-03-18 22:43:29] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 1 ms to minimize.
[2023-03-18 22:43:30] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2023-03-18 22:43:30] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 0 ms to minimize.
[2023-03-18 22:43:30] [INFO ] Deduced a trap composed of 9 places in 361 ms of which 0 ms to minimize.
[2023-03-18 22:43:31] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 0 ms to minimize.
[2023-03-18 22:43:31] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2023-03-18 22:43:31] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 1 ms to minimize.
[2023-03-18 22:43:32] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2023-03-18 22:43:32] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 0 ms to minimize.
[2023-03-18 22:43:32] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 1 ms to minimize.
[2023-03-18 22:43:33] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
[2023-03-18 22:43:33] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
[2023-03-18 22:43:33] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 1 ms to minimize.
[2023-03-18 22:43:34] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-18 22:43:34] [INFO ] Deduced a trap composed of 10 places in 368 ms of which 1 ms to minimize.
[2023-03-18 22:43:34] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 0 ms to minimize.
[2023-03-18 22:43:35] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 1 ms to minimize.
[2023-03-18 22:43:35] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 0 ms to minimize.
[2023-03-18 22:43:35] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 0 ms to minimize.
[2023-03-18 22:43:36] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2023-03-18 22:43:36] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2023-03-18 22:43:36] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 1 ms to minimize.
[2023-03-18 22:43:36] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 0 ms to minimize.
[2023-03-18 22:43:37] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-18 22:43:37] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-18 22:43:37] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2023-03-18 22:43:38] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 1 ms to minimize.
[2023-03-18 22:43:38] [INFO ] Deduced a trap composed of 11 places in 336 ms of which 1 ms to minimize.
[2023-03-18 22:43:39] [INFO ] Deduced a trap composed of 14 places in 507 ms of which 1 ms to minimize.
[2023-03-18 22:43:39] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 1 ms to minimize.
[2023-03-18 22:43:39] [INFO ] Deduced a trap composed of 18 places in 301 ms of which 4 ms to minimize.
[2023-03-18 22:43:40] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 16208 ms
[2023-03-18 22:43:40] [INFO ] Deduced a trap composed of 3 places in 486 ms of which 24 ms to minimize.
[2023-03-18 22:43:41] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 2 ms to minimize.
[2023-03-18 22:43:41] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-18 22:43:41] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 1 ms to minimize.
[2023-03-18 22:43:42] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
[2023-03-18 22:43:42] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-18 22:43:43] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 1 ms to minimize.
[2023-03-18 22:43:43] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2023-03-18 22:43:43] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 0 ms to minimize.
[2023-03-18 22:43:44] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
[2023-03-18 22:43:44] [INFO ] Deduced a trap composed of 8 places in 361 ms of which 1 ms to minimize.
[2023-03-18 22:43:45] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 0 ms to minimize.
[2023-03-18 22:43:45] [INFO ] Deduced a trap composed of 10 places in 393 ms of which 0 ms to minimize.
[2023-03-18 22:43:45] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 0 ms to minimize.
[2023-03-18 22:43:46] [INFO ] Deduced a trap composed of 7 places in 375 ms of which 1 ms to minimize.
[2023-03-18 22:43:46] [INFO ] Deduced a trap composed of 8 places in 468 ms of which 1 ms to minimize.
[2023-03-18 22:43:47] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2023-03-18 22:43:47] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 0 ms to minimize.
[2023-03-18 22:43:48] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 1 ms to minimize.
[2023-03-18 22:43:48] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 0 ms to minimize.
[2023-03-18 22:43:48] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 1 ms to minimize.
[2023-03-18 22:43:49] [INFO ] Deduced a trap composed of 14 places in 363 ms of which 1 ms to minimize.
[2023-03-18 22:43:49] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 1 ms to minimize.
[2023-03-18 22:43:49] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2023-03-18 22:43:50] [INFO ] Deduced a trap composed of 8 places in 380 ms of which 1 ms to minimize.
[2023-03-18 22:43:50] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-18 22:43:50] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 1 ms to minimize.
[2023-03-18 22:43:51] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 1 ms to minimize.
[2023-03-18 22:43:51] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 1 ms to minimize.
[2023-03-18 22:43:52] [INFO ] Deduced a trap composed of 6 places in 350 ms of which 17 ms to minimize.
[2023-03-18 22:43:52] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 12005 ms
[2023-03-18 22:43:52] [INFO ] Deduced a trap composed of 3 places in 316 ms of which 0 ms to minimize.
[2023-03-18 22:43:53] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 0 ms to minimize.
[2023-03-18 22:43:53] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 1 ms to minimize.
[2023-03-18 22:43:54] [INFO ] Deduced a trap composed of 9 places in 842 ms of which 0 ms to minimize.
[2023-03-18 22:43:54] [INFO ] Deduced a trap composed of 6 places in 400 ms of which 1 ms to minimize.
[2023-03-18 22:43:55] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 1 ms to minimize.
[2023-03-18 22:43:55] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 0 ms to minimize.
[2023-03-18 22:43:56] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2023-03-18 22:43:56] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 0 ms to minimize.
[2023-03-18 22:43:56] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2023-03-18 22:43:57] [INFO ] Deduced a trap composed of 8 places in 366 ms of which 1 ms to minimize.
[2023-03-18 22:43:57] [INFO ] Deduced a trap composed of 11 places in 462 ms of which 0 ms to minimize.
[2023-03-18 22:43:57] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2023-03-18 22:43:58] [INFO ] Deduced a trap composed of 8 places in 528 ms of which 2 ms to minimize.
[2023-03-18 22:43:58] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 1 ms to minimize.
[2023-03-18 22:43:59] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 0 ms to minimize.
[2023-03-18 22:43:59] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2023-03-18 22:44:00] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 1 ms to minimize.
[2023-03-18 22:44:00] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-18 22:44:00] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-18 22:44:01] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2023-03-18 22:44:01] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-18 22:44:01] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 0 ms to minimize.
[2023-03-18 22:44:01] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-18 22:44:02] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 0 ms to minimize.
[2023-03-18 22:44:02] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 1 ms to minimize.
[2023-03-18 22:44:02] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2023-03-18 22:44:03] [INFO ] Deduced a trap composed of 8 places in 328 ms of which 1 ms to minimize.
[2023-03-18 22:44:03] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 0 ms to minimize.
[2023-03-18 22:44:03] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 1 ms to minimize.
[2023-03-18 22:44:04] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 1 ms to minimize.
[2023-03-18 22:44:04] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2023-03-18 22:44:04] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 1 ms to minimize.
[2023-03-18 22:44:05] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 2 ms to minimize.
[2023-03-18 22:44:05] [INFO ] Deduced a trap composed of 9 places in 361 ms of which 0 ms to minimize.
[2023-03-18 22:44:06] [INFO ] Deduced a trap composed of 8 places in 500 ms of which 1 ms to minimize.
[2023-03-18 22:44:06] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 1 ms to minimize.
[2023-03-18 22:44:06] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 14 ms to minimize.
[2023-03-18 22:44:07] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2023-03-18 22:44:07] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-18 22:44:07] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2023-03-18 22:44:08] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 14 ms to minimize.
[2023-03-18 22:44:08] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 15670 ms
[2023-03-18 22:44:08] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-18 22:44:09] [INFO ] Deduced a trap composed of 3 places in 353 ms of which 1 ms to minimize.
[2023-03-18 22:44:09] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 16 ms to minimize.
[2023-03-18 22:44:09] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 1 ms to minimize.
[2023-03-18 22:44:10] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 1 ms to minimize.
[2023-03-18 22:44:10] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 1 ms to minimize.
[2023-03-18 22:44:10] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 0 ms to minimize.
[2023-03-18 22:44:11] [INFO ] Deduced a trap composed of 7 places in 542 ms of which 0 ms to minimize.
[2023-03-18 22:44:11] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 1 ms to minimize.
[2023-03-18 22:44:12] [INFO ] Deduced a trap composed of 10 places in 294 ms of which 3 ms to minimize.
[2023-03-18 22:44:12] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 0 ms to minimize.
[2023-03-18 22:44:13] [INFO ] Deduced a trap composed of 10 places in 638 ms of which 1 ms to minimize.
[2023-03-18 22:44:14] [INFO ] Deduced a trap composed of 14 places in 547 ms of which 1 ms to minimize.
[2023-03-18 22:44:14] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 1 ms to minimize.
[2023-03-18 22:44:14] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-18 22:44:14] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-18 22:44:15] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 1 ms to minimize.
[2023-03-18 22:44:15] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7151 ms
[2023-03-18 22:44:15] [INFO ] After 53145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 664 ms.
[2023-03-18 22:44:16] [INFO ] After 54206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-18 22:44:16] [INFO ] Flatten gal took : 72 ms
[2023-03-18 22:44:16] [INFO ] Flatten gal took : 78 ms
[2023-03-18 22:44:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13848954106120617429.gal : 13 ms
[2023-03-18 22:44:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8945908072842566507.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/ReachabilityCardinality13848954106120617429.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8945908072842566507.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 ...329
Loading property file /tmp/ReachabilityCardinality8945908072842566507.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :14 after 40
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :40 after 1440
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1440 after 60480
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :60480 after 1.04509e+09
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.04509e+09 after 5.20106e+14
Detected timeout of ITS tools.
[2023-03-18 22:44:31] [INFO ] Flatten gal took : 110 ms
[2023-03-18 22:44:31] [INFO ] Applying decomposition
[2023-03-18 22:44:31] [INFO ] Flatten gal took : 118 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/graph7396245801706455408.txt' '-o' '/tmp/graph7396245801706455408.bin' '-w' '/tmp/graph7396245801706455408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7396245801706455408.bin' '-l' '-1' '-v' '-w' '/tmp/graph7396245801706455408.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:44:32] [INFO ] Decomposing Gal with order
[2023-03-18 22:44:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:44:32] [INFO ] Removed a total of 1029 redundant transitions.
[2023-03-18 22:44:32] [INFO ] Flatten gal took : 221 ms
[2023-03-18 22:44:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1046 labels/synchronizations in 63 ms.
[2023-03-18 22:44:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1545230847347670661.gal : 21 ms
[2023-03-18 22:44:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3323116907485761672.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/ReachabilityCardinality1545230847347670661.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3323116907485761672.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/ReachabilityCardinality3323116907485761672.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 1128
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1128 after 20160
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :20160 after 20160
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :20160 after 1.04509e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1121901985671495377
[2023-03-18 22:44:47] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1121901985671495377
Running compilation step : cd /tmp/ltsmin1121901985671495377;'/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 2995 ms.
Running link step : cd /tmp/ltsmin1121901985671495377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin1121901985671495377;'/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' 'ShieldIIPsPT050BReachabilityFireability04==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-18 22:45:02] [INFO ] Flatten gal took : 82 ms
[2023-03-18 22:45:02] [INFO ] Applying decomposition
[2023-03-18 22:45:03] [INFO ] Flatten gal took : 82 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/graph10077827979211513693.txt' '-o' '/tmp/graph10077827979211513693.bin' '-w' '/tmp/graph10077827979211513693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10077827979211513693.bin' '-l' '-1' '-v' '-w' '/tmp/graph10077827979211513693.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:45:03] [INFO ] Decomposing Gal with order
[2023-03-18 22:45:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:45:03] [INFO ] Removed a total of 1150 redundant transitions.
[2023-03-18 22:45:03] [INFO ] Flatten gal took : 216 ms
[2023-03-18 22:45:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-18 22:45:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12667312638134232283.gal : 33 ms
[2023-03-18 22:45:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3650842677694201214.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/ReachabilityCardinality12667312638134232283.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3650842677694201214.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/ReachabilityCardinality3650842677694201214.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1.28256e+06
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1.28256e+06 after 3.93378e+41
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.17916e+139 after 1.73406e+139
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.73406e+139 after 1.61385e+141
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 23:15:22] [INFO ] Flatten gal took : 1056 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8731668192663545478
[2023-03-18 23:15:23] [INFO ] Computing symmetric may disable matrix : 1316 transitions.
[2023-03-18 23:15:23] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:15:23] [INFO ] Computing symmetric may enable matrix : 1316 transitions.
[2023-03-18 23:15:23] [INFO ] Computation of Complete enable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:15:23] [INFO ] Applying decomposition
[2023-03-18 23:15:28] [INFO ] Flatten gal took : 4542 ms
[2023-03-18 23:15:28] [INFO ] Computing Do-Not-Accords matrix : 1316 transitions.
[2023-03-18 23:15:28] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:15:28] [INFO ] Built C files in 5586ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8731668192663545478
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/graph17590785287024115782.txt' '-o' '/tmp/graph17590785287024115782.bin' '-w' '/tmp/graph17590785287024115782.weights'
Running compilation step : cd /tmp/ltsmin8731668192663545478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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/graph17590785287024115782.bin' '-l' '-1' '-v' '-w' '/tmp/graph17590785287024115782.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:15:28] [INFO ] Decomposing Gal with order
[2023-03-18 23:15:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:15:29] [INFO ] Removed a total of 1025 redundant transitions.
[2023-03-18 23:15:29] [INFO ] Flatten gal took : 104 ms
[2023-03-18 23:15:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1016 labels/synchronizations in 37 ms.
[2023-03-18 23:15:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4627771656241116803.gal : 13 ms
[2023-03-18 23:15:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability847324144285951955.prop : 3 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/ReachabilityFireability4627771656241116803.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability847324144285951955.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 ...306
Loading property file /tmp/ReachabilityFireability847324144285951955.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :12 after 23
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :23 after 78
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :78 after 120
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :120 after 120
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :120 after 5.80608e+06
Compilation finished in 4999 ms.
Running link step : cd /tmp/ltsmin8731668192663545478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 138 ms.
Running LTSmin : cd /tmp/ltsmin8731668192663545478;'/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' 'ShieldIIPsPT050BReachabilityFireability04==true'
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :5.80608e+06 after 1.88117e+10
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8731668192663545478;'/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' 'ShieldIIPsPT050BReachabilityFireability04==true'
Running LTSmin : cd /tmp/ltsmin8731668192663545478;'/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' 'ShieldIIPsPT050BReachabilityFireability05==true'
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.88117e+10 after 1.88117e+10
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 3610352 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16103956 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="ShieldIIPs-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 ShieldIIPs-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-167903713200159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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