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-167903713400319.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-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 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 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 686K 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679188866260

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-040B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 01:21:13] [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:21:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:21:13] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2023-03-19 01:21:13] [INFO ] Transformed 2803 places.
[2023-03-19 01:21:13] [INFO ] Transformed 2603 transitions.
[2023-03-19 01:21:13] [INFO ] Found NUPN structural information;
[2023-03-19 01:21:13] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 16) seen :7
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
[2023-03-19 01:21:14] [INFO ] Flatten gal took : 218 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
[2023-03-19 01:21:14] [INFO ] Flatten gal took : 101 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 01:21:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14176696004529281905.gal : 55 ms
[2023-03-19 01:21:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5369291347364521166.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/ReachabilityCardinality14176696004529281905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5369291347364521166.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 2603 rows 2803 cols
[2023-03-19 01:21:14] [INFO ] Computed 361 place invariants in 39 ms

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/ReachabilityCardinality5369291347364521166.prop.
[2023-03-19 01:21:15] [INFO ] After 913ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 01:21:16] [INFO ] [Nat]Absence check using 361 positive place invariants in 180 ms returned sat
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :36 after 65
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :65 after 729
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :729 after 68427
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :68427 after 2.31482e+09
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :2.31482e+09 after 3.23253e+17
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :3.23253e+17 after 6.09057e+37
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :6.09057e+37 after 2.95152e+78
[2023-03-19 01:21:24] [INFO ] After 7117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 01:21:25] [INFO ] Deduced a trap composed of 30 places in 854 ms of which 8 ms to minimize.
[2023-03-19 01:21:26] [INFO ] Deduced a trap composed of 20 places in 681 ms of which 3 ms to minimize.
[2023-03-19 01:21:27] [INFO ] Deduced a trap composed of 37 places in 923 ms of which 4 ms to minimize.
[2023-03-19 01:21:28] [INFO ] Deduced a trap composed of 24 places in 809 ms of which 6 ms to minimize.
[2023-03-19 01:21:29] [INFO ] Deduced a trap composed of 21 places in 941 ms of which 2 ms to minimize.
[2023-03-19 01:21:30] [INFO ] Deduced a trap composed of 14 places in 964 ms of which 1 ms to minimize.
[2023-03-19 01:21:32] [INFO ] Deduced a trap composed of 26 places in 1046 ms of which 2 ms to minimize.
[2023-03-19 01:21:33] [INFO ] Deduced a trap composed of 28 places in 981 ms of which 2 ms to minimize.
[2023-03-19 01:21:34] [INFO ] Deduced a trap composed of 32 places in 845 ms of which 2 ms to minimize.
[2023-03-19 01:21:35] [INFO ] Deduced a trap composed of 24 places in 801 ms of which 2 ms to minimize.
[2023-03-19 01:21:37] [INFO ] Deduced a trap composed of 24 places in 911 ms of which 4 ms to minimize.
[2023-03-19 01:21:38] [INFO ] Deduced a trap composed of 27 places in 1025 ms of which 3 ms to minimize.
[2023-03-19 01:21:39] [INFO ] Deduced a trap composed of 24 places in 1040 ms of which 3 ms to minimize.
[2023-03-19 01:21:40] [INFO ] Deduced a trap composed of 19 places in 1081 ms of which 2 ms to minimize.
[2023-03-19 01:21:40] [INFO ] Trap strengthening (SAT) tested/added 14/14 trap constraints in 16395 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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:21:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:21:40] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1243 ms.
Support contains 159 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2803 transition count 2045
Reduce places removed 558 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 560 rules applied. Total rules applied 1118 place count 2245 transition count 2043
Reduce places removed 1 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 26 rules applied. Total rules applied 1144 place count 2244 transition count 2018
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1169 place count 2219 transition count 2018
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 174 Pre rules applied. Total rules applied 1169 place count 2219 transition count 1844
Deduced a syphon composed of 174 places in 8 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 4 with 348 rules applied. Total rules applied 1517 place count 2045 transition count 1844
Discarding 274 places :
Symmetric choice reduction at 4 with 274 rule applications. Total rules 1791 place count 1771 transition count 1570
Iterating global reduction 4 with 274 rules applied. Total rules applied 2065 place count 1771 transition count 1570
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 2065 place count 1771 transition count 1476
Deduced a syphon composed of 94 places in 4 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 2253 place count 1677 transition count 1476
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Deduced a syphon composed of 606 places in 2 ms
Reduce places removed 606 places and 0 transitions.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 3465 place count 1071 transition count 870
Renaming transitions due to excessive name length > 1024 char.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 3641 place count 983 transition count 911
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3642 place count 983 transition count 910
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3650 place count 983 transition count 902
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3658 place count 975 transition count 902
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 3692 place count 975 transition count 902
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3694 place count 975 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3695 place count 974 transition count 901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3697 place count 972 transition count 901
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3697 place count 972 transition count 900
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 3699 place count 971 transition count 900
Applied a total of 3699 rules in 1094 ms. Remains 971 /2803 variables (removed 1832) and now considering 900/2603 (removed 1703) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1094 ms. Remains : 971/2803 places, 900/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 9) seen :1
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :1
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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 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 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 900 rows 971 cols
[2023-03-19 01:21:43] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-19 01:21:44] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 01:21:44] [INFO ] [Nat]Absence check using 359 positive place invariants in 89 ms returned sat
[2023-03-19 01:21:45] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 01:21:45] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-19 01:21:46] [INFO ] After 698ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 01:21:46] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-19 01:21:46] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 0 ms to minimize.
[2023-03-19 01:21:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
[2023-03-19 01:21:47] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2023-03-19 01:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-19 01:21:47] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-19 01:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-19 01:21:47] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2023-03-19 01:21:48] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 12 ms to minimize.
[2023-03-19 01:21:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 812 ms
[2023-03-19 01:21:49] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2023-03-19 01:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-19 01:21:49] [INFO ] After 3600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 620 ms.
[2023-03-19 01:21:49] [INFO ] After 5566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 164 ms.
Support contains 64 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 900/900 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 971 transition count 876
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 947 transition count 875
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 946 transition count 875
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 50 place count 946 transition count 847
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 106 place count 918 transition count 847
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 915 transition count 844
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 915 transition count 844
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 915 transition count 843
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 914 transition count 843
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 206 place count 868 transition count 797
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 242 place count 850 transition count 813
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 850 transition count 812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 849 transition count 812
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 849 transition count 812
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 257 place count 837 transition count 800
Applied a total of 257 rules in 612 ms. Remains 837 /971 variables (removed 134) and now considering 800/900 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 837/971 places, 800/900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 7) seen :1
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 800 rows 837 cols
[2023-03-19 01:21:51] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-19 01:21:51] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 01:21:51] [INFO ] [Nat]Absence check using 359 positive place invariants in 44 ms returned sat
[2023-03-19 01:21:52] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 01:21:52] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-19 01:21:52] [INFO ] After 357ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 01:21:53] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-19 01:21:53] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2023-03-19 01:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2023-03-19 01:21:53] [INFO ] After 1431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 550 ms.
[2023-03-19 01:21:54] [INFO ] After 2920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 148 ms.
Support contains 61 out of 837 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 837/837 places, 800/800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 837 transition count 798
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 835 transition count 798
Applied a total of 4 rules in 20 ms. Remains 835 /837 variables (removed 2) and now considering 798/800 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 835/837 places, 798/800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 112827 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112827 steps, saw 84373 distinct states, run finished after 3007 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 798 rows 835 cols
[2023-03-19 01:21:58] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-19 01:21:58] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 01:21:58] [INFO ] [Nat]Absence check using 359 positive place invariants in 49 ms returned sat
[2023-03-19 01:21:59] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 01:21:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-19 01:21:59] [INFO ] After 457ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 01:22:00] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-19 01:22:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-19 01:22:00] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-19 01:22:00] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-19 01:22:00] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-19 01:22:01] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-19 01:22:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 728 ms
[2023-03-19 01:22:01] [INFO ] After 2051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 425 ms.
[2023-03-19 01:22:01] [INFO ] After 3459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 158 ms.
Support contains 61 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 798/798 transitions.
Applied a total of 0 rules in 20 ms. Remains 835 /835 variables (removed 0) and now considering 798/798 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 835/835 places, 798/798 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 798/798 transitions.
Applied a total of 0 rules in 18 ms. Remains 835 /835 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2023-03-19 01:22:02] [INFO ] Invariant cache hit.
[2023-03-19 01:22:02] [INFO ] Implicit Places using invariants in 395 ms returned [824]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 400 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 834/835 places, 798/798 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 833 transition count 797
Applied a total of 2 rules in 60 ms. Remains 833 /834 variables (removed 1) and now considering 797/798 (removed 1) transitions.
// Phase 1: matrix 797 rows 833 cols
[2023-03-19 01:22:02] [INFO ] Computed 358 place invariants in 7 ms
[2023-03-19 01:22:03] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-19 01:22:03] [INFO ] Invariant cache hit.
[2023-03-19 01:22:03] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-19 01:22:04] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 2431 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 833/835 places, 797/798 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2912 ms. Remains : 833/835 places, 797/798 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 108599 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108599 steps, saw 80635 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-19 01:22:08] [INFO ] Invariant cache hit.
[2023-03-19 01:22:08] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 01:22:08] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-19 01:22:10] [INFO ] After 1031ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 01:22:10] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-19 01:22:10] [INFO ] After 416ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 01:22:10] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2023-03-19 01:22:10] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2023-03-19 01:22:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2023-03-19 01:22:11] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 5 ms to minimize.
[2023-03-19 01:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-19 01:22:11] [INFO ] After 1706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 498 ms.
[2023-03-19 01:22:12] [INFO ] After 3566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 178 ms.
Support contains 61 out of 833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 797/797 transitions.
Applied a total of 0 rules in 18 ms. Remains 833 /833 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 833/833 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 797/797 transitions.
Applied a total of 0 rules in 18 ms. Remains 833 /833 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2023-03-19 01:22:12] [INFO ] Invariant cache hit.
[2023-03-19 01:22:12] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-19 01:22:12] [INFO ] Invariant cache hit.
[2023-03-19 01:22:13] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-19 01:22:14] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
[2023-03-19 01:22:14] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-19 01:22:14] [INFO ] Invariant cache hit.
[2023-03-19 01:22:15] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2862 ms. Remains : 833/833 places, 797/797 transitions.
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 95 place count 833 transition count 797
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 833 transition count 794
Applied a total of 98 rules in 49 ms. Remains 833 /833 variables (removed 0) and now considering 794/797 (removed 3) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 794 rows 833 cols
[2023-03-19 01:22:15] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:22:15] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 01:22:15] [INFO ] [Nat]Absence check using 358 positive place invariants in 48 ms returned sat
[2023-03-19 01:22:16] [INFO ] After 591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 01:22:16] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-19 01:22:16] [INFO ] After 453ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 01:22:17] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-19 01:22:17] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-19 01:22:17] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2023-03-19 01:22:17] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-19 01:22:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 753 ms
[2023-03-19 01:22:18] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-19 01:22:18] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-03-19 01:22:18] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2023-03-19 01:22:18] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-19 01:22:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 842 ms
[2023-03-19 01:22:19] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-19 01:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-19 01:22:19] [INFO ] After 2949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 409 ms.
[2023-03-19 01:22:19] [INFO ] After 4210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-19 01:22:19] [INFO ] Flatten gal took : 53 ms
[2023-03-19 01:22:19] [INFO ] Flatten gal took : 38 ms
[2023-03-19 01:22:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1085182224915889407.gal : 7 ms
[2023-03-19 01:22:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5902069416997571483.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/ReachabilityCardinality1085182224915889407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5902069416997571483.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/ReachabilityCardinality5902069416997571483.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :27 after 81
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :81 after 1296
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1296 after 15552
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :15552 after 4.47898e+06
Invariant property ShieldIIPt-PT-040B-ReachabilityFireability-14 does not hold.
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :4.47898e+06 after 4.29851e+08
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :4.29851e+08 after 4.29852e+08
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :4.29852e+08 after 4.29862e+08
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :4.29862e+08 after 4.29918e+08
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :4.29918e+08 after 4.30052e+08
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :4.30052e+08 after 4.32281e+08
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :4.32281e+08 after 7.84026e+08
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-15 is true.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :7.84026e+08 after 1.03755e+14
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.03755e+14 after 4.89074e+19
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :4.89074e+19 after 2.08798e+23
Detected timeout of ITS tools.
[2023-03-19 01:22:35] [INFO ] Flatten gal took : 77 ms
[2023-03-19 01:22:35] [INFO ] Applying decomposition
[2023-03-19 01:22:35] [INFO ] Flatten gal took : 44 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/graph7505945613693531700.txt' '-o' '/tmp/graph7505945613693531700.bin' '-w' '/tmp/graph7505945613693531700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7505945613693531700.bin' '-l' '-1' '-v' '-w' '/tmp/graph7505945613693531700.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:22:35] [INFO ] Decomposing Gal with order
[2023-03-19 01:22:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:22:35] [INFO ] Removed a total of 444 redundant transitions.
[2023-03-19 01:22:35] [INFO ] Flatten gal took : 127 ms
[2023-03-19 01:22:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 34 ms.
[2023-03-19 01:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10663123553081902364.gal : 17 ms
[2023-03-19 01:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality224144998162606327.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/ReachabilityCardinality10663123553081902364.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality224144998162606327.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/ReachabilityCardinality224144998162606327.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 27
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :27 after 27
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :27 after 27
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :27 after 1296
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1296 after 746496
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-06 is true.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.13341e+14 after 2.31156e+31
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-11 is true.
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-03 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.31156e+31 after 2.33901e+64
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6234468197204940893
[2023-03-19 01:22:50] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6234468197204940893
Running compilation step : cd /tmp/ltsmin6234468197204940893;'/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 1546 ms.
Running link step : cd /tmp/ltsmin6234468197204940893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6234468197204940893;'/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' 'ShieldIIPtPT040BReachabilityFireability00==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:23:05] [INFO ] Flatten gal took : 88 ms
[2023-03-19 01:23:05] [INFO ] Applying decomposition
[2023-03-19 01:23:06] [INFO ] Flatten gal took : 76 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/graph16697726429406512738.txt' '-o' '/tmp/graph16697726429406512738.bin' '-w' '/tmp/graph16697726429406512738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16697726429406512738.bin' '-l' '-1' '-v' '-w' '/tmp/graph16697726429406512738.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:23:06] [INFO ] Decomposing Gal with order
[2023-03-19 01:23:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:23:06] [INFO ] Removed a total of 240 redundant transitions.
[2023-03-19 01:23:06] [INFO ] Flatten gal took : 157 ms
[2023-03-19 01:23:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-19 01:23:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12766357355693236583.gal : 20 ms
[2023-03-19 01:23:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality871153022966670618.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/ReachabilityCardinality12766357355693236583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality871153022966670618.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/ReachabilityCardinality871153022966670618.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 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 40749
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :40749 after 4.22141e+63
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :4.22141e+63 after 2.41387e+119
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 01:53:12] [INFO ] Flatten gal took : 839 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2517101893093710090
[2023-03-19 01:53:12] [INFO ] Computing symmetric may disable matrix : 797 transitions.
[2023-03-19 01:53:12] [INFO ] Computation of Complete disable matrix. took 56 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:53:12] [INFO ] Computing symmetric may enable matrix : 797 transitions.
[2023-03-19 01:53:12] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:53:13] [INFO ] Applying decomposition
[2023-03-19 01:53:13] [INFO ] Flatten gal took : 369 ms
[2023-03-19 01:53:14] [INFO ] Computing Do-Not-Accords matrix : 797 transitions.
[2023-03-19 01:53:14] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:53:14] [INFO ] Built C files in 2024ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2517101893093710090
Running compilation step : cd /tmp/ltsmin2517101893093710090;'/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'
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/graph3662731982704954655.txt' '-o' '/tmp/graph3662731982704954655.bin' '-w' '/tmp/graph3662731982704954655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3662731982704954655.bin' '-l' '-1' '-v' '-w' '/tmp/graph3662731982704954655.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:53:16] [INFO ] Decomposing Gal with order
[2023-03-19 01:53:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:53:16] [INFO ] Removed a total of 641 redundant transitions.
[2023-03-19 01:53:16] [INFO ] Flatten gal took : 57 ms
[2023-03-19 01:53:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 110 ms.
[2023-03-19 01:53:16] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13169777556358841940.gal : 8 ms
[2023-03-19 01:53:16] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3715207693471327701.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/ReachabilityFireability13169777556358841940.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3715207693471327701.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/ReachabilityFireability3715207693471327701.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :27 after 27
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :27 after 15552
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :7.797e+11 after 3.08853e+26
Compilation finished in 2737 ms.
Running link step : cd /tmp/ltsmin2517101893093710090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin2517101893093710090;'/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' 'ShieldIIPtPT040BReachabilityFireability00==true'
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-15 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-040B-ReachabilityFireability-14 does not hold.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-06 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-03 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.08853e+26 after 9.66292e+69
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.66292e+69 after 2.72735e+92
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin2517101893093710090;'/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' 'ShieldIIPtPT040BReachabilityFireability00==true'
Running LTSmin : cd /tmp/ltsmin2517101893093710090;'/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' 'ShieldIIPtPT040BReachabilityFireability11==true'
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.72735e+92 after 2.73485e+92
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.016: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.113: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.116: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.135: Initializing POR dependencies: labels 803, guards 797
pins2lts-mc-linux64( 7/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.167: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.180: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 14.280: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 4/ 8), 14.295: "ShieldIIPtPT040BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 14.296: "ShieldIIPtPT040BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 14.296: "ShieldIIPtPT040BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 14.296: "ShieldIIPtPT040BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 14.297: "ShieldIIPtPT040BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 14.313: "ShieldIIPtPT040BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 14.298: "ShieldIIPtPT040BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 14.313: There are 803 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 14.313: State length is 833, there are 797 groups
pins2lts-mc-linux64( 0/ 8), 14.313: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 14.313: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 14.313: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 14.313: Visible groups: 0 / 797, labels: 1 / 803
pins2lts-mc-linux64( 0/ 8), 14.313: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 14.313: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 14.299: "ShieldIIPtPT040BReachabilityFireability11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 14.414: ~42 levels ~960 states ~2328 transitions
pins2lts-mc-linux64( 0/ 8), 14.521: ~43 levels ~1920 states ~6696 transitions
pins2lts-mc-linux64( 0/ 8), 14.648: ~45 levels ~3840 states ~13400 transitions
pins2lts-mc-linux64( 0/ 8), 14.952: ~46 levels ~7680 states ~29984 transitions
pins2lts-mc-linux64( 5/ 8), 15.542: ~9 levels ~15360 states ~68592 transitions
pins2lts-mc-linux64( 5/ 8), 16.529: ~10 levels ~30720 states ~142880 transitions
pins2lts-mc-linux64( 5/ 8), 18.682: ~11 levels ~61440 states ~321176 transitions
pins2lts-mc-linux64( 5/ 8), 22.758: ~12 levels ~122880 states ~653488 transitions
pins2lts-mc-linux64( 5/ 8), 31.020: ~13 levels ~245760 states ~1383936 transitions
pins2lts-mc-linux64( 5/ 8), 46.319: ~14 levels ~491520 states ~2752832 transitions
pins2lts-mc-linux64( 5/ 8), 78.614: ~15 levels ~983040 states ~5713296 transitions
pins2lts-mc-linux64( 5/ 8), 144.262: ~16 levels ~1966080 states ~11774496 transitions
pins2lts-mc-linux64( 5/ 8), 281.990: ~17 levels ~3932160 states ~24908408 transitions
pins2lts-mc-linux64( 4/ 8), 537.790: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 537.887:
pins2lts-mc-linux64( 0/ 8), 537.887: mean standard work distribution: 6.4% (states) 2.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 537.888:
pins2lts-mc-linux64( 0/ 8), 537.888: Explored 6527908 states 50532895 transitions, fanout: 7.741
pins2lts-mc-linux64( 0/ 8), 537.888: Total exploration time 523.570 sec (523.500 sec minimum, 523.530 sec on average)
pins2lts-mc-linux64( 0/ 8), 537.888: States per second: 12468, Transitions per second: 96516
pins2lts-mc-linux64( 0/ 8), 537.888: Ignoring proviso: 4692502
pins2lts-mc-linux64( 0/ 8), 537.888:
pins2lts-mc-linux64( 0/ 8), 537.888: Queue width: 8B, total height: 5878220, memory: 44.85MB
pins2lts-mc-linux64( 0/ 8), 537.888: Tree memory: 350.7MB, 29.6 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 537.888: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 537.888: Stored 818 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 537.888: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 537.888: Est. total memory use: 395.5MB (~1068.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2517101893093710090;'/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' 'ShieldIIPtPT040BReachabilityFireability11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2517101893093710090;'/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' 'ShieldIIPtPT040BReachabilityFireability11==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: 1745924 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15820720 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="ShieldIIPt-PT-040B"
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-040B, 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-167903713400319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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