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.r307-tall-167873961400437.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 PolyORBNT-COL-S10J60, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tall-167873961400437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678868185396

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J60
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202303021504
[2023-03-15 08:16:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 08:16:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 08:16:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 08:16:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 08:16:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 523 ms
[2023-03-15 08:16:27] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 20 ms.
[2023-03-15 08:16:28] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 191 ms.
[2023-03-15 08:16:28] [INFO ] Unfolded 38 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 08:16:28] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 08:16:28] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 08:16:28] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 60 places in 69 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2023-03-15 08:16:29] [INFO ] Flatten gal took : 598 ms
[2023-03-15 08:16:29] [INFO ] Flatten gal took : 398 ms
[2023-03-15 08:16:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15903806722398024316.gal : 170 ms
[2023-03-15 08:16:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality952803738427353366.prop : 34 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/ReachabilityCardinality15903806722398024316.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality952803738427353366.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/ReachabilityCardinality952803738427353366.prop.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 2102 ms. (steps per millisecond=4 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=9 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 119 ms. (steps per millisecond=8 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-15 08:16:31] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-15 08:16:31] [INFO ] Computed 152 place invariants in 165 ms
[2023-03-15 08:16:34] [INFO ] [Real]Absence check using 145 positive place invariants in 49 ms returned sat
Reachability property qltransition_31 is true.
[2023-03-15 08:16:34] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
SDD proceeding with computation,35 properties remain. new max is 2
SDD size :1 after 2
Reachability property qltransition_32 is true.
SDD proceeding with computation,34 properties remain. new max is 2
SDD size :2 after 3
Reachability property qltransition_35 is true.
Reachability property qltransition_16 is true.
SDD proceeding with computation,32 properties remain. new max is 2
SDD size :3 after 6
Reachability property qltransition_27 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,29 properties remain. new max is 2
SDD size :6 after 14
Reachability property qltransition_21 is true.
SDD proceeding with computation,28 properties remain. new max is 2
SDD size :14 after 15
Reachability property qltransition_6 is true.
SDD proceeding with computation,27 properties remain. new max is 2
SDD size :15 after 16
SDD proceeding with computation,27 properties remain. new max is 4
SDD size :16 after 17
SDD proceeding with computation,27 properties remain. new max is 8
SDD size :17 after 18
SDD proceeding with computation,27 properties remain. new max is 16
SDD size :18 after 19
Reachability property qltransition_25 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,23 properties remain. new max is 16
SDD size :19 after 28
Reachability property qltransition_36 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
Reachability property qltransition_8 is true.
SDD proceeding with computation,19 properties remain. new max is 16
SDD size :28 after 32
SDD proceeding with computation,19 properties remain. new max is 32
SDD size :32 after 33
Reachability property qltransition_30 is true.
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :33 after 34
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :34 after 42
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :42 after 43
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :43 after 56
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :56 after 70
Reachability property qltransition_34 is true.
Reachability property qltransition_28 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :70 after 83
[2023-03-15 08:16:38] [INFO ] After 4445ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:15
[2023-03-15 08:16:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:16:39] [INFO ] After 304ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:15
[2023-03-15 08:16:39] [INFO ] After 656ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:15
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-15 08:16:39] [INFO ] After 6482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:15
Reachability property qltransition_33 is true.
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :83 after 106
[2023-03-15 08:16:40] [INFO ] [Nat]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-15 08:16:40] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 39 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :106 after 129
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :129 after 172
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :172 after 258
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :258 after 408
Reachability property qltransition_24 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_13 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :408 after 1752
[2023-03-15 08:17:04] [INFO ] After 24066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-15 08:17:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:17:04] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:15
Parikh walk visited 0 properties in 444 ms.
Support contains 206 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 1224 transition count 2745
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 140 place count 1159 transition count 2745
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 140 place count 1159 transition count 2682
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 266 place count 1096 transition count 2682
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 270 place count 1094 transition count 2680
Applied a total of 270 rules in 400 ms. Remains 1094 /1234 variables (removed 140) and now considering 2680/2810 (removed 130) transitions.
[2023-03-15 08:17:05] [INFO ] Flow matrix only has 2671 transitions (discarded 9 similar events)
// Phase 1: matrix 2671 rows 1094 cols
[2023-03-15 08:17:05] [INFO ] Computed 142 place invariants in 93 ms
[2023-03-15 08:17:07] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1094/1234 places, 2065/2810 transitions.
Applied a total of 0 rules in 91 ms. Remains 1094 /1094 variables (removed 0) and now considering 2065/2065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1933 ms. Remains : 1094/1234 places, 2065/2810 transitions.
Incomplete random walk after 1000000 steps, including 64377 resets, run finished after 8448 ms. (steps per millisecond=118 ) properties (out of 9) seen :8
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :1752 after 3075
Incomplete Best-First random walk after 1000001 steps, including 7086 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:17:17] [INFO ] Flow matrix only has 2056 transitions (discarded 9 similar events)
// Phase 1: matrix 2056 rows 1094 cols
[2023-03-15 08:17:17] [INFO ] Computed 142 place invariants in 61 ms
[2023-03-15 08:17:17] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2023-03-15 08:17:17] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-15 08:17:17] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:17:18] [INFO ] [Nat]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-15 08:17:18] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 41 ms returned sat
[2023-03-15 08:17:18] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:17:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:17:19] [INFO ] After 507ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:17:19] [INFO ] Deduced a trap composed of 455 places in 526 ms of which 1 ms to minimize.
[2023-03-15 08:17:20] [INFO ] Deduced a trap composed of 465 places in 537 ms of which 1 ms to minimize.
[2023-03-15 08:17:21] [INFO ] Deduced a trap composed of 443 places in 548 ms of which 1 ms to minimize.
[2023-03-15 08:17:21] [INFO ] Deduced a trap composed of 457 places in 527 ms of which 1 ms to minimize.
[2023-03-15 08:17:22] [INFO ] Deduced a trap composed of 482 places in 544 ms of which 2 ms to minimize.
[2023-03-15 08:17:23] [INFO ] Deduced a trap composed of 451 places in 517 ms of which 1 ms to minimize.
[2023-03-15 08:17:23] [INFO ] Deduced a trap composed of 465 places in 526 ms of which 1 ms to minimize.
[2023-03-15 08:17:24] [INFO ] Deduced a trap composed of 447 places in 520 ms of which 1 ms to minimize.
[2023-03-15 08:17:25] [INFO ] Deduced a trap composed of 451 places in 518 ms of which 1 ms to minimize.
[2023-03-15 08:17:25] [INFO ] Deduced a trap composed of 433 places in 534 ms of which 1 ms to minimize.
[2023-03-15 08:17:26] [INFO ] Deduced a trap composed of 445 places in 531 ms of which 1 ms to minimize.
[2023-03-15 08:17:27] [INFO ] Deduced a trap composed of 539 places in 530 ms of which 1 ms to minimize.
[2023-03-15 08:17:27] [INFO ] Deduced a trap composed of 451 places in 510 ms of which 1 ms to minimize.
[2023-03-15 08:17:28] [INFO ] Deduced a trap composed of 463 places in 516 ms of which 1 ms to minimize.
[2023-03-15 08:17:29] [INFO ] Deduced a trap composed of 455 places in 510 ms of which 0 ms to minimize.
[2023-03-15 08:17:29] [INFO ] Deduced a trap composed of 459 places in 514 ms of which 1 ms to minimize.
[2023-03-15 08:17:30] [INFO ] Deduced a trap composed of 453 places in 529 ms of which 1 ms to minimize.
[2023-03-15 08:17:30] [INFO ] Deduced a trap composed of 449 places in 527 ms of which 1 ms to minimize.
[2023-03-15 08:17:31] [INFO ] Deduced a trap composed of 453 places in 527 ms of which 1 ms to minimize.
[2023-03-15 08:17:32] [INFO ] Deduced a trap composed of 455 places in 533 ms of which 1 ms to minimize.
[2023-03-15 08:17:32] [INFO ] Deduced a trap composed of 447 places in 530 ms of which 2 ms to minimize.
[2023-03-15 08:17:33] [INFO ] Deduced a trap composed of 457 places in 519 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :3075 after 6236
[2023-03-15 08:17:42] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 23050 ms
[2023-03-15 08:17:42] [INFO ] After 23749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:17:42] [INFO ] After 24676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 1094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1094/1094 places, 2065/2065 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 1094 transition count 2064
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1093 transition count 2064
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1093 transition count 2062
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1091 transition count 2062
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 2 with 2 rules applied. Total rules applied 8 place count 1090 transition count 2061
Applied a total of 8 rules in 217 ms. Remains 1090 /1094 variables (removed 4) and now considering 2061/2065 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 1090/1094 places, 2061/2065 transitions.
Incomplete random walk after 1000000 steps, including 72659 resets, run finished after 11742 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7205 resets, run finished after 2157 ms. (steps per millisecond=463 ) properties (out of 1) seen :0
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :6236 after 12970
Interrupted probabilistic random walk after 3831131 steps, run timeout after 39001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 3831131 steps, saw 641929 distinct states, run finished after 39008 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:18:35] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 08:18:35] [INFO ] Computed 142 place invariants in 116 ms
[2023-03-15 08:18:36] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 08:18:36] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 08:18:36] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:18:36] [INFO ] [Nat]Absence check using 135 positive place invariants in 55 ms returned sat
[2023-03-15 08:18:36] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 58 ms returned sat
[2023-03-15 08:18:37] [INFO ] After 1079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:18:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:18:38] [INFO ] After 1103ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:18:39] [INFO ] Deduced a trap composed of 430 places in 497 ms of which 1 ms to minimize.
[2023-03-15 08:18:39] [INFO ] Deduced a trap composed of 432 places in 512 ms of which 1 ms to minimize.
[2023-03-15 08:18:40] [INFO ] Deduced a trap composed of 442 places in 520 ms of which 11 ms to minimize.
[2023-03-15 08:18:40] [INFO ] Deduced a trap composed of 438 places in 509 ms of which 1 ms to minimize.
[2023-03-15 08:18:41] [INFO ] Deduced a trap composed of 442 places in 873 ms of which 1 ms to minimize.
[2023-03-15 08:18:42] [INFO ] Deduced a trap composed of 440 places in 883 ms of which 2 ms to minimize.
[2023-03-15 08:18:44] [INFO ] Deduced a trap composed of 440 places in 934 ms of which 1 ms to minimize.
[2023-03-15 08:18:45] [INFO ] Deduced a trap composed of 436 places in 949 ms of which 1 ms to minimize.
[2023-03-15 08:18:46] [INFO ] Deduced a trap composed of 446 places in 917 ms of which 1 ms to minimize.
[2023-03-15 08:18:47] [INFO ] Deduced a trap composed of 436 places in 919 ms of which 1 ms to minimize.
[2023-03-15 08:18:47] [INFO ] Deduced a trap composed of 442 places in 514 ms of which 1 ms to minimize.
[2023-03-15 08:18:48] [INFO ] Deduced a trap composed of 444 places in 551 ms of which 8 ms to minimize.
[2023-03-15 08:18:49] [INFO ] Deduced a trap composed of 446 places in 518 ms of which 1 ms to minimize.
[2023-03-15 08:18:50] [INFO ] Deduced a trap composed of 440 places in 849 ms of which 1 ms to minimize.
[2023-03-15 08:18:51] [INFO ] Deduced a trap composed of 436 places in 843 ms of which 1 ms to minimize.
[2023-03-15 08:18:52] [INFO ] Deduced a trap composed of 450 places in 861 ms of which 2 ms to minimize.
[2023-03-15 08:18:53] [INFO ] Deduced a trap composed of 442 places in 491 ms of which 3 ms to minimize.
[2023-03-15 08:18:54] [INFO ] Deduced a trap composed of 444 places in 502 ms of which 10 ms to minimize.
[2023-03-15 08:18:54] [INFO ] Deduced a trap composed of 444 places in 509 ms of which 11 ms to minimize.
[2023-03-15 08:18:55] [INFO ] Deduced a trap composed of 434 places in 868 ms of which 24 ms to minimize.
[2023-03-15 08:18:56] [INFO ] Deduced a trap composed of 448 places in 507 ms of which 1 ms to minimize.
[2023-03-15 08:18:57] [INFO ] Deduced a trap composed of 448 places in 493 ms of which 1 ms to minimize.
[2023-03-15 08:18:58] [INFO ] Deduced a trap composed of 432 places in 504 ms of which 1 ms to minimize.
[2023-03-15 08:18:59] [INFO ] Deduced a trap composed of 440 places in 510 ms of which 1 ms to minimize.
[2023-03-15 08:19:00] [INFO ] Deduced a trap composed of 440 places in 510 ms of which 1 ms to minimize.
[2023-03-15 08:19:00] [INFO ] Deduced a trap composed of 436 places in 462 ms of which 1 ms to minimize.
[2023-03-15 08:19:01] [INFO ] Deduced a trap composed of 434 places in 465 ms of which 1 ms to minimize.
[2023-03-15 08:19:01] [INFO ] Deduced a trap composed of 448 places in 491 ms of which 2 ms to minimize.
[2023-03-15 08:19:02] [INFO ] Deduced a trap composed of 436 places in 492 ms of which 1 ms to minimize.
[2023-03-15 08:19:03] [INFO ] Deduced a trap composed of 442 places in 488 ms of which 1 ms to minimize.
[2023-03-15 08:19:03] [INFO ] Deduced a trap composed of 456 places in 500 ms of which 1 ms to minimize.
[2023-03-15 08:19:04] [INFO ] Deduced a trap composed of 434 places in 491 ms of which 1 ms to minimize.
[2023-03-15 08:19:04] [INFO ] Deduced a trap composed of 434 places in 504 ms of which 10 ms to minimize.
[2023-03-15 08:19:05] [INFO ] Deduced a trap composed of 452 places in 487 ms of which 1 ms to minimize.
[2023-03-15 08:19:05] [INFO ] Deduced a trap composed of 446 places in 494 ms of which 1 ms to minimize.
[2023-03-15 08:19:09] [INFO ] Deduced a trap composed of 440 places in 887 ms of which 2 ms to minimize.
[2023-03-15 08:19:10] [INFO ] Deduced a trap composed of 438 places in 932 ms of which 1 ms to minimize.
[2023-03-15 08:19:11] [INFO ] Deduced a trap composed of 446 places in 456 ms of which 0 ms to minimize.
[2023-03-15 08:19:11] [INFO ] Deduced a trap composed of 444 places in 467 ms of which 1 ms to minimize.
[2023-03-15 08:19:13] [INFO ] Deduced a trap composed of 452 places in 468 ms of which 1 ms to minimize.
[2023-03-15 08:19:14] [INFO ] Deduced a trap composed of 448 places in 463 ms of which 2 ms to minimize.
[2023-03-15 08:19:15] [INFO ] Deduced a trap composed of 458 places in 457 ms of which 1 ms to minimize.
[2023-03-15 08:19:15] [INFO ] Deduced a trap composed of 440 places in 456 ms of which 0 ms to minimize.
[2023-03-15 08:19:16] [INFO ] Deduced a trap composed of 448 places in 477 ms of which 3 ms to minimize.
[2023-03-15 08:19:18] [INFO ] Deduced a trap composed of 438 places in 479 ms of which 9 ms to minimize.
[2023-03-15 08:19:18] [INFO ] Deduced a trap composed of 436 places in 470 ms of which 2 ms to minimize.
[2023-03-15 08:19:19] [INFO ] Deduced a trap composed of 438 places in 470 ms of which 1 ms to minimize.
[2023-03-15 08:19:20] [INFO ] Deduced a trap composed of 434 places in 471 ms of which 1 ms to minimize.
[2023-03-15 08:19:22] [INFO ] Deduced a trap composed of 446 places in 458 ms of which 1 ms to minimize.
[2023-03-15 08:19:23] [INFO ] Deduced a trap composed of 448 places in 461 ms of which 1 ms to minimize.
[2023-03-15 08:19:23] [INFO ] Deduced a trap composed of 440 places in 454 ms of which 1 ms to minimize.
[2023-03-15 08:19:24] [INFO ] Deduced a trap composed of 452 places in 482 ms of which 3 ms to minimize.
[2023-03-15 08:19:25] [INFO ] Deduced a trap composed of 440 places in 479 ms of which 1 ms to minimize.
[2023-03-15 08:19:27] [INFO ] Deduced a trap composed of 438 places in 461 ms of which 1 ms to minimize.
[2023-03-15 08:19:28] [INFO ] Deduced a trap composed of 434 places in 466 ms of which 1 ms to minimize.
[2023-03-15 08:19:29] [INFO ] Deduced a trap composed of 440 places in 460 ms of which 0 ms to minimize.
[2023-03-15 08:19:30] [INFO ] Deduced a trap composed of 442 places in 458 ms of which 0 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 131072
SDD size :12970 after 27362
[2023-03-15 08:19:31] [INFO ] Deduced a trap composed of 420 places in 528 ms of which 1 ms to minimize.
[2023-03-15 08:19:32] [INFO ] Deduced a trap composed of 440 places in 501 ms of which 1 ms to minimize.
[2023-03-15 08:19:32] [INFO ] Deduced a trap composed of 434 places in 483 ms of which 1 ms to minimize.
[2023-03-15 08:19:34] [INFO ] Deduced a trap composed of 446 places in 469 ms of which 1 ms to minimize.
[2023-03-15 08:19:43] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 64535 ms
[2023-03-15 08:19:43] [INFO ] After 65828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:19:43] [INFO ] After 67305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 77 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 52 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 08:19:43] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:19:43] [INFO ] Invariant cache hit.
[2023-03-15 08:19:44] [INFO ] Implicit Places using invariants in 867 ms returned []
[2023-03-15 08:19:44] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:19:44] [INFO ] Invariant cache hit.
[2023-03-15 08:19:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:19:56] [INFO ] Implicit Places using invariants and state equation in 11905 ms returned []
Implicit Place search using SMT with State Equation took 12788 ms to find 0 implicit places.
[2023-03-15 08:19:56] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-15 08:19:56] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:19:56] [INFO ] Invariant cache hit.
[2023-03-15 08:19:57] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14134 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7296 resets, run finished after 1144 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:19:58] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:19:58] [INFO ] Invariant cache hit.
[2023-03-15 08:19:58] [INFO ] [Real]Absence check using 135 positive place invariants in 43 ms returned sat
[2023-03-15 08:19:58] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 08:19:59] [INFO ] After 596ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:19:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:19:59] [INFO ] After 196ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:19:59] [INFO ] After 309ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:19:59] [INFO ] After 1124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:20:00] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 08:20:00] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 08:20:00] [INFO ] After 616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:20:01] [INFO ] After 861ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:20:02] [INFO ] Deduced a trap composed of 438 places in 453 ms of which 1 ms to minimize.
[2023-03-15 08:20:02] [INFO ] Deduced a trap composed of 444 places in 508 ms of which 1 ms to minimize.
[2023-03-15 08:20:03] [INFO ] Deduced a trap composed of 442 places in 501 ms of which 1 ms to minimize.
[2023-03-15 08:20:03] [INFO ] Deduced a trap composed of 452 places in 458 ms of which 1 ms to minimize.
[2023-03-15 08:20:04] [INFO ] Deduced a trap composed of 440 places in 459 ms of which 1 ms to minimize.
[2023-03-15 08:20:04] [INFO ] Deduced a trap composed of 432 places in 504 ms of which 1 ms to minimize.
[2023-03-15 08:20:05] [INFO ] Deduced a trap composed of 442 places in 473 ms of which 1 ms to minimize.
[2023-03-15 08:20:06] [INFO ] Deduced a trap composed of 450 places in 459 ms of which 1 ms to minimize.
[2023-03-15 08:20:06] [INFO ] Deduced a trap composed of 442 places in 456 ms of which 1 ms to minimize.
[2023-03-15 08:20:07] [INFO ] Deduced a trap composed of 442 places in 457 ms of which 1 ms to minimize.
[2023-03-15 08:20:07] [INFO ] Deduced a trap composed of 444 places in 443 ms of which 1 ms to minimize.
[2023-03-15 08:20:08] [INFO ] Deduced a trap composed of 444 places in 459 ms of which 1 ms to minimize.
[2023-03-15 08:20:09] [INFO ] Deduced a trap composed of 428 places in 441 ms of which 1 ms to minimize.
[2023-03-15 08:20:09] [INFO ] Deduced a trap composed of 446 places in 436 ms of which 1 ms to minimize.
[2023-03-15 08:20:10] [INFO ] Deduced a trap composed of 446 places in 425 ms of which 1 ms to minimize.
[2023-03-15 08:20:10] [INFO ] Deduced a trap composed of 448 places in 441 ms of which 1 ms to minimize.
[2023-03-15 08:20:11] [INFO ] Deduced a trap composed of 444 places in 449 ms of which 1 ms to minimize.
[2023-03-15 08:20:12] [INFO ] Deduced a trap composed of 438 places in 447 ms of which 1 ms to minimize.
[2023-03-15 08:20:12] [INFO ] Deduced a trap composed of 446 places in 455 ms of which 1 ms to minimize.
[2023-03-15 08:20:13] [INFO ] Deduced a trap composed of 444 places in 450 ms of which 1 ms to minimize.
[2023-03-15 08:20:14] [INFO ] Deduced a trap composed of 426 places in 430 ms of which 1 ms to minimize.
[2023-03-15 08:20:14] [INFO ] Deduced a trap composed of 446 places in 438 ms of which 1 ms to minimize.
[2023-03-15 08:20:15] [INFO ] Deduced a trap composed of 436 places in 437 ms of which 0 ms to minimize.
[2023-03-15 08:20:15] [INFO ] Deduced a trap composed of 438 places in 438 ms of which 1 ms to minimize.
[2023-03-15 08:20:16] [INFO ] Deduced a trap composed of 446 places in 444 ms of which 1 ms to minimize.
[2023-03-15 08:20:17] [INFO ] Deduced a trap composed of 452 places in 514 ms of which 1 ms to minimize.
[2023-03-15 08:20:17] [INFO ] Deduced a trap composed of 446 places in 451 ms of which 1 ms to minimize.
[2023-03-15 08:20:18] [INFO ] Deduced a trap composed of 444 places in 460 ms of which 1 ms to minimize.
[2023-03-15 08:20:19] [INFO ] Deduced a trap composed of 446 places in 464 ms of which 3 ms to minimize.
[2023-03-15 08:20:19] [INFO ] Deduced a trap composed of 444 places in 449 ms of which 1 ms to minimize.
[2023-03-15 08:20:20] [INFO ] Deduced a trap composed of 428 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:20:20] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-15 08:20:21] [INFO ] Deduced a trap composed of 444 places in 447 ms of which 1 ms to minimize.
[2023-03-15 08:20:21] [INFO ] Deduced a trap composed of 436 places in 433 ms of which 0 ms to minimize.
[2023-03-15 08:20:22] [INFO ] Deduced a trap composed of 424 places in 432 ms of which 1 ms to minimize.
[2023-03-15 08:20:22] [INFO ] Deduced a trap composed of 426 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:20:23] [INFO ] Deduced a trap composed of 444 places in 469 ms of which 1 ms to minimize.
[2023-03-15 08:20:27] [INFO ] Deduced a trap composed of 442 places in 482 ms of which 1 ms to minimize.
[2023-03-15 08:20:28] [INFO ] Deduced a trap composed of 436 places in 468 ms of which 2 ms to minimize.
[2023-03-15 08:20:30] [INFO ] Deduced a trap composed of 440 places in 504 ms of which 1 ms to minimize.
[2023-03-15 08:20:30] [INFO ] Deduced a trap composed of 438 places in 487 ms of which 1 ms to minimize.
[2023-03-15 08:20:36] [INFO ] Deduced a trap composed of 434 places in 486 ms of which 1 ms to minimize.
[2023-03-15 08:20:36] [INFO ] Deduced a trap composed of 448 places in 488 ms of which 1 ms to minimize.
[2023-03-15 08:20:45] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 44263 ms
[2023-03-15 08:20:46] [INFO ] After 45363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:20:46] [INFO ] After 46176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
SDD proceeding with computation,10 properties remain. new max is 262144
SDD size :27362 after 54795
Incomplete random walk after 1000000 steps, including 72467 resets, run finished after 10186 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7189 resets, run finished after 1959 ms. (steps per millisecond=510 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3540768 steps, run timeout after 36001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 3540768 steps, saw 590308 distinct states, run finished after 36001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:21:34] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:21:34] [INFO ] Invariant cache hit.
[2023-03-15 08:21:34] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-15 08:21:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 08:21:34] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:21:34] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 08:21:34] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 08:21:35] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:21:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:21:36] [INFO ] After 825ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:21:36] [INFO ] Deduced a trap composed of 442 places in 433 ms of which 1 ms to minimize.
[2023-03-15 08:21:37] [INFO ] Deduced a trap composed of 446 places in 434 ms of which 0 ms to minimize.
[2023-03-15 08:21:37] [INFO ] Deduced a trap composed of 438 places in 429 ms of which 1 ms to minimize.
[2023-03-15 08:21:38] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 1 ms to minimize.
[2023-03-15 08:21:38] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 1 ms to minimize.
[2023-03-15 08:21:39] [INFO ] Deduced a trap composed of 446 places in 440 ms of which 1 ms to minimize.
[2023-03-15 08:21:39] [INFO ] Deduced a trap composed of 442 places in 462 ms of which 1 ms to minimize.
[2023-03-15 08:21:40] [INFO ] Deduced a trap composed of 450 places in 458 ms of which 1 ms to minimize.
[2023-03-15 08:21:40] [INFO ] Deduced a trap composed of 440 places in 453 ms of which 1 ms to minimize.
[2023-03-15 08:21:41] [INFO ] Deduced a trap composed of 450 places in 447 ms of which 1 ms to minimize.
[2023-03-15 08:21:42] [INFO ] Deduced a trap composed of 446 places in 463 ms of which 1 ms to minimize.
[2023-03-15 08:21:43] [INFO ] Deduced a trap composed of 444 places in 498 ms of which 1 ms to minimize.
[2023-03-15 08:21:43] [INFO ] Deduced a trap composed of 440 places in 504 ms of which 1 ms to minimize.
[2023-03-15 08:21:44] [INFO ] Deduced a trap composed of 434 places in 506 ms of which 1 ms to minimize.
[2023-03-15 08:21:44] [INFO ] Deduced a trap composed of 434 places in 508 ms of which 1 ms to minimize.
[2023-03-15 08:21:45] [INFO ] Deduced a trap composed of 436 places in 510 ms of which 6 ms to minimize.
[2023-03-15 08:21:46] [INFO ] Deduced a trap composed of 432 places in 492 ms of which 1 ms to minimize.
[2023-03-15 08:21:46] [INFO ] Deduced a trap composed of 448 places in 474 ms of which 1 ms to minimize.
[2023-03-15 08:21:47] [INFO ] Deduced a trap composed of 440 places in 453 ms of which 1 ms to minimize.
[2023-03-15 08:21:48] [INFO ] Deduced a trap composed of 448 places in 426 ms of which 1 ms to minimize.
[2023-03-15 08:21:48] [INFO ] Deduced a trap composed of 444 places in 470 ms of which 1 ms to minimize.
[2023-03-15 08:21:49] [INFO ] Deduced a trap composed of 434 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:21:50] [INFO ] Deduced a trap composed of 434 places in 459 ms of which 1 ms to minimize.
[2023-03-15 08:21:50] [INFO ] Deduced a trap composed of 441 places in 467 ms of which 1 ms to minimize.
[2023-03-15 08:21:51] [INFO ] Deduced a trap composed of 444 places in 486 ms of which 1 ms to minimize.
[2023-03-15 08:21:51] [INFO ] Deduced a trap composed of 440 places in 491 ms of which 1 ms to minimize.
[2023-03-15 08:21:52] [INFO ] Deduced a trap composed of 444 places in 485 ms of which 1 ms to minimize.
[2023-03-15 08:21:53] [INFO ] Deduced a trap composed of 430 places in 485 ms of which 1 ms to minimize.
[2023-03-15 08:21:53] [INFO ] Deduced a trap composed of 446 places in 493 ms of which 1 ms to minimize.
[2023-03-15 08:21:54] [INFO ] Deduced a trap composed of 444 places in 498 ms of which 1 ms to minimize.
[2023-03-15 08:21:55] [INFO ] Deduced a trap composed of 438 places in 482 ms of which 1 ms to minimize.
[2023-03-15 08:21:56] [INFO ] Deduced a trap composed of 440 places in 494 ms of which 1 ms to minimize.
[2023-03-15 08:22:00] [INFO ] Deduced a trap composed of 446 places in 508 ms of which 1 ms to minimize.
[2023-03-15 08:22:01] [INFO ] Deduced a trap composed of 456 places in 494 ms of which 1 ms to minimize.
[2023-03-15 08:22:01] [INFO ] Deduced a trap composed of 444 places in 503 ms of which 1 ms to minimize.
[2023-03-15 08:22:02] [INFO ] Deduced a trap composed of 440 places in 483 ms of which 1 ms to minimize.
[2023-03-15 08:22:04] [INFO ] Deduced a trap composed of 442 places in 490 ms of which 1 ms to minimize.
[2023-03-15 08:22:04] [INFO ] Deduced a trap composed of 444 places in 486 ms of which 1 ms to minimize.
[2023-03-15 08:22:05] [INFO ] Deduced a trap composed of 460 places in 482 ms of which 1 ms to minimize.
[2023-03-15 08:22:06] [INFO ] Deduced a trap composed of 448 places in 490 ms of which 1 ms to minimize.
[2023-03-15 08:22:06] [INFO ] Deduced a trap composed of 448 places in 480 ms of which 1 ms to minimize.
[2023-03-15 08:22:07] [INFO ] Deduced a trap composed of 446 places in 472 ms of which 1 ms to minimize.
[2023-03-15 08:22:08] [INFO ] Deduced a trap composed of 448 places in 484 ms of which 1 ms to minimize.
[2023-03-15 08:22:11] [INFO ] Deduced a trap composed of 450 places in 479 ms of which 0 ms to minimize.
[2023-03-15 08:22:12] [INFO ] Deduced a trap composed of 448 places in 482 ms of which 1 ms to minimize.
[2023-03-15 08:22:15] [INFO ] Deduced a trap composed of 438 places in 494 ms of which 1 ms to minimize.
[2023-03-15 08:22:16] [INFO ] Deduced a trap composed of 459 places in 505 ms of which 1 ms to minimize.
[2023-03-15 08:22:17] [INFO ] Deduced a trap composed of 444 places in 502 ms of which 1 ms to minimize.
[2023-03-15 08:22:23] [INFO ] Deduced a trap composed of 430 places in 492 ms of which 1 ms to minimize.
[2023-03-15 08:22:32] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 56611 ms
[2023-03-15 08:22:32] [INFO ] After 57500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:22:32] [INFO ] After 58364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 48 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 46 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 08:22:32] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:22:32] [INFO ] Invariant cache hit.
[2023-03-15 08:22:33] [INFO ] Implicit Places using invariants in 927 ms returned []
[2023-03-15 08:22:33] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:22:33] [INFO ] Invariant cache hit.
[2023-03-15 08:22:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:22:42] [INFO ] Implicit Places using invariants and state equation in 8362 ms returned []
Implicit Place search using SMT with State Equation took 9297 ms to find 0 implicit places.
[2023-03-15 08:22:42] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-15 08:22:42] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:22:42] [INFO ] Invariant cache hit.
[2023-03-15 08:22:43] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10555 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7286 resets, run finished after 1015 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:22:44] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:22:44] [INFO ] Invariant cache hit.
[2023-03-15 08:22:44] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 08:22:44] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 08:22:45] [INFO ] After 576ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:22:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:22:45] [INFO ] After 218ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:22:45] [INFO ] After 357ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:22:45] [INFO ] After 1140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:22:45] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 08:22:45] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 08:22:46] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:22:47] [INFO ] After 868ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:22:48] [INFO ] Deduced a trap composed of 438 places in 919 ms of which 1 ms to minimize.
[2023-03-15 08:22:49] [INFO ] Deduced a trap composed of 444 places in 895 ms of which 1 ms to minimize.
[2023-03-15 08:22:50] [INFO ] Deduced a trap composed of 442 places in 927 ms of which 1 ms to minimize.
[2023-03-15 08:22:51] [INFO ] Deduced a trap composed of 452 places in 858 ms of which 1 ms to minimize.
[2023-03-15 08:22:52] [INFO ] Deduced a trap composed of 440 places in 916 ms of which 1 ms to minimize.
[2023-03-15 08:22:52] [INFO ] Deduced a trap composed of 432 places in 612 ms of which 1 ms to minimize.
[2023-03-15 08:22:53] [INFO ] Deduced a trap composed of 442 places in 444 ms of which 1 ms to minimize.
[2023-03-15 08:22:53] [INFO ] Deduced a trap composed of 450 places in 451 ms of which 1 ms to minimize.
[2023-03-15 08:22:54] [INFO ] Deduced a trap composed of 442 places in 446 ms of which 1 ms to minimize.
[2023-03-15 08:22:54] [INFO ] Deduced a trap composed of 442 places in 463 ms of which 1 ms to minimize.
[2023-03-15 08:22:55] [INFO ] Deduced a trap composed of 444 places in 441 ms of which 1 ms to minimize.
[2023-03-15 08:22:56] [INFO ] Deduced a trap composed of 444 places in 447 ms of which 1 ms to minimize.
[2023-03-15 08:22:56] [INFO ] Deduced a trap composed of 428 places in 459 ms of which 1 ms to minimize.
[2023-03-15 08:22:57] [INFO ] Deduced a trap composed of 446 places in 450 ms of which 1 ms to minimize.
[2023-03-15 08:22:58] [INFO ] Deduced a trap composed of 446 places in 437 ms of which 1 ms to minimize.
[2023-03-15 08:22:58] [INFO ] Deduced a trap composed of 448 places in 432 ms of which 1 ms to minimize.
[2023-03-15 08:22:59] [INFO ] Deduced a trap composed of 444 places in 437 ms of which 1 ms to minimize.
[2023-03-15 08:23:00] [INFO ] Deduced a trap composed of 438 places in 433 ms of which 1 ms to minimize.
[2023-03-15 08:23:00] [INFO ] Deduced a trap composed of 446 places in 491 ms of which 0 ms to minimize.
[2023-03-15 08:23:01] [INFO ] Deduced a trap composed of 444 places in 498 ms of which 1 ms to minimize.
[2023-03-15 08:23:02] [INFO ] Deduced a trap composed of 426 places in 493 ms of which 1 ms to minimize.
[2023-03-15 08:23:03] [INFO ] Deduced a trap composed of 446 places in 948 ms of which 1 ms to minimize.
[2023-03-15 08:23:04] [INFO ] Deduced a trap composed of 436 places in 898 ms of which 1 ms to minimize.
[2023-03-15 08:23:05] [INFO ] Deduced a trap composed of 438 places in 936 ms of which 2 ms to minimize.
[2023-03-15 08:23:06] [INFO ] Deduced a trap composed of 446 places in 898 ms of which 2 ms to minimize.
[2023-03-15 08:23:07] [INFO ] Deduced a trap composed of 452 places in 512 ms of which 1 ms to minimize.
[2023-03-15 08:23:07] [INFO ] Deduced a trap composed of 446 places in 501 ms of which 1 ms to minimize.
[2023-03-15 08:23:08] [INFO ] Deduced a trap composed of 444 places in 497 ms of which 1 ms to minimize.
[2023-03-15 08:23:09] [INFO ] Deduced a trap composed of 446 places in 490 ms of which 1 ms to minimize.
[2023-03-15 08:23:09] [INFO ] Deduced a trap composed of 444 places in 501 ms of which 1 ms to minimize.
[2023-03-15 08:23:10] [INFO ] Deduced a trap composed of 428 places in 503 ms of which 1 ms to minimize.
[2023-03-15 08:23:11] [INFO ] Deduced a trap composed of 440 places in 495 ms of which 1 ms to minimize.
[2023-03-15 08:23:11] [INFO ] Deduced a trap composed of 444 places in 499 ms of which 1 ms to minimize.
[2023-03-15 08:23:12] [INFO ] Deduced a trap composed of 436 places in 510 ms of which 1 ms to minimize.
[2023-03-15 08:23:12] [INFO ] Deduced a trap composed of 424 places in 513 ms of which 1 ms to minimize.
[2023-03-15 08:23:13] [INFO ] Deduced a trap composed of 426 places in 506 ms of which 1 ms to minimize.
[2023-03-15 08:23:14] [INFO ] Deduced a trap composed of 444 places in 519 ms of which 1 ms to minimize.
[2023-03-15 08:23:17] [INFO ] Deduced a trap composed of 442 places in 508 ms of which 1 ms to minimize.
[2023-03-15 08:23:19] [INFO ] Deduced a trap composed of 436 places in 444 ms of which 0 ms to minimize.
[2023-03-15 08:23:20] [INFO ] Deduced a trap composed of 440 places in 447 ms of which 1 ms to minimize.
[2023-03-15 08:23:21] [INFO ] Deduced a trap composed of 438 places in 457 ms of which 1 ms to minimize.
[2023-03-15 08:23:27] [INFO ] Deduced a trap composed of 434 places in 495 ms of which 1 ms to minimize.
[2023-03-15 08:23:27] [INFO ] Deduced a trap composed of 448 places in 487 ms of which 1 ms to minimize.
[2023-03-15 08:23:36] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 49470 ms
[2023-03-15 08:23:37] [INFO ] After 50625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:23:37] [INFO ] After 51408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 751 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 327388 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327388 steps, saw 53294 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:23:40] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:23:40] [INFO ] Invariant cache hit.
[2023-03-15 08:23:40] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 08:23:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 08:23:40] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:23:40] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 08:23:40] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 08:23:41] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:23:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:23:41] [INFO ] After 664ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:23:42] [INFO ] Deduced a trap composed of 446 places in 449 ms of which 1 ms to minimize.
[2023-03-15 08:23:42] [INFO ] Deduced a trap composed of 436 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:23:43] [INFO ] Deduced a trap composed of 448 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:23:43] [INFO ] Deduced a trap composed of 448 places in 433 ms of which 1 ms to minimize.
[2023-03-15 08:23:44] [INFO ] Deduced a trap composed of 444 places in 438 ms of which 1 ms to minimize.
[2023-03-15 08:23:45] [INFO ] Deduced a trap composed of 452 places in 439 ms of which 1 ms to minimize.
[2023-03-15 08:23:45] [INFO ] Deduced a trap composed of 440 places in 442 ms of which 1 ms to minimize.
[2023-03-15 08:23:46] [INFO ] Deduced a trap composed of 432 places in 433 ms of which 0 ms to minimize.
[2023-03-15 08:23:46] [INFO ] Deduced a trap composed of 442 places in 436 ms of which 1 ms to minimize.
[2023-03-15 08:23:47] [INFO ] Deduced a trap composed of 446 places in 442 ms of which 1 ms to minimize.
[2023-03-15 08:23:47] [INFO ] Deduced a trap composed of 436 places in 516 ms of which 1 ms to minimize.
[2023-03-15 08:23:48] [INFO ] Deduced a trap composed of 434 places in 442 ms of which 1 ms to minimize.
[2023-03-15 08:23:48] [INFO ] Deduced a trap composed of 436 places in 452 ms of which 2 ms to minimize.
[2023-03-15 08:23:49] [INFO ] Deduced a trap composed of 452 places in 458 ms of which 1 ms to minimize.
[2023-03-15 08:23:50] [INFO ] Deduced a trap composed of 444 places in 458 ms of which 1 ms to minimize.
[2023-03-15 08:23:50] [INFO ] Deduced a trap composed of 434 places in 443 ms of which 1 ms to minimize.
[2023-03-15 08:23:51] [INFO ] Deduced a trap composed of 430 places in 502 ms of which 1 ms to minimize.
[2023-03-15 08:23:51] [INFO ] Deduced a trap composed of 440 places in 490 ms of which 1 ms to minimize.
[2023-03-15 08:23:52] [INFO ] Deduced a trap composed of 444 places in 500 ms of which 1 ms to minimize.
[2023-03-15 08:23:53] [INFO ] Deduced a trap composed of 438 places in 499 ms of which 1 ms to minimize.
[2023-03-15 08:23:53] [INFO ] Deduced a trap composed of 448 places in 489 ms of which 1 ms to minimize.
[2023-03-15 08:23:54] [INFO ] Deduced a trap composed of 430 places in 510 ms of which 1 ms to minimize.
[2023-03-15 08:23:54] [INFO ] Deduced a trap composed of 454 places in 506 ms of which 1 ms to minimize.
[2023-03-15 08:23:55] [INFO ] Deduced a trap composed of 450 places in 492 ms of which 1 ms to minimize.
[2023-03-15 08:23:56] [INFO ] Deduced a trap composed of 442 places in 521 ms of which 1 ms to minimize.
[2023-03-15 08:23:58] [INFO ] Deduced a trap composed of 450 places in 448 ms of which 1 ms to minimize.
[2023-03-15 08:23:58] [INFO ] Deduced a trap composed of 450 places in 445 ms of which 1 ms to minimize.
[2023-03-15 08:23:59] [INFO ] Deduced a trap composed of 440 places in 445 ms of which 1 ms to minimize.
[2023-03-15 08:23:59] [INFO ] Deduced a trap composed of 448 places in 440 ms of which 1 ms to minimize.
[2023-03-15 08:24:00] [INFO ] Deduced a trap composed of 440 places in 433 ms of which 4 ms to minimize.
[2023-03-15 08:24:02] [INFO ] Deduced a trap composed of 436 places in 515 ms of which 1 ms to minimize.
[2023-03-15 08:24:03] [INFO ] Deduced a trap composed of 434 places in 537 ms of which 1 ms to minimize.
[2023-03-15 08:24:03] [INFO ] Deduced a trap composed of 438 places in 540 ms of which 1 ms to minimize.
[2023-03-15 08:24:04] [INFO ] Deduced a trap composed of 448 places in 529 ms of which 0 ms to minimize.
[2023-03-15 08:24:05] [INFO ] Deduced a trap composed of 422 places in 570 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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-15 08:24:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:24:05] [INFO ] After 25251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 92 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 08:24:05] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:24:05] [INFO ] Invariant cache hit.
[2023-03-15 08:24:07] [INFO ] Dead Transitions using invariants and state equation in 1283 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1384 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 10000 steps, including 707 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 325476 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325476 steps, saw 52980 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:24:10] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:24:10] [INFO ] Invariant cache hit.
[2023-03-15 08:24:10] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 08:24:10] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 08:24:10] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:24:10] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-15 08:24:10] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 08:24:11] [INFO ] After 631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:24:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:24:11] [INFO ] After 681ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:24:12] [INFO ] Deduced a trap composed of 446 places in 489 ms of which 2 ms to minimize.
[2023-03-15 08:24:13] [INFO ] Deduced a trap composed of 436 places in 491 ms of which 4 ms to minimize.
[2023-03-15 08:24:13] [INFO ] Deduced a trap composed of 448 places in 490 ms of which 1 ms to minimize.
[2023-03-15 08:24:14] [INFO ] Deduced a trap composed of 448 places in 488 ms of which 1 ms to minimize.
[2023-03-15 08:24:15] [INFO ] Deduced a trap composed of 444 places in 487 ms of which 1 ms to minimize.
[2023-03-15 08:24:15] [INFO ] Deduced a trap composed of 452 places in 482 ms of which 1 ms to minimize.
[2023-03-15 08:24:16] [INFO ] Deduced a trap composed of 440 places in 491 ms of which 1 ms to minimize.
[2023-03-15 08:24:16] [INFO ] Deduced a trap composed of 432 places in 494 ms of which 1 ms to minimize.
[2023-03-15 08:24:17] [INFO ] Deduced a trap composed of 442 places in 504 ms of which 1 ms to minimize.
[2023-03-15 08:24:17] [INFO ] Deduced a trap composed of 446 places in 495 ms of which 1 ms to minimize.
[2023-03-15 08:24:18] [INFO ] Deduced a trap composed of 436 places in 484 ms of which 1 ms to minimize.
[2023-03-15 08:24:19] [INFO ] Deduced a trap composed of 434 places in 600 ms of which 0 ms to minimize.
[2023-03-15 08:24:19] [INFO ] Deduced a trap composed of 436 places in 575 ms of which 1 ms to minimize.
[2023-03-15 08:24:20] [INFO ] Deduced a trap composed of 452 places in 467 ms of which 1 ms to minimize.
[2023-03-15 08:24:20] [INFO ] Deduced a trap composed of 444 places in 448 ms of which 2 ms to minimize.
[2023-03-15 08:24:21] [INFO ] Deduced a trap composed of 434 places in 434 ms of which 1 ms to minimize.
[2023-03-15 08:24:22] [INFO ] Deduced a trap composed of 430 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:24:22] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-15 08:24:23] [INFO ] Deduced a trap composed of 444 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:24:23] [INFO ] Deduced a trap composed of 438 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:24:24] [INFO ] Deduced a trap composed of 448 places in 433 ms of which 0 ms to minimize.
[2023-03-15 08:24:24] [INFO ] Deduced a trap composed of 430 places in 442 ms of which 1 ms to minimize.
[2023-03-15 08:24:25] [INFO ] Deduced a trap composed of 454 places in 459 ms of which 1 ms to minimize.
[2023-03-15 08:24:25] [INFO ] Deduced a trap composed of 450 places in 433 ms of which 1 ms to minimize.
[2023-03-15 08:24:26] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:24:28] [INFO ] Deduced a trap composed of 450 places in 442 ms of which 1 ms to minimize.
[2023-03-15 08:24:28] [INFO ] Deduced a trap composed of 450 places in 433 ms of which 1 ms to minimize.
[2023-03-15 08:24:29] [INFO ] Deduced a trap composed of 440 places in 439 ms of which 1 ms to minimize.
[2023-03-15 08:24:29] [INFO ] Deduced a trap composed of 448 places in 440 ms of which 1 ms to minimize.
[2023-03-15 08:24:30] [INFO ] Deduced a trap composed of 440 places in 438 ms of which 1 ms to minimize.
[2023-03-15 08:24:32] [INFO ] Deduced a trap composed of 436 places in 496 ms of which 1 ms to minimize.
[2023-03-15 08:24:33] [INFO ] Deduced a trap composed of 434 places in 487 ms of which 1 ms to minimize.
[2023-03-15 08:24:34] [INFO ] Deduced a trap composed of 438 places in 435 ms of which 1 ms to minimize.
[2023-03-15 08:24:35] [INFO ] Deduced a trap composed of 448 places in 565 ms of which 1 ms to minimize.
[2023-03-15 08:24:35] [INFO ] Deduced a trap composed of 422 places in 465 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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-15 08:24:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:24:35] [INFO ] After 25226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 69 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 49 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 08:24:35] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:24:35] [INFO ] Invariant cache hit.
[2023-03-15 08:24:36] [INFO ] Implicit Places using invariants in 818 ms returned []
[2023-03-15 08:24:36] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:24:36] [INFO ] Invariant cache hit.
[2023-03-15 08:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:24:45] [INFO ] Implicit Places using invariants and state equation in 8895 ms returned []
Implicit Place search using SMT with State Equation took 9716 ms to find 0 implicit places.
[2023-03-15 08:24:45] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-15 08:24:45] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 08:24:45] [INFO ] Invariant cache hit.
[2023-03-15 08:24:46] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10899 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 205 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2040 rows 1078 cols
[2023-03-15 08:24:46] [INFO ] Computed 142 place invariants in 35 ms
[2023-03-15 08:24:47] [INFO ] [Real]Absence check using 135 positive place invariants in 27 ms returned sat
[2023-03-15 08:24:47] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 08:24:47] [INFO ] After 528ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:24:48] [INFO ] Deduced a trap composed of 436 places in 432 ms of which 1 ms to minimize.
[2023-03-15 08:24:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 556 ms
[2023-03-15 08:24:48] [INFO ] After 1123ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:24:48] [INFO ] After 1301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:24:48] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-15 08:24:48] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 08:24:48] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:24:49] [INFO ] Deduced a trap composed of 436 places in 407 ms of which 1 ms to minimize.
[2023-03-15 08:24:49] [INFO ] Deduced a trap composed of 430 places in 398 ms of which 1 ms to minimize.
[2023-03-15 08:24:50] [INFO ] Deduced a trap composed of 444 places in 403 ms of which 1 ms to minimize.
[2023-03-15 08:24:50] [INFO ] Deduced a trap composed of 450 places in 410 ms of which 1 ms to minimize.
[2023-03-15 08:24:51] [INFO ] Deduced a trap composed of 448 places in 399 ms of which 1 ms to minimize.
[2023-03-15 08:24:51] [INFO ] Deduced a trap composed of 446 places in 401 ms of which 1 ms to minimize.
[2023-03-15 08:24:52] [INFO ] Deduced a trap composed of 438 places in 405 ms of which 1 ms to minimize.
[2023-03-15 08:24:52] [INFO ] Deduced a trap composed of 434 places in 399 ms of which 1 ms to minimize.
[2023-03-15 08:24:53] [INFO ] Deduced a trap composed of 448 places in 408 ms of which 1 ms to minimize.
[2023-03-15 08:24:54] [INFO ] Deduced a trap composed of 440 places in 403 ms of which 1 ms to minimize.
[2023-03-15 08:24:54] [INFO ] Deduced a trap composed of 438 places in 427 ms of which 4 ms to minimize.
[2023-03-15 08:24:55] [INFO ] Deduced a trap composed of 444 places in 411 ms of which 1 ms to minimize.
[2023-03-15 08:24:55] [INFO ] Deduced a trap composed of 440 places in 408 ms of which 1 ms to minimize.
[2023-03-15 08:24:56] [INFO ] Deduced a trap composed of 434 places in 407 ms of which 1 ms to minimize.
[2023-03-15 08:24:56] [INFO ] Deduced a trap composed of 446 places in 410 ms of which 0 ms to minimize.
[2023-03-15 08:24:57] [INFO ] Deduced a trap composed of 442 places in 423 ms of which 1 ms to minimize.
[2023-03-15 08:24:57] [INFO ] Deduced a trap composed of 432 places in 406 ms of which 1 ms to minimize.
[2023-03-15 08:24:58] [INFO ] Deduced a trap composed of 446 places in 401 ms of which 0 ms to minimize.
[2023-03-15 08:24:58] [INFO ] Deduced a trap composed of 444 places in 412 ms of which 1 ms to minimize.
[2023-03-15 08:24:59] [INFO ] Deduced a trap composed of 440 places in 401 ms of which 1 ms to minimize.
[2023-03-15 08:24:59] [INFO ] Deduced a trap composed of 434 places in 410 ms of which 1 ms to minimize.
[2023-03-15 08:25:00] [INFO ] Deduced a trap composed of 446 places in 398 ms of which 1 ms to minimize.
[2023-03-15 08:25:00] [INFO ] Deduced a trap composed of 436 places in 414 ms of which 1 ms to minimize.
[2023-03-15 08:25:01] [INFO ] Deduced a trap composed of 452 places in 395 ms of which 1 ms to minimize.
[2023-03-15 08:25:01] [INFO ] Deduced a trap composed of 442 places in 394 ms of which 0 ms to minimize.
[2023-03-15 08:25:02] [INFO ] Deduced a trap composed of 432 places in 434 ms of which 1 ms to minimize.
[2023-03-15 08:25:02] [INFO ] Deduced a trap composed of 438 places in 405 ms of which 0 ms to minimize.
[2023-03-15 08:25:03] [INFO ] Deduced a trap composed of 438 places in 410 ms of which 1 ms to minimize.
[2023-03-15 08:25:03] [INFO ] Deduced a trap composed of 446 places in 432 ms of which 1 ms to minimize.
[2023-03-15 08:25:04] [INFO ] Deduced a trap composed of 422 places in 448 ms of which 1 ms to minimize.
[2023-03-15 08:25:05] [INFO ] Deduced a trap composed of 438 places in 459 ms of which 1 ms to minimize.
[2023-03-15 08:25:05] [INFO ] Deduced a trap composed of 436 places in 430 ms of which 1 ms to minimize.
[2023-03-15 08:25:06] [INFO ] Deduced a trap composed of 434 places in 455 ms of which 1 ms to minimize.
[2023-03-15 08:25:07] [INFO ] Deduced a trap composed of 434 places in 456 ms of which 1 ms to minimize.
[2023-03-15 08:25:07] [INFO ] Deduced a trap composed of 428 places in 475 ms of which 1 ms to minimize.
[2023-03-15 08:25:08] [INFO ] Deduced a trap composed of 440 places in 449 ms of which 1 ms to minimize.
[2023-03-15 08:25:08] [INFO ] Deduced a trap composed of 422 places in 459 ms of which 1 ms to minimize.
[2023-03-15 08:25:09] [INFO ] Deduced a trap composed of 430 places in 461 ms of which 0 ms to minimize.
[2023-03-15 08:25:09] [INFO ] Deduced a trap composed of 426 places in 463 ms of which 1 ms to minimize.
[2023-03-15 08:25:10] [INFO ] Deduced a trap composed of 430 places in 460 ms of which 1 ms to minimize.
[2023-03-15 08:25:10] [INFO ] Deduced a trap composed of 432 places in 459 ms of which 1 ms to minimize.
[2023-03-15 08:25:11] [INFO ] Deduced a trap composed of 434 places in 447 ms of which 1 ms to minimize.
[2023-03-15 08:25:11] [INFO ] Deduced a trap composed of 422 places in 454 ms of which 1 ms to minimize.
[2023-03-15 08:25:12] [INFO ] Deduced a trap composed of 457 places in 425 ms of which 0 ms to minimize.
[2023-03-15 08:25:13] [INFO ] Deduced a trap composed of 432 places in 427 ms of which 1 ms to minimize.
[2023-03-15 08:25:14] [INFO ] Deduced a trap composed of 438 places in 432 ms of which 1 ms to minimize.
[2023-03-15 08:25:19] [INFO ] Deduced a trap composed of 426 places in 449 ms of which 1 ms to minimize.
[2023-03-15 08:25:19] [INFO ] Deduced a trap composed of 428 places in 434 ms of which 1 ms to minimize.
[2023-03-15 08:25:20] [INFO ] Deduced a trap composed of 432 places in 411 ms of which 1 ms to minimize.
[2023-03-15 08:25:20] [INFO ] Deduced a trap composed of 428 places in 411 ms of which 1 ms to minimize.
[2023-03-15 08:25:21] [INFO ] Deduced a trap composed of 434 places in 417 ms of which 1 ms to minimize.
[2023-03-15 08:25:21] [INFO ] Deduced a trap composed of 426 places in 414 ms of which 0 ms to minimize.
[2023-03-15 08:25:22] [INFO ] Deduced a trap composed of 430 places in 417 ms of which 1 ms to minimize.
[2023-03-15 08:25:24] [INFO ] Deduced a trap composed of 434 places in 417 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2023-03-15 08:26:30] [INFO ] Flatten gal took : 163 ms
[2023-03-15 08:26:30] [INFO ] Applying decomposition
[2023-03-15 08:26:30] [INFO ] Flatten gal took : 138 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/graph6358185708202883943.txt' '-o' '/tmp/graph6358185708202883943.bin' '-w' '/tmp/graph6358185708202883943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6358185708202883943.bin' '-l' '-1' '-v' '-w' '/tmp/graph6358185708202883943.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:26:31] [INFO ] Decomposing Gal with order
[2023-03-15 08:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:26:32] [INFO ] Removed a total of 2581 redundant transitions.
[2023-03-15 08:26:32] [INFO ] Flatten gal took : 653 ms
[2023-03-15 08:26:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 862 labels/synchronizations in 93 ms.
[2023-03-15 08:26:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1897035732190507878.gal : 76 ms
[2023-03-15 08:26:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8633425731416228264.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/ReachabilityCardinality1897035732190507878.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8633425731416228264.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/ReachabilityCardinality8633425731416228264.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6145
[2023-03-15 08:28:33] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 224234 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-15 08:28:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:28:33] [INFO ] After 225034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 220 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-15 08:28:33] [INFO ] Invariant cache hit.
[2023-03-15 08:28:33] [INFO ] [Real]Absence check using 135 positive place invariants in 26 ms returned sat
[2023-03-15 08:28:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 08:28:33] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:28:33] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 08:28:33] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 08:28:34] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:28:34] [INFO ] Deduced a trap composed of 420 places in 441 ms of which 1 ms to minimize.
[2023-03-15 08:28:35] [INFO ] Deduced a trap composed of 440 places in 457 ms of which 1 ms to minimize.
[2023-03-15 08:28:35] [INFO ] Deduced a trap composed of 446 places in 416 ms of which 1 ms to minimize.
[2023-03-15 08:28:36] [INFO ] Deduced a trap composed of 432 places in 424 ms of which 1 ms to minimize.
[2023-03-15 08:28:36] [INFO ] Deduced a trap composed of 436 places in 428 ms of which 1 ms to minimize.
[2023-03-15 08:28:37] [INFO ] Deduced a trap composed of 438 places in 423 ms of which 1 ms to minimize.
[2023-03-15 08:28:37] [INFO ] Deduced a trap composed of 438 places in 436 ms of which 1 ms to minimize.
[2023-03-15 08:28:38] [INFO ] Deduced a trap composed of 438 places in 423 ms of which 1 ms to minimize.
[2023-03-15 08:28:38] [INFO ] Deduced a trap composed of 448 places in 442 ms of which 1 ms to minimize.
[2023-03-15 08:28:39] [INFO ] Deduced a trap composed of 442 places in 430 ms of which 1 ms to minimize.
[2023-03-15 08:28:39] [INFO ] Deduced a trap composed of 444 places in 433 ms of which 1 ms to minimize.
[2023-03-15 08:28:40] [INFO ] Deduced a trap composed of 438 places in 429 ms of which 1 ms to minimize.
[2023-03-15 08:28:41] [INFO ] Deduced a trap composed of 432 places in 441 ms of which 13 ms to minimize.
[2023-03-15 08:28:41] [INFO ] Deduced a trap composed of 436 places in 425 ms of which 1 ms to minimize.
[2023-03-15 08:28:42] [INFO ] Deduced a trap composed of 430 places in 463 ms of which 1 ms to minimize.
[2023-03-15 08:28:42] [INFO ] Deduced a trap composed of 449 places in 430 ms of which 1 ms to minimize.
[2023-03-15 08:28:43] [INFO ] Deduced a trap composed of 442 places in 436 ms of which 1 ms to minimize.
[2023-03-15 08:28:43] [INFO ] Deduced a trap composed of 442 places in 452 ms of which 1 ms to minimize.
[2023-03-15 08:28:44] [INFO ] Deduced a trap composed of 438 places in 458 ms of which 1 ms to minimize.
[2023-03-15 08:28:44] [INFO ] Deduced a trap composed of 434 places in 443 ms of which 1 ms to minimize.
[2023-03-15 08:28:45] [INFO ] Deduced a trap composed of 428 places in 429 ms of which 1 ms to minimize.
[2023-03-15 08:28:45] [INFO ] Deduced a trap composed of 442 places in 426 ms of which 1 ms to minimize.
[2023-03-15 08:28:46] [INFO ] Deduced a trap composed of 438 places in 424 ms of which 1 ms to minimize.
[2023-03-15 08:28:46] [INFO ] Deduced a trap composed of 434 places in 446 ms of which 1 ms to minimize.
[2023-03-15 08:28:47] [INFO ] Deduced a trap composed of 452 places in 428 ms of which 1 ms to minimize.
[2023-03-15 08:28:47] [INFO ] Deduced a trap composed of 440 places in 423 ms of which 1 ms to minimize.
[2023-03-15 08:28:48] [INFO ] Deduced a trap composed of 446 places in 430 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6145 after 7168
[2023-03-15 08:28:48] [INFO ] Deduced a trap composed of 440 places in 427 ms of which 1 ms to minimize.
[2023-03-15 08:28:49] [INFO ] Deduced a trap composed of 442 places in 431 ms of which 1 ms to minimize.
[2023-03-15 08:28:49] [INFO ] Deduced a trap composed of 436 places in 588 ms of which 0 ms to minimize.
[2023-03-15 08:28:50] [INFO ] Deduced a trap composed of 438 places in 424 ms of which 2 ms to minimize.
[2023-03-15 08:28:50] [INFO ] Deduced a trap composed of 452 places in 432 ms of which 1 ms to minimize.
[2023-03-15 08:28:51] [INFO ] Deduced a trap composed of 438 places in 429 ms of which 1 ms to minimize.
[2023-03-15 08:28:51] [INFO ] Deduced a trap composed of 444 places in 492 ms of which 1 ms to minimize.
[2023-03-15 08:28:52] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2023-03-15 08:28:52] [INFO ] Deduced a trap composed of 448 places in 396 ms of which 1 ms to minimize.
[2023-03-15 08:28:53] [INFO ] Deduced a trap composed of 436 places in 391 ms of which 1 ms to minimize.
[2023-03-15 08:28:53] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-15 08:28:54] [INFO ] Deduced a trap composed of 440 places in 442 ms of which 1 ms to minimize.
[2023-03-15 08:28:54] [INFO ] Deduced a trap composed of 442 places in 427 ms of which 1 ms to minimize.
[2023-03-15 08:28:55] [INFO ] Deduced a trap composed of 432 places in 428 ms of which 1 ms to minimize.
[2023-03-15 08:28:55] [INFO ] Deduced a trap composed of 432 places in 426 ms of which 1 ms to minimize.
[2023-03-15 08:28:56] [INFO ] Deduced a trap composed of 442 places in 433 ms of which 1 ms to minimize.
[2023-03-15 08:28:56] [INFO ] Deduced a trap composed of 438 places in 430 ms of which 1 ms to minimize.
[2023-03-15 08:28:57] [INFO ] Deduced a trap composed of 442 places in 438 ms of which 1 ms to minimize.
[2023-03-15 08:28:57] [INFO ] Deduced a trap composed of 444 places in 443 ms of which 1 ms to minimize.
[2023-03-15 08:28:58] [INFO ] Deduced a trap composed of 432 places in 429 ms of which 1 ms to minimize.
[2023-03-15 08:28:58] [INFO ] Deduced a trap composed of 434 places in 423 ms of which 1 ms to minimize.
[2023-03-15 08:28:59] [INFO ] Deduced a trap composed of 432 places in 392 ms of which 1 ms to minimize.
[2023-03-15 08:28:59] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 0 ms to minimize.
[2023-03-15 08:29:00] [INFO ] Deduced a trap composed of 436 places in 397 ms of which 1 ms to minimize.
[2023-03-15 08:29:02] [INFO ] Deduced a trap composed of 436 places in 425 ms of which 1 ms to minimize.
[2023-03-15 08:29:10] [INFO ] Deduced a trap composed of 432 places in 447 ms of which 1 ms to minimize.
[2023-03-15 08:29:14] [INFO ] Deduced a trap composed of 446 places in 427 ms of which 1 ms to minimize.
[2023-03-15 08:29:15] [INFO ] Deduced a trap composed of 444 places in 425 ms of which 0 ms to minimize.
[2023-03-15 08:29:15] [INFO ] Deduced a trap composed of 450 places in 422 ms of which 1 ms to minimize.
[2023-03-15 08:29:24] [INFO ] Trap strengthening (SAT) tested/added 56/56 trap constraints in 50396 ms
[2023-03-15 08:29:26] [INFO ] After 52552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:29:26] [INFO ] After 52754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
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-15 08:29:26] [INFO ] Flatten gal took : 109 ms
[2023-03-15 08:29:26] [INFO ] Flatten gal took : 148 ms
[2023-03-15 08:29:26] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6266829702447856008.gal : 33 ms
[2023-03-15 08:29:26] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6160967507865678531.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/ReachabilityFireability6266829702447856008.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6160967507865678531.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/ReachabilityFireability6160967507865678531.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
Detected timeout of ITS tools.
[2023-03-15 08:29:29] [INFO ] Flatten gal took : 96 ms
[2023-03-15 08:29:29] [INFO ] Applying decomposition
[2023-03-15 08:29:30] [INFO ] Flatten gal took : 167 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/graph15362259113831524478.txt' '-o' '/tmp/graph15362259113831524478.bin' '-w' '/tmp/graph15362259113831524478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15362259113831524478.bin' '-l' '-1' '-v' '-w' '/tmp/graph15362259113831524478.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:29:30] [INFO ] Decomposing Gal with order
[2023-03-15 08:29:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:29:31] [INFO ] Removed a total of 4062 redundant transitions.
[2023-03-15 08:29:31] [INFO ] Flatten gal took : 453 ms
[2023-03-15 08:29:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 564 labels/synchronizations in 73 ms.
[2023-03-15 08:29:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7401808370463386684.gal : 17 ms
[2023-03-15 08:29:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1460853124501511715.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/ReachabilityFireability7401808370463386684.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1460853124501511715.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/ReachabilityFireability1460853124501511715.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13505631248697681325
[2023-03-15 08:29:34] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13505631248697681325
Running compilation step : cd /tmp/ltsmin13505631248697681325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13505631248697681325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' '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' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13505631248697681325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' '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' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:29:36] [INFO ] Flatten gal took : 67 ms
[2023-03-15 08:29:36] [INFO ] Flatten gal took : 68 ms
[2023-03-15 08:29:36] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13632733081631737109.gal : 12 ms
[2023-03-15 08:29:36] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17178257246388558327.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/ReachabilityFireability13632733081631737109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17178257246388558327.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
Loading property file /tmp/ReachabilityFireability17178257246388558327.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
Detected timeout of ITS tools.
[2023-03-15 08:30:06] [INFO ] Flatten gal took : 71 ms
[2023-03-15 08:30:06] [INFO ] Applying decomposition
[2023-03-15 08:30:06] [INFO ] Flatten gal took : 71 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/graph15625524957010475158.txt' '-o' '/tmp/graph15625524957010475158.bin' '-w' '/tmp/graph15625524957010475158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15625524957010475158.bin' '-l' '-1' '-v' '-w' '/tmp/graph15625524957010475158.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:30:07] [INFO ] Decomposing Gal with order
[2023-03-15 08:30:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:30:07] [INFO ] Removed a total of 4240 redundant transitions.
[2023-03-15 08:30:07] [INFO ] Flatten gal took : 172 ms
[2023-03-15 08:30:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 53 ms.
[2023-03-15 08:30:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12318606399663931618.gal : 20 ms
[2023-03-15 08:30:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6748144411080038465.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/ReachabilityFireability12318606399663931618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6748144411080038465.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/ReachabilityFireability6748144411080038465.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1 after 148074
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :148074 after 148074
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :148074 after 148074
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :148074 after 148074
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :148074 after 148082
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :148082 after 163622
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :163622 after 163622
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2525001523471303406
[2023-03-15 08:30:37] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2525001523471303406
Running compilation step : cd /tmp/ltsmin2525001523471303406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '6' '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 4790 ms.
Running link step : cd /tmp/ltsmin2525001523471303406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2525001523471303406;'/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' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 08:31:07] [INFO ] Flatten gal took : 69 ms
[2023-03-15 08:31:07] [INFO ] Flatten gal took : 71 ms
[2023-03-15 08:31:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10142831429156247813.gal : 12 ms
[2023-03-15 08:31:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9620098051309674201.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/ReachabilityFireability10142831429156247813.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9620098051309674201.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability9620098051309674201.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10655 after 39935
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39935 after 52601
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7168 after 228033
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52601 after 256335
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :256335 after 502724
Detected timeout of ITS tools.
[2023-03-15 08:36:08] [INFO ] Flatten gal took : 69 ms
[2023-03-15 08:36:08] [INFO ] Applying decomposition
[2023-03-15 08:36:08] [INFO ] Flatten gal took : 70 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/graph95202245596392900.txt' '-o' '/tmp/graph95202245596392900.bin' '-w' '/tmp/graph95202245596392900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph95202245596392900.bin' '-l' '-1' '-v' '-w' '/tmp/graph95202245596392900.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:36:08] [INFO ] Decomposing Gal with order
[2023-03-15 08:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:36:08] [INFO ] Removed a total of 4062 redundant transitions.
[2023-03-15 08:36:08] [INFO ] Flatten gal took : 149 ms
[2023-03-15 08:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 565 labels/synchronizations in 38 ms.
[2023-03-15 08:36:08] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14664809159927969372.gal : 16 ms
[2023-03-15 08:36:08] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1458616445328587395.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/ReachabilityFireability14664809159927969372.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1458616445328587395.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/ReachabilityFireability1458616445328587395.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 248874
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :248874 after 248874
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :248874 after 248874
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :248874 after 248874
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :248874 after 248882
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :248882 after 248920
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248920 after 355588
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :355588 after 355588
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :355588 after 549798
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :549798 after 551890
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :551890 after 1.64623e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2113504649692507693
[2023-03-15 08:41:09] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2113504649692507693
Running compilation step : cd /tmp/ltsmin2113504649692507693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '60' '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 4883 ms.
Running link step : cd /tmp/ltsmin2113504649692507693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2113504649692507693;'/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' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.108: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.108: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.110: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.110: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.116: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.111: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.117: There are 2062 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.117: State length is 1090, there are 2061 groups
pins2lts-mc-linux64( 0/ 8), 0.117: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.117: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.117: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.117: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.113: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.113: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 1.220: ~2 levels ~960 states ~7608 transitions
pins2lts-mc-linux64( 1/ 8), 1.477: ~4 levels ~1920 states ~14504 transitions
pins2lts-mc-linux64( 0/ 8), 2.389: ~6 levels ~3840 states ~21864 transitions
pins2lts-mc-linux64( 0/ 8), 4.591: ~7 levels ~7680 states ~195008 transitions
pins2lts-mc-linux64( 0/ 8), 7.575: ~7 levels ~15360 states ~634208 transitions
pins2lts-mc-linux64( 0/ 8), 13.008: ~7 levels ~30720 states ~1526832 transitions
pins2lts-mc-linux64( 2/ 8), 17.657: ~5 levels ~61440 states ~3044432 transitions
pins2lts-mc-linux64( 2/ 8), 22.761: ~5 levels ~122880 states ~3958896 transitions
pins2lts-mc-linux64( 2/ 8), 33.658: ~6 levels ~245760 states ~7759408 transitions
pins2lts-mc-linux64( 0/ 8), 52.828: ~8 levels ~491520 states ~10523248 transitions
pins2lts-mc-linux64( 0/ 8), 89.401: ~8 levels ~983040 states ~13659816 transitions
pins2lts-mc-linux64( 7/ 8), 112.986: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 113.710:
pins2lts-mc-linux64( 0/ 8), 113.710: mean standard work distribution: 22.4% (states) 44.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 113.710:
pins2lts-mc-linux64( 0/ 8), 113.710: Explored 1013026 states 42179951 transitions, fanout: 41.638
pins2lts-mc-linux64( 0/ 8), 113.710: Total exploration time 113.590 sec (112.870 sec minimum, 113.124 sec on average)
pins2lts-mc-linux64( 0/ 8), 113.711: States per second: 8918, Transitions per second: 371335
pins2lts-mc-linux64( 0/ 8), 113.711:
pins2lts-mc-linux64( 0/ 8), 113.711: Queue width: 8B, total height: 15755834, memory: 120.21MB
pins2lts-mc-linux64( 0/ 8), 113.711: Tree memory: 384.5MB, 23.9 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 113.711: Tree fill ratio (roots/leafs): 12.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 113.711: Stored 2161 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 113.711: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 113.711: Est. total memory use: 504.7MB (~1144.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2113504649692507693;'/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' 'qltransition_11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2113504649692507693;'/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' 'qltransition_11==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)
[2023-03-15 08:43:07] [INFO ] Flatten gal took : 69 ms
[2023-03-15 08:43:07] [INFO ] Flatten gal took : 68 ms
[2023-03-15 08:43:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5742842109810540991.gal : 11 ms
[2023-03-15 08:43:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability499219037205719947.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/ReachabilityFireability5742842109810540991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability499219037205719947.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/ReachabilityFireability499219037205719947.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10655 after 39935
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39935 after 52601
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52601 after 256335
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 11402568 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16122528 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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="PolyORBNT-COL-S10J60"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBNT-COL-S10J60, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tall-167873961400437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;