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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 569K 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 ShieldPPPt-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679218886156

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=ShieldPPPt-PT-030B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 09:41:29] [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 09:41:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:41:29] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2023-03-19 09:41:29] [INFO ] Transformed 2343 places.
[2023-03-19 09:41:29] [INFO ] Transformed 2133 transitions.
[2023-03-19 09:41:29] [INFO ] Found NUPN structural information;
[2023-03-19 09:41:29] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 09:41:30] [INFO ] Flatten gal took : 208 ms
[2023-03-19 09:41:30] [INFO ] Flatten gal took : 113 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-19 09:41:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12337430380723369436.gal : 58 ms
[2023-03-19 09:41:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16930034596203730339.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/ReachabilityCardinality12337430380723369436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16930034596203730339.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 ...330
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) 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 12) seen :0
Loading property file /tmp/ReachabilityCardinality16930034596203730339.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2023-03-19 09:41:31] [INFO ] Computed 331 place invariants in 32 ms
[2023-03-19 09:41:32] [INFO ] After 1195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 09:41:33] [INFO ] [Nat]Absence check using 331 positive place invariants in 115 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :36 after 53
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :53 after 863
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :863 after 356981
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :356981 after 9.83797e+09
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :9.83797e+09 after 6.90677e+16
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :6.90677e+16 after 1.21274e+32
[2023-03-19 09:41:37] [INFO ] After 3780ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-19 09:41:38] [INFO ] Deduced a trap composed of 21 places in 628 ms of which 7 ms to minimize.
[2023-03-19 09:41:39] [INFO ] Deduced a trap composed of 17 places in 661 ms of which 2 ms to minimize.
[2023-03-19 09:41:40] [INFO ] Deduced a trap composed of 19 places in 501 ms of which 2 ms to minimize.
[2023-03-19 09:41:40] [INFO ] Deduced a trap composed of 26 places in 485 ms of which 2 ms to minimize.
[2023-03-19 09:41:41] [INFO ] Deduced a trap composed of 27 places in 714 ms of which 6 ms to minimize.
[2023-03-19 09:41:41] [INFO ] Deduced a trap composed of 22 places in 471 ms of which 2 ms to minimize.
[2023-03-19 09:41:42] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 1 ms to minimize.
[2023-03-19 09:41:43] [INFO ] Deduced a trap composed of 43 places in 585 ms of which 1 ms to minimize.
[2023-03-19 09:41:43] [INFO ] Deduced a trap composed of 29 places in 547 ms of which 2 ms to minimize.
[2023-03-19 09:41:44] [INFO ] Deduced a trap composed of 45 places in 480 ms of which 1 ms to minimize.
[2023-03-19 09:41:45] [INFO ] Deduced a trap composed of 29 places in 478 ms of which 1 ms to minimize.
[2023-03-19 09:41:45] [INFO ] Deduced a trap composed of 34 places in 459 ms of which 2 ms to minimize.
[2023-03-19 09:41:46] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 1 ms to minimize.
[2023-03-19 09:41:46] [INFO ] Deduced a trap composed of 43 places in 437 ms of which 1 ms to minimize.
[2023-03-19 09:41:47] [INFO ] Deduced a trap composed of 47 places in 434 ms of which 1 ms to minimize.
[2023-03-19 09:41:47] [INFO ] Deduced a trap composed of 41 places in 409 ms of which 1 ms to minimize.
[2023-03-19 09:41:48] [INFO ] Deduced a trap composed of 42 places in 468 ms of which 1 ms to minimize.
[2023-03-19 09:41:48] [INFO ] Deduced a trap composed of 34 places in 440 ms of which 1 ms to minimize.
[2023-03-19 09:41:49] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 1 ms to minimize.
[2023-03-19 09:41:49] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 1 ms to minimize.
[2023-03-19 09:41:50] [INFO ] Deduced a trap composed of 42 places in 421 ms of which 1 ms to minimize.
[2023-03-19 09:41:50] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 1 ms to minimize.
[2023-03-19 09:41:51] [INFO ] Deduced a trap composed of 56 places in 439 ms of which 1 ms to minimize.
[2023-03-19 09:41:51] [INFO ] Deduced a trap composed of 40 places in 406 ms of which 1 ms to minimize.
[2023-03-19 09:41:52] [INFO ] Deduced a trap composed of 31 places in 368 ms of which 1 ms to minimize.
[2023-03-19 09:41:52] [INFO ] Deduced a trap composed of 31 places in 427 ms of which 1 ms to minimize.
[2023-03-19 09:41:53] [INFO ] Deduced a trap composed of 37 places in 352 ms of which 1 ms to minimize.
[2023-03-19 09:41:53] [INFO ] Deduced a trap composed of 43 places in 345 ms of which 1 ms to minimize.
[2023-03-19 09:41:54] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 1 ms to minimize.
[2023-03-19 09:41:54] [INFO ] Deduced a trap composed of 43 places in 423 ms of which 3 ms to minimize.
[2023-03-19 09:41:55] [INFO ] Deduced a trap composed of 45 places in 317 ms of which 1 ms to minimize.
[2023-03-19 09:41:55] [INFO ] Deduced a trap composed of 45 places in 288 ms of which 1 ms to minimize.
[2023-03-19 09:41:55] [INFO ] Deduced a trap composed of 41 places in 309 ms of which 1 ms to minimize.
[2023-03-19 09:41:56] [INFO ] Deduced a trap composed of 47 places in 326 ms of which 0 ms to minimize.
[2023-03-19 09:41:56] [INFO ] Deduced a trap composed of 27 places in 303 ms of which 1 ms to minimize.
[2023-03-19 09:41:57] [INFO ] Deduced a trap composed of 44 places in 297 ms of which 0 ms to minimize.
[2023-03-19 09:41:57] [INFO ] Deduced a trap composed of 46 places in 370 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 09:41:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:41:57] [INFO ] After 25334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 11 different solutions.
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 878 ms.
Support contains 128 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2343 transition count 1658
Reduce places removed 475 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 477 rules applied. Total rules applied 952 place count 1868 transition count 1656
Reduce places removed 1 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 37 rules applied. Total rules applied 989 place count 1867 transition count 1620
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 1025 place count 1831 transition count 1620
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 1025 place count 1831 transition count 1495
Deduced a syphon composed of 125 places in 7 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1275 place count 1706 transition count 1495
Discarding 186 places :
Symmetric choice reduction at 4 with 186 rule applications. Total rules 1461 place count 1520 transition count 1309
Iterating global reduction 4 with 186 rules applied. Total rules applied 1647 place count 1520 transition count 1309
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 1647 place count 1520 transition count 1239
Deduced a syphon composed of 70 places in 4 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 1787 place count 1450 transition count 1239
Performed 466 Post agglomeration using F-continuation condition.Transition count delta: 466
Deduced a syphon composed of 466 places in 2 ms
Reduce places removed 466 places and 0 transitions.
Iterating global reduction 4 with 932 rules applied. Total rules applied 2719 place count 984 transition count 773
Renaming transitions due to excessive name length > 1024 char.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 2851 place count 918 transition count 773
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 2858 place count 918 transition count 766
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2865 place count 911 transition count 766
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 5 with 77 rules applied. Total rules applied 2942 place count 911 transition count 766
Applied a total of 2942 rules in 719 ms. Remains 911 /2343 variables (removed 1432) and now considering 766/2133 (removed 1367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 720 ms. Remains : 911/2343 places, 766/2133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 10) seen :2
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 766 rows 911 cols
[2023-03-19 09:42:00] [INFO ] Computed 331 place invariants in 24 ms
[2023-03-19 09:42:00] [INFO ] [Real]Absence check using 331 positive place invariants in 216 ms returned sat
[2023-03-19 09:42:00] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 09:42:01] [INFO ] [Nat]Absence check using 331 positive place invariants in 70 ms returned sat
[2023-03-19 09:42:02] [INFO ] After 1046ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 09:42:02] [INFO ] State equation strengthened by 135 read => feed constraints.
[2023-03-19 09:42:03] [INFO ] After 818ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 09:42:03] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 3 ms to minimize.
[2023-03-19 09:42:03] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 0 ms to minimize.
[2023-03-19 09:42:04] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-19 09:42:04] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-19 09:42:04] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2023-03-19 09:42:04] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-19 09:42:04] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-19 09:42:04] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-19 09:42:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1736 ms
[2023-03-19 09:42:06] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2023-03-19 09:42:06] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-19 09:42:06] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2023-03-19 09:42:07] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-19 09:42:07] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-19 09:42:07] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-19 09:42:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1460 ms
[2023-03-19 09:42:08] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 1 ms to minimize.
[2023-03-19 09:42:08] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2023-03-19 09:42:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
[2023-03-19 09:42:09] [INFO ] After 6621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 997 ms.
[2023-03-19 09:42:10] [INFO ] After 9259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 320 ms.
Support contains 90 out of 911 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 911/911 places, 766/766 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 911 transition count 760
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 905 transition count 760
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 12 place count 905 transition count 749
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 34 place count 894 transition count 749
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 78 place count 872 transition count 727
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 94 place count 864 transition count 727
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 864 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 863 transition count 726
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 863 transition count 726
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 862 transition count 725
Applied a total of 101 rules in 213 ms. Remains 862 /911 variables (removed 49) and now considering 725/766 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 862/911 places, 725/766 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 8) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 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 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 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 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 725 rows 862 cols
[2023-03-19 09:42:11] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-19 09:42:11] [INFO ] [Real]Absence check using 331 positive place invariants in 146 ms returned sat
[2023-03-19 09:42:11] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 09:42:12] [INFO ] [Nat]Absence check using 331 positive place invariants in 91 ms returned sat
[2023-03-19 09:42:13] [INFO ] After 916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 09:42:13] [INFO ] State equation strengthened by 129 read => feed constraints.
[2023-03-19 09:42:14] [INFO ] After 1368ms SMT Verify possible using 129 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 09:42:15] [INFO ] Deduced a trap composed of 5 places in 379 ms of which 0 ms to minimize.
[2023-03-19 09:42:15] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 0 ms to minimize.
[2023-03-19 09:42:15] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-19 09:42:15] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 0 ms to minimize.
[2023-03-19 09:42:15] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2023-03-19 09:42:16] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-19 09:42:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1466 ms
[2023-03-19 09:42:16] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-19 09:42:16] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-19 09:42:17] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2023-03-19 09:42:17] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 13 ms to minimize.
[2023-03-19 09:42:17] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-19 09:42:17] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2023-03-19 09:42:17] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-19 09:42:18] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-19 09:42:18] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 17 ms to minimize.
[2023-03-19 09:42:18] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-19 09:42:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2188 ms
[2023-03-19 09:42:19] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2023-03-19 09:42:19] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-19 09:42:19] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2023-03-19 09:42:19] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 0 ms to minimize.
[2023-03-19 09:42:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 981 ms
[2023-03-19 09:42:20] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-19 09:42:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-19 09:42:20] [INFO ] After 7052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 547 ms.
[2023-03-19 09:42:20] [INFO ] After 9140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 264 ms.
Support contains 84 out of 862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 862/862 places, 725/725 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 862 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 861 transition count 724
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 861 transition count 721
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 858 transition count 721
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 855 transition count 718
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 853 transition count 718
Applied a total of 18 rules in 85 ms. Remains 853 /862 variables (removed 9) and now considering 718/725 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 853/862 places, 718/725 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 92144 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{6=1}
Probabilistic random walk after 92144 steps, saw 69469 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 718 rows 853 cols
[2023-03-19 09:42:24] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-19 09:42:25] [INFO ] [Real]Absence check using 331 positive place invariants in 138 ms returned sat
[2023-03-19 09:42:25] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:42:25] [INFO ] [Nat]Absence check using 331 positive place invariants in 114 ms returned sat
[2023-03-19 09:42:26] [INFO ] After 918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:42:26] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-03-19 09:42:27] [INFO ] After 956ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:42:27] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2023-03-19 09:42:28] [INFO ] Deduced a trap composed of 6 places in 414 ms of which 0 ms to minimize.
[2023-03-19 09:42:28] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-19 09:42:28] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2023-03-19 09:42:28] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-19 09:42:29] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2023-03-19 09:42:29] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2023-03-19 09:42:29] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2023-03-19 09:42:29] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2023-03-19 09:42:29] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2023-03-19 09:42:30] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 11 ms to minimize.
[2023-03-19 09:42:30] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 7 ms to minimize.
[2023-03-19 09:42:30] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2023-03-19 09:42:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2938 ms
[2023-03-19 09:42:31] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-19 09:42:31] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2023-03-19 09:42:31] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-19 09:42:31] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2023-03-19 09:42:31] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2023-03-19 09:42:32] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-19 09:42:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1238 ms
[2023-03-19 09:42:32] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2023-03-19 09:42:32] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-19 09:42:32] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-19 09:42:33] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2023-03-19 09:42:33] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2023-03-19 09:42:33] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-19 09:42:33] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2023-03-19 09:42:33] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-19 09:42:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1716 ms
[2023-03-19 09:42:34] [INFO ] After 7567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 594 ms.
[2023-03-19 09:42:34] [INFO ] After 9574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 336 ms.
Support contains 81 out of 853 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 853/853 places, 718/718 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 852 transition count 717
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 852 transition count 717
Applied a total of 3 rules in 49 ms. Remains 852 /853 variables (removed 1) and now considering 717/718 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 852/853 places, 717/718 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) 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
Incomplete Best-First random walk after 10001 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 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 90501 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90501 steps, saw 70171 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 717 rows 852 cols
[2023-03-19 09:42:39] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-19 09:42:39] [INFO ] [Real]Absence check using 331 positive place invariants in 71 ms returned sat
[2023-03-19 09:42:39] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:42:39] [INFO ] [Nat]Absence check using 331 positive place invariants in 278 ms returned sat
[2023-03-19 09:42:41] [INFO ] After 1280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:42:41] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-03-19 09:42:42] [INFO ] After 875ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:42:42] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-19 09:42:42] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-19 09:42:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
[2023-03-19 09:42:43] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 1 ms to minimize.
[2023-03-19 09:42:43] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2023-03-19 09:42:43] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 1 ms to minimize.
[2023-03-19 09:42:44] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-19 09:42:44] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-19 09:42:44] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2023-03-19 09:42:44] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2023-03-19 09:42:45] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
[2023-03-19 09:42:45] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
[2023-03-19 09:42:45] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2023-03-19 09:42:45] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2023-03-19 09:42:46] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2023-03-19 09:42:46] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 2 ms to minimize.
[2023-03-19 09:42:46] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-19 09:42:46] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3473 ms
[2023-03-19 09:42:46] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-19 09:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-19 09:42:47] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-19 09:42:47] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 2 ms to minimize.
[2023-03-19 09:42:47] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-19 09:42:47] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2023-03-19 09:42:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1007 ms
[2023-03-19 09:42:48] [INFO ] After 6787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 766 ms.
[2023-03-19 09:42:48] [INFO ] After 9551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 147 ms.
Support contains 81 out of 852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 852/852 places, 717/717 transitions.
Applied a total of 0 rules in 29 ms. Remains 852 /852 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 852/852 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 852/852 places, 717/717 transitions.
Applied a total of 0 rules in 20 ms. Remains 852 /852 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2023-03-19 09:42:49] [INFO ] Invariant cache hit.
[2023-03-19 09:42:49] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-19 09:42:49] [INFO ] Invariant cache hit.
[2023-03-19 09:42:49] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-03-19 09:42:51] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 2605 ms to find 0 implicit places.
[2023-03-19 09:42:51] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-19 09:42:51] [INFO ] Invariant cache hit.
[2023-03-19 09:42:52] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3192 ms. Remains : 852/852 places, 717/717 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 852 transition count 716
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 851 transition count 716
Partial Free-agglomeration rule applied 154 times.
Drop transitions removed 154 transitions
Iterating global reduction 0 with 154 rules applied. Total rules applied 156 place count 851 transition count 716
Applied a total of 156 rules in 39 ms. Remains 851 /852 variables (removed 1) and now considering 716/717 (removed 1) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 716 rows 851 cols
[2023-03-19 09:42:52] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-19 09:42:52] [INFO ] [Real]Absence check using 331 positive place invariants in 53 ms returned sat
[2023-03-19 09:42:52] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:42:52] [INFO ] [Nat]Absence check using 331 positive place invariants in 84 ms returned sat
[2023-03-19 09:42:54] [INFO ] After 911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:42:54] [INFO ] State equation strengthened by 138 read => feed constraints.
[2023-03-19 09:42:54] [INFO ] After 732ms SMT Verify possible using 138 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:42:55] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-19 09:42:55] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 0 ms to minimize.
[2023-03-19 09:42:55] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2023-03-19 09:42:55] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2023-03-19 09:42:55] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-19 09:42:55] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-19 09:42:55] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2023-03-19 09:42:56] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-19 09:42:56] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2023-03-19 09:42:56] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2023-03-19 09:42:56] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-19 09:42:56] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-19 09:42:56] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-19 09:42:56] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2023-03-19 09:42:57] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2023-03-19 09:42:57] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-19 09:42:57] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-19 09:42:57] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-19 09:42:57] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2954 ms
[2023-03-19 09:42:58] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2023-03-19 09:42:58] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-19 09:42:58] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2023-03-19 09:42:58] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-19 09:42:59] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-19 09:42:59] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2023-03-19 09:42:59] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-19 09:42:59] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2023-03-19 09:43:00] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2023-03-19 09:43:00] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-19 09:43:00] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-19 09:43:00] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 2 ms to minimize.
[2023-03-19 09:43:01] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 0 ms to minimize.
[2023-03-19 09:43:01] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3168 ms
[2023-03-19 09:43:01] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-19 09:43:02] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-19 09:43:02] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2023-03-19 09:43:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 591 ms
[2023-03-19 09:43:02] [INFO ] After 8265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 809 ms.
[2023-03-19 09:43:03] [INFO ] After 10440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:43:03] [INFO ] Flatten gal took : 105 ms
[2023-03-19 09:43:03] [INFO ] Flatten gal took : 64 ms
[2023-03-19 09:43:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6464799683472012843.gal : 11 ms
[2023-03-19 09:43:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality237315325065362271.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/ReachabilityCardinality6464799683472012843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality237315325065362271.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 ...327
Loading property file /tmp/ReachabilityCardinality237315325065362271.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 11
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :11 after 29
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :29 after 326
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :326 after 2594
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2594 after 1.39968e+06
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.39968e+06 after 2.01554e+09
Detected timeout of ITS tools.
[2023-03-19 09:43:18] [INFO ] Flatten gal took : 36 ms
[2023-03-19 09:43:18] [INFO ] Applying decomposition
[2023-03-19 09:43:18] [INFO ] Flatten gal took : 31 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/graph786948564241101962.txt' '-o' '/tmp/graph786948564241101962.bin' '-w' '/tmp/graph786948564241101962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph786948564241101962.bin' '-l' '-1' '-v' '-w' '/tmp/graph786948564241101962.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:43:18] [INFO ] Decomposing Gal with order
[2023-03-19 09:43:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:43:18] [INFO ] Removed a total of 202 redundant transitions.
[2023-03-19 09:43:18] [INFO ] Flatten gal took : 99 ms
[2023-03-19 09:43:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 37 ms.
[2023-03-19 09:43:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2066103019350322208.gal : 24 ms
[2023-03-19 09:43:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16749004022911902008.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/ReachabilityCardinality2066103019350322208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16749004022911902008.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/ReachabilityCardinality16749004022911902008.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 3
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :5 after 651
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :651 after 5187
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :5187 after 3.73248e+06
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3.73248e+06 after 2.11796e+17
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2.11796e+17 after 2.35249e+19
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16300892519502238877
[2023-03-19 09:43:34] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16300892519502238877
Running compilation step : cd /tmp/ltsmin16300892519502238877;'/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 2090 ms.
Running link step : cd /tmp/ltsmin16300892519502238877;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16300892519502238877;'/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' 'ShieldPPPtPT030BReachabilityFireability01==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 09:43:49] [INFO ] Flatten gal took : 69 ms
[2023-03-19 09:43:49] [INFO ] Applying decomposition
[2023-03-19 09:43:49] [INFO ] Flatten gal took : 55 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/graph18402639242985874785.txt' '-o' '/tmp/graph18402639242985874785.bin' '-w' '/tmp/graph18402639242985874785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18402639242985874785.bin' '-l' '-1' '-v' '-w' '/tmp/graph18402639242985874785.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:43:49] [INFO ] Decomposing Gal with order
[2023-03-19 09:43:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:43:49] [INFO ] Removed a total of 180 redundant transitions.
[2023-03-19 09:43:49] [INFO ] Flatten gal took : 107 ms
[2023-03-19 09:43:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2023-03-19 09:43:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15261924423164834273.gal : 26 ms
[2023-03-19 09:43:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18311868545974312663.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/ReachabilityCardinality15261924423164834273.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18311868545974312663.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality18311868545974312663.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 2914
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :2914 after 94647
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 10:13:57] [INFO ] Flatten gal took : 3180 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14752278100957201914
[2023-03-19 10:13:57] [INFO ] Computing symmetric may disable matrix : 717 transitions.
[2023-03-19 10:13:57] [INFO ] Computation of Complete disable matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:13:57] [INFO ] Computing symmetric may enable matrix : 717 transitions.
[2023-03-19 10:13:57] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:13:57] [INFO ] Applying decomposition
[2023-03-19 10:13:58] [INFO ] Flatten gal took : 410 ms
[2023-03-19 10:14:01] [INFO ] Computing Do-Not-Accords matrix : 717 transitions.
[2023-03-19 10:14:01] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:14:01] [INFO ] Built C files in 4075ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14752278100957201914
Running compilation step : cd /tmp/ltsmin14752278100957201914;'/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/graph9523319732474974325.txt' '-o' '/tmp/graph9523319732474974325.bin' '-w' '/tmp/graph9523319732474974325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9523319732474974325.bin' '-l' '-1' '-v' '-w' '/tmp/graph9523319732474974325.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:14:02] [INFO ] Decomposing Gal with order
[2023-03-19 10:14:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:14:02] [INFO ] Removed a total of 376 redundant transitions.
[2023-03-19 10:14:02] [INFO ] Flatten gal took : 92 ms
[2023-03-19 10:14:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 66 ms.
[2023-03-19 10:14:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15527805746320422620.gal : 10 ms
[2023-03-19 10:14:02] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9161756057190444289.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability15527805746320422620.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9161756057190444289.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/ReachabilityFireability9161756057190444289.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 3
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :9 after 1301
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1301 after 62213
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :3.75739e+16 after 1.87044e+23
Compilation finished in 2561 ms.
Running link step : cd /tmp/ltsmin14752278100957201914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin14752278100957201914;'/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' 'ShieldPPPtPT030BReachabilityFireability01==true'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin14752278100957201914;'/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' 'ShieldPPPtPT030BReachabilityFireability01==true'
Running LTSmin : cd /tmp/ltsmin14752278100957201914;'/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' 'ShieldPPPtPT030BReachabilityFireability06==true'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin14752278100957201914;'/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' 'ShieldPPPtPT030BReachabilityFireability06==true'
Running LTSmin : cd /tmp/ltsmin14752278100957201914;'/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' 'ShieldPPPtPT030BReachabilityFireability07==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 2711308 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15766556 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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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-167903713800655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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