/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 21:09:49,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 21:09:49,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 21:09:49,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 21:09:49,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 21:09:49,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 21:09:49,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 21:09:49,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 21:09:49,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 21:09:49,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 21:09:49,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 21:09:49,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 21:09:49,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 21:09:49,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 21:09:49,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 21:09:49,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 21:09:49,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 21:09:49,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 21:09:49,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 21:09:49,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 21:09:49,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 21:09:49,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 21:09:49,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 21:09:49,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 21:09:49,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 21:09:49,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 21:09:49,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 21:09:49,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 21:09:49,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 21:09:49,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 21:09:49,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 21:09:49,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 21:09:49,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 21:09:49,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 21:09:49,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 21:09:49,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 21:09:49,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 21:09:49,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 21:09:49,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 21:09:49,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 21:09:49,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 21:09:49,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 21:09:49,479 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 21:09:49,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 21:09:49,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 21:09:49,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 21:09:49,482 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 21:09:49,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 21:09:49,483 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 21:09:49,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 21:09:49,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 21:09:49,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 21:09:49,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 21:09:49,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 21:09:49,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 21:09:49,484 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 21:09:49,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 21:09:49,484 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 21:09:49,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 21:09:49,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 21:09:49,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 21:09:49,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 21:09:49,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 21:09:49,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 21:09:49,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 21:09:49,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 21:09:49,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 21:09:49,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 21:09:49,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 21:09:49,486 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 21:09:49,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 21:09:49,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 21:09:49,486 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 21:09:49,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 21:09:49,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 21:09:49,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 21:09:49,805 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-11 21:09:49,806 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-11 21:09:49,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl [2021-06-11 21:09:49,807 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl' [2021-06-11 21:09:49,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 21:09:49,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-11 21:09:49,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 21:09:49,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 21:09:49,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 21:09:49,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... [2021-06-11 21:09:49,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... [2021-06-11 21:09:49,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 21:09:49,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 21:09:49,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 21:09:49,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 21:09:49,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... [2021-06-11 21:09:49,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... [2021-06-11 21:09:49,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... [2021-06-11 21:09:49,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... [2021-06-11 21:09:49,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... [2021-06-11 21:09:49,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... [2021-06-11 21:09:49,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... [2021-06-11 21:09:49,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 21:09:49,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 21:09:49,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 21:09:49,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 21:09:49,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 21:09:49,960 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-11 21:09:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-11 21:09:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-11 21:09:49,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-11 21:09:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-11 21:09:49,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-11 21:09:49,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-11 21:09:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 21:09:49,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 21:09:49,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-11 21:09:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-11 21:09:49,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-11 21:09:49,963 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-06-11 21:09:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-06-11 21:09:49,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-06-11 21:09:49,963 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-06-11 21:09:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-06-11 21:09:49,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-06-11 21:09:49,964 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 21:09:50,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 21:09:50,141 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-11 21:09:50,143 INFO L202 PluginConnector]: Adding new model min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 09:09:50 BoogieIcfgContainer [2021-06-11 21:09:50,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 21:09:50,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 21:09:50,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 21:09:50,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 21:09:50,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:09:49" (1/2) ... [2021-06-11 21:09:50,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2beac6f8 and model type min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 09:09:50, skipping insertion in model container [2021-06-11 21:09:50,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 09:09:50" (2/2) ... [2021-06-11 21:09:50,148 INFO L111 eAbstractionObserver]: Analyzing ICFG min-max-inc-dec.wvr.bpl [2021-06-11 21:09:50,153 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 21:09:50,156 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-06-11 21:09:50,157 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 21:09:50,231 INFO L149 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2021-06-11 21:09:50,263 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 21:09:50,286 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 21:09:50,286 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 21:09:50,286 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 21:09:50,286 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 21:09:50,286 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 21:09:50,286 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 21:09:50,286 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 21:09:50,286 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 21:09:50,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 42 transitions, 124 flow [2021-06-11 21:09:50,324 INFO L129 PetriNetUnfolder]: 4/37 cut-off events. [2021-06-11 21:09:50,325 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-06-11 21:09:50,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 37 events. 4/37 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 81 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2021-06-11 21:09:50,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 42 transitions, 124 flow [2021-06-11 21:09:50,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 35 transitions, 100 flow [2021-06-11 21:09:50,333 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:50,346 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 100 flow [2021-06-11 21:09:50,349 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 100 flow [2021-06-11 21:09:50,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 100 flow [2021-06-11 21:09:50,366 INFO L129 PetriNetUnfolder]: 4/35 cut-off events. [2021-06-11 21:09:50,366 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-06-11 21:09:50,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 4/35 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 78 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2021-06-11 21:09:50,369 INFO L151 LiptonReduction]: Number of co-enabled transitions 552 [2021-06-11 21:09:50,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:50,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:50,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:50,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:50,542 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.6 percent of original size [2021-06-11 21:09:50,545 INFO L147 QuantifierPusher]: treesize reduction 10, result has 9.1 percent of original size 1 [2021-06-11 21:09:50,586 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.6 percent of original size [2021-06-11 21:09:50,589 INFO L147 QuantifierPusher]: treesize reduction 10, result has 9.1 percent of original size 1 [2021-06-11 21:09:50,721 INFO L163 LiptonReduction]: Checked pairs total: 348 [2021-06-11 21:09:50,722 INFO L165 LiptonReduction]: Total number of compositions: 10 [2021-06-11 21:09:50,724 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 392 [2021-06-11 21:09:50,736 INFO L129 PetriNetUnfolder]: 4/24 cut-off events. [2021-06-11 21:09:50,736 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-06-11 21:09:50,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:50,737 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:50,737 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1547649520, now seen corresponding path program 1 times [2021-06-11 21:09:50,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:50,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180343700] [2021-06-11 21:09:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:50,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:50,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-06-11 21:09:50,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:50,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:50,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180343700] [2021-06-11 21:09:50,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:50,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 21:09:50,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227656490] [2021-06-11 21:09:50,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:50,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:50,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:50,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 21:09:50,878 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 52 [2021-06-11 21:09:50,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:50,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:50,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 52 [2021-06-11 21:09:50,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:50,910 INFO L129 PetriNetUnfolder]: 5/34 cut-off events. [2021-06-11 21:09:50,910 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-11 21:09:50,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 34 events. 5/34 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2021-06-11 21:09:50,912 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 2 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2021-06-11 21:09:50,912 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 96 flow [2021-06-11 21:09:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 21:09:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 21:09:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2021-06-11 21:09:50,923 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2021-06-11 21:09:50,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 232 transitions. [2021-06-11 21:09:50,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 232 transitions. [2021-06-11 21:09:50,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:50,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 232 transitions. [2021-06-11 21:09:50,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:50,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:50,933 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:50,935 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 80 flow. Second operand 5 states and 232 transitions. [2021-06-11 21:09:50,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 96 flow [2021-06-11 21:09:50,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 76 flow, removed 0 selfloop flow, removed 10 redundant places. [2021-06-11 21:09:50,940 INFO L241 Difference]: Finished difference. Result has 33 places, 27 transitions, 80 flow [2021-06-11 21:09:50,941 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2021-06-11 21:09:50,942 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2021-06-11 21:09:50,942 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:50,942 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 80 flow [2021-06-11 21:09:50,943 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 80 flow [2021-06-11 21:09:50,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 80 flow [2021-06-11 21:09:50,950 INFO L129 PetriNetUnfolder]: 5/34 cut-off events. [2021-06-11 21:09:50,950 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-06-11 21:09:50,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 34 events. 5/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2021-06-11 21:09:50,951 INFO L151 LiptonReduction]: Number of co-enabled transitions 262 [2021-06-11 21:09:50,958 INFO L163 LiptonReduction]: Checked pairs total: 56 [2021-06-11 21:09:50,959 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:50,959 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-06-11 21:09:50,960 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 80 flow [2021-06-11 21:09:50,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:50,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:50,961 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:50,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-11 21:09:50,961 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:50,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:50,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1943799234, now seen corresponding path program 2 times [2021-06-11 21:09:50,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:50,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668984941] [2021-06-11 21:09:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:50,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:50,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-06-11 21:09:50,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:50,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:50,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668984941] [2021-06-11 21:09:50,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:50,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 21:09:50,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546417734] [2021-06-11 21:09:50,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:50,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:51,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:51,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 21:09:51,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 52 [2021-06-11 21:09:51,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:51,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 52 [2021-06-11 21:09:51,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:51,023 INFO L129 PetriNetUnfolder]: 8/54 cut-off events. [2021-06-11 21:09:51,023 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-11 21:09:51,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 54 events. 8/54 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 0 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 59. Up to 6 conditions per place. [2021-06-11 21:09:51,024 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 3 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2021-06-11 21:09:51,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 107 flow [2021-06-11 21:09:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 21:09:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 21:09:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2021-06-11 21:09:51,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2021-06-11 21:09:51,027 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 232 transitions. [2021-06-11 21:09:51,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 232 transitions. [2021-06-11 21:09:51,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:51,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 232 transitions. [2021-06-11 21:09:51,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,030 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,030 INFO L185 Difference]: Start difference. First operand has 33 places, 27 transitions, 80 flow. Second operand 5 states and 232 transitions. [2021-06-11 21:09:51,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 107 flow [2021-06-11 21:09:51,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 21:09:51,032 INFO L241 Difference]: Finished difference. Result has 38 places, 30 transitions, 110 flow [2021-06-11 21:09:51,032 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2021-06-11 21:09:51,032 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2021-06-11 21:09:51,032 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:51,033 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 110 flow [2021-06-11 21:09:51,033 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 110 flow [2021-06-11 21:09:51,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 110 flow [2021-06-11 21:09:51,046 INFO L129 PetriNetUnfolder]: 8/54 cut-off events. [2021-06-11 21:09:51,046 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-11 21:09:51,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 54 events. 8/54 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2021-06-11 21:09:51,048 INFO L151 LiptonReduction]: Number of co-enabled transitions 298 [2021-06-11 21:09:51,065 INFO L163 LiptonReduction]: Checked pairs total: 60 [2021-06-11 21:09:51,065 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:51,065 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-06-11 21:09:51,067 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 110 flow [2021-06-11 21:09:51,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,067 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:51,067 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:51,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-11 21:09:51,067 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1128265854, now seen corresponding path program 3 times [2021-06-11 21:09:51,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:51,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953004092] [2021-06-11 21:09:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:51,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:09:51,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:51,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:51,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953004092] [2021-06-11 21:09:51,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:51,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 21:09:51,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037434444] [2021-06-11 21:09:51,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 21:09:51,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 21:09:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 21:09:51,167 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 52 [2021-06-11 21:09:51,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:51,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 52 [2021-06-11 21:09:51,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:51,230 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][32], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 22#L38true, 8#L51-1true, 72#(and v_assert (not b2)), Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0))]) [2021-06-11 21:09:51,231 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,231 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,231 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,231 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,232 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][31], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 19#thread2ENTRYtrue, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true]) [2021-06-11 21:09:51,232 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,232 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,232 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,233 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,233 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][31], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 19#thread2ENTRYtrue, 4#thread5EXITtrue, 8#L51-1true, 72#(and v_assert (not b2)), Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true]) [2021-06-11 21:09:51,233 INFO L384 tUnfolder$Statistics]: this new event has 9 ancestors and is not cut-off event [2021-06-11 21:09:51,233 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,233 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 21:09:51,233 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,234 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 21:09:51,234 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][32], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 22#L38true, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true]) [2021-06-11 21:09:51,234 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,234 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,234 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,234 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,234 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,241 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 21#L40-1true, 26#thread1ENTRYtrue, 63#(and v_assert (not b1))]) [2021-06-11 21:09:51,242 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,242 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,242 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,242 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,243 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][37], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true]) [2021-06-11 21:09:51,244 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,244 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,244 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,244 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,244 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][32], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 22#L38true, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0))]) [2021-06-11 21:09:51,244 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,245 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,245 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,245 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,245 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,245 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,246 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 46#L25true, 14#L62-1true, 21#L40-1true, 63#(and v_assert (not b1))]) [2021-06-11 21:09:51,247 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,247 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,247 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,247 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,247 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true]) [2021-06-11 21:09:51,247 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,247 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,247 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,247 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,261 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 21#L40-1true, 26#thread1ENTRYtrue, 63#(and v_assert (not b1))]) [2021-06-11 21:09:51,262 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,262 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,262 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,262 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 21:09:51,262 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 21:09:51,262 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 46#L25true, 21#L40-1true, 63#(and v_assert (not b1))]) [2021-06-11 21:09:51,262 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,263 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,263 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,263 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,263 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,264 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true]) [2021-06-11 21:09:51,264 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,264 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,265 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,265 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,265 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,265 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][37], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0))]) [2021-06-11 21:09:51,265 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,265 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,265 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,266 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,266 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,266 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][37], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true]) [2021-06-11 21:09:51,266 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2021-06-11 21:09:51,266 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,266 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,266 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,266 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,267 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,267 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true]) [2021-06-11 21:09:51,267 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,267 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,267 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,267 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,267 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,267 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,284 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][47], [Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 67#true, 4#thread5EXITtrue, 21#L40-1true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true]) [2021-06-11 21:09:51,284 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,284 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,284 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,284 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,284 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,284 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,285 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,293 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][52], [Black: 60#(not b1), 33#thread5ENTRYtrue, Black: 61#v_assert, 67#true, 20#L85true, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0))]) [2021-06-11 21:09:51,293 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2021-06-11 21:09:51,293 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,293 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,293 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,305 INFO L129 PetriNetUnfolder]: 299/609 cut-off events. [2021-06-11 21:09:51,305 INFO L130 PetriNetUnfolder]: For 237/279 co-relation queries the response was YES. [2021-06-11 21:09:51,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 609 events. 299/609 cut-off events. For 237/279 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3106 event pairs, 16 based on Foata normal form. 5/595 useless extension candidates. Maximal degree in co-relation 1025. Up to 203 conditions per place. [2021-06-11 21:09:51,310 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 15 selfloop transitions, 11 changer transitions 30/72 dead transitions. [2021-06-11 21:09:51,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 366 flow [2021-06-11 21:09:51,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 21:09:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 21:09:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 370 transitions. [2021-06-11 21:09:51,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7905982905982906 [2021-06-11 21:09:51,313 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 370 transitions. [2021-06-11 21:09:51,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 370 transitions. [2021-06-11 21:09:51,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:51,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 370 transitions. [2021-06-11 21:09:51,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 41.111111111111114) internal successors, (370), 9 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,316 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,317 INFO L185 Difference]: Start difference. First operand has 38 places, 30 transitions, 110 flow. Second operand 9 states and 370 transitions. [2021-06-11 21:09:51,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 366 flow [2021-06-11 21:09:51,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 21:09:51,320 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 184 flow [2021-06-11 21:09:51,320 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2021-06-11 21:09:51,320 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2021-06-11 21:09:51,320 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:51,321 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 184 flow [2021-06-11 21:09:51,321 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 184 flow [2021-06-11 21:09:51,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 184 flow [2021-06-11 21:09:51,330 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][15], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,330 INFO L384 tUnfolder$Statistics]: this new event has 9 ancestors and is not cut-off event [2021-06-11 21:09:51,330 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,330 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 21:09:51,330 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,331 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][15], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,331 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,331 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,331 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,331 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,331 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-06-11 21:09:51,332 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,332 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,332 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,332 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,333 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,333 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,333 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,333 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,333 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,333 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,333 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,334 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,334 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,334 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,335 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,335 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,336 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,336 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2021-06-11 21:09:51,336 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,336 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,336 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,336 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,336 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,337 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,337 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,337 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,337 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,337 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,337 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,338 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][24], [Black: 79#(= min max), Black: 60#(not b1), Black: 61#v_assert, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,338 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,338 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,338 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,338 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,338 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,339 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,339 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][34], [Black: 79#(= min max), 33#thread5ENTRYtrue, Black: 60#(not b1), Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0)), 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,339 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2021-06-11 21:09:51,339 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,339 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,339 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,340 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][34], [Black: 79#(= min max), 33#thread5ENTRYtrue, Black: 60#(not b1), Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 14#L62-1true, 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,340 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,340 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 21:09:51,340 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 21:09:51,340 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,342 INFO L129 PetriNetUnfolder]: 98/189 cut-off events. [2021-06-11 21:09:51,342 INFO L130 PetriNetUnfolder]: For 385/394 co-relation queries the response was YES. [2021-06-11 21:09:51,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 189 events. 98/189 cut-off events. For 385/394 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 686 event pairs, 5 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 582. Up to 82 conditions per place. [2021-06-11 21:09:51,347 INFO L151 LiptonReduction]: Number of co-enabled transitions 394 [2021-06-11 21:09:51,352 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:51,352 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:51,352 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-06-11 21:09:51,353 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 184 flow [2021-06-11 21:09:51,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:51,354 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:51,354 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-11 21:09:51,354 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:51,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1488375128, now seen corresponding path program 4 times [2021-06-11 21:09:51,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:51,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979977813] [2021-06-11 21:09:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:51,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:09:51,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:51,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:51,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979977813] [2021-06-11 21:09:51,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:51,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 21:09:51,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599984113] [2021-06-11 21:09:51,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 21:09:51,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:51,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 21:09:51,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 21:09:51,389 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 52 [2021-06-11 21:09:51,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:51,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 52 [2021-06-11 21:09:51,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:51,451 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,451 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,451 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,451 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,451 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,454 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,455 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,455 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,455 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,455 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,457 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 22#L38true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,457 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,457 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,457 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,457 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,458 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 76#true, 44#L27-1true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,458 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,458 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,458 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,458 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,458 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,466 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 19#thread2ENTRYtrue, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,466 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,466 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 21:09:51,466 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,466 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is not cut-off event [2021-06-11 21:09:51,467 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2021-06-11 21:09:51,467 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 22#L38true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,467 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,467 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,467 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,467 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,467 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,469 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,469 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,469 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,469 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,469 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,469 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,469 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,470 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,470 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,471 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,471 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,471 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,471 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,471 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,471 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,471 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,472 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,472 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,472 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,472 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,473 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][48], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, Black: 61#v_assert, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,473 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,473 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,473 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,473 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,484 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][34], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, 72#(and v_assert (not b2)), Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 22#L38true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,484 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,485 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,485 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,485 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,486 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,486 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,486 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,486 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,486 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,486 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,486 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,486 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,486 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,487 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][53], [Black: 79#(= min max), 33#thread5ENTRYtrue, 97#true, Black: 60#(not b1), Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0)), 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,487 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 21:09:51,487 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:09:51,487 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:09:51,487 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:09:51,487 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,487 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,488 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,488 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,488 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,488 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,489 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][48], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, Black: 61#v_assert, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,489 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,489 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,489 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,489 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,489 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,490 INFO L382 tUnfolder$Statistics]: inserting event number 9 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][49], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, Black: 61#v_assert, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 44#L27-1true, 76#true, 14#L62-1true, 21#L40-1true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,490 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,490 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,490 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,490 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,490 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,490 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,490 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,490 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,490 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,499 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][53], [Black: 79#(= min max), 33#thread5ENTRYtrue, Black: 60#(not b1), 97#true, Black: 61#v_assert, 8#L51-1true, Black: 69#(not b2), Black: 70#v_assert, 14#L62-1true, 78#(= max (select A 0)), 20#L85true, Black: 80#v_assert, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 86#(and v_assert (= min max)), Black: 88#(and v_assert (= max (select A 0)))]) [2021-06-11 21:09:51,500 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,500 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,500 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 21:09:51,500 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,500 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 21:09:51,507 INFO L129 PetriNetUnfolder]: 218/394 cut-off events. [2021-06-11 21:09:51,507 INFO L130 PetriNetUnfolder]: For 1157/1249 co-relation queries the response was YES. [2021-06-11 21:09:51,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 394 events. 218/394 cut-off events. For 1157/1249 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1583 event pairs, 14 based on Foata normal form. 11/395 useless extension candidates. Maximal degree in co-relation 1521. Up to 192 conditions per place. [2021-06-11 21:09:51,512 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 21 selfloop transitions, 15 changer transitions 23/75 dead transitions. [2021-06-11 21:09:51,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 619 flow [2021-06-11 21:09:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 21:09:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 21:09:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 370 transitions. [2021-06-11 21:09:51,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7905982905982906 [2021-06-11 21:09:51,514 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 370 transitions. [2021-06-11 21:09:51,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 370 transitions. [2021-06-11 21:09:51,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:51,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 370 transitions. [2021-06-11 21:09:51,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 41.111111111111114) internal successors, (370), 9 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,517 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,517 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 184 flow. Second operand 9 states and 370 transitions. [2021-06-11 21:09:51,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 619 flow [2021-06-11 21:09:51,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 553 flow, removed 32 selfloop flow, removed 6 redundant places. [2021-06-11 21:09:51,523 INFO L241 Difference]: Finished difference. Result has 54 places, 46 transitions, 321 flow [2021-06-11 21:09:51,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=321, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2021-06-11 21:09:51,523 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2021-06-11 21:09:51,523 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:51,523 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 321 flow [2021-06-11 21:09:51,524 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 46 transitions, 321 flow [2021-06-11 21:09:51,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 321 flow [2021-06-11 21:09:51,537 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,537 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,537 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,538 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,538 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,538 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][5], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 19#thread2ENTRYtrue, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,538 INFO L384 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,538 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,538 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,539 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,539 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][5], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 19#thread2ENTRYtrue, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,539 INFO L384 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,539 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-06-11 21:09:51,539 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,540 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,540 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-06-11 21:09:51,540 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,541 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,541 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,541 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,541 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,541 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,541 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,542 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,542 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,542 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,542 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,542 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,542 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,545 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,545 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,545 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,545 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,545 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,545 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,545 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,545 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,546 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,546 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,546 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,546 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,546 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,547 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 14#L62-1true, 78#(= max (select A 0)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-06-11 21:09:51,547 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,547 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,547 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,547 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-06-11 21:09:51,548 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][5], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 72#(and v_assert (not b2)), 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 22#L38true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,549 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,549 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,549 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,549 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,549 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,550 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,550 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,550 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,550 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,550 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:09:51,550 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,550 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,550 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-06-11 21:09:51,550 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 34#L83true, 99#(= min (select A 0)), 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 76#true, 14#L62-1true, Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,551 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,551 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,551 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,551 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,551 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,551 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 44#L27-1true, 78#(= max (select A 0)), 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), 21#L40-1true, Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-06-11 21:09:51,552 INFO L384 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,552 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,552 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,552 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,552 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2021-06-11 21:09:51,552 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][40], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 33#thread5ENTRYtrue, 8#L51-1true, Black: 69#(not b2), 14#L62-1true, 78#(= max (select A 0)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 20#L85true, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-06-11 21:09:51,552 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 21:09:51,552 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:09:51,552 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:09:51,552 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:09:51,553 INFO L382 tUnfolder$Statistics]: inserting event number 9 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][9], [Black: 79#(= min max), 97#true, Black: 60#(not b1), 34#L83true, 4#thread5EXITtrue, 8#L51-1true, Black: 69#(not b2), 76#true, 44#L27-1true, 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), Black: 107#(and v_assert (= min max)), 21#L40-1true, Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0))), Black: 78#(= max (select A 0))]) [2021-06-11 21:09:51,553 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,553 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,553 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-06-11 21:09:51,553 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,553 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,553 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-06-11 21:09:51,554 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,554 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,554 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-06-11 21:09:51,555 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([129] thread2EXIT-->L85: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][40], [Black: 79#(= min max), Black: 60#(not b1), 97#true, 33#thread5ENTRYtrue, 8#L51-1true, Black: 69#(not b2), 78#(= max (select A 0)), 14#L62-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 101#v_assert, Black: 103#(and (= min (select A 0)) (= min max)), Black: 105#(and v_assert (= min (select A 0)) (= min max)), 20#L85true, Black: 107#(and v_assert (= min max)), Black: 109#(and v_assert (= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 84#(and v_assert (= min max) (= max (select A 0)))]) [2021-06-11 21:09:51,555 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,555 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,555 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-06-11 21:09:51,555 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 21:09:51,555 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 21:09:51,558 INFO L129 PetriNetUnfolder]: 158/299 cut-off events. [2021-06-11 21:09:51,558 INFO L130 PetriNetUnfolder]: For 1050/1107 co-relation queries the response was YES. [2021-06-11 21:09:51,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 299 events. 158/299 cut-off events. For 1050/1107 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1204 event pairs, 6 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 1180. Up to 132 conditions per place. [2021-06-11 21:09:51,565 INFO L151 LiptonReduction]: Number of co-enabled transitions 552 [2021-06-11 21:09:51,570 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:51,570 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:51,570 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-06-11 21:09:51,571 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 321 flow [2021-06-11 21:09:51,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:51,571 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:51,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-11 21:09:51,571 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:51,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1773407713, now seen corresponding path program 1 times [2021-06-11 21:09:51,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:51,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013511412] [2021-06-11 21:09:51,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:51,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,626 INFO L142 QuantifierPusher]: treesize reduction 24, result has 59.3 percent of original size [2021-06-11 21:09:51,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 21:09:51,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:09:51,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:51,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013511412] [2021-06-11 21:09:51,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679546664] [2021-06-11 21:09:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:09:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:51,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-11 21:09:51,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:09:51,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:09:51,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:51,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:09:51,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,769 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:09:51,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:51,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:09:51,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:51,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:51,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:51,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:09:51,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 8 [2021-06-11 21:09:51,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353558641] [2021-06-11 21:09:51,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 21:09:51,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 21:09:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-06-11 21:09:51,857 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2021-06-11 21:09:51,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 321 flow. Second operand has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:51,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:51,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2021-06-11 21:09:51,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:53,107 INFO L129 PetriNetUnfolder]: 4318/5895 cut-off events. [2021-06-11 21:09:53,108 INFO L130 PetriNetUnfolder]: For 28927/29143 co-relation queries the response was YES. [2021-06-11 21:09:53,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26512 conditions, 5895 events. 4318/5895 cut-off events. For 28927/29143 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 29947 event pairs, 228 based on Foata normal form. 167/6046 useless extension candidates. Maximal degree in co-relation 26423. Up to 2333 conditions per place. [2021-06-11 21:09:53,155 INFO L132 encePairwiseOnDemand]: 42/52 looper letters, 94 selfloop transitions, 42 changer transitions 170/318 dead transitions. [2021-06-11 21:09:53,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 318 transitions, 2922 flow [2021-06-11 21:09:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-11 21:09:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-06-11 21:09:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 998 transitions. [2021-06-11 21:09:53,159 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6397435897435897 [2021-06-11 21:09:53,159 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 998 transitions. [2021-06-11 21:09:53,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 998 transitions. [2021-06-11 21:09:53,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:53,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 998 transitions. [2021-06-11 21:09:53,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 33.266666666666666) internal successors, (998), 30 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:53,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 52.0) internal successors, (1612), 31 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:53,165 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 52.0) internal successors, (1612), 31 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:53,165 INFO L185 Difference]: Start difference. First operand has 50 places, 46 transitions, 321 flow. Second operand 30 states and 998 transitions. [2021-06-11 21:09:53,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 318 transitions, 2922 flow [2021-06-11 21:09:53,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 318 transitions, 2584 flow, removed 169 selfloop flow, removed 3 redundant places. [2021-06-11 21:09:53,274 INFO L241 Difference]: Finished difference. Result has 102 places, 68 transitions, 770 flow [2021-06-11 21:09:53,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=770, PETRI_PLACES=102, PETRI_TRANSITIONS=68} [2021-06-11 21:09:53,275 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2021-06-11 21:09:53,275 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:53,275 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 68 transitions, 770 flow [2021-06-11 21:09:53,275 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 68 transitions, 770 flow [2021-06-11 21:09:53,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 68 transitions, 770 flow [2021-06-11 21:09:53,348 INFO L129 PetriNetUnfolder]: 336/649 cut-off events. [2021-06-11 21:09:53,348 INFO L130 PetriNetUnfolder]: For 15168/15284 co-relation queries the response was YES. [2021-06-11 21:09:53,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 649 events. 336/649 cut-off events. For 15168/15284 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3316 event pairs, 33 based on Foata normal form. 5/605 useless extension candidates. Maximal degree in co-relation 4356. Up to 317 conditions per place. [2021-06-11 21:09:53,435 INFO L151 LiptonReduction]: Number of co-enabled transitions 824 [2021-06-11 21:09:53,445 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:53,445 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:53,445 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 170 [2021-06-11 21:09:53,448 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 770 flow [2021-06-11 21:09:53,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 26.22222222222222) internal successors, (236), 9 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:53,448 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:53,448 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:53,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:09:53,665 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:53,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1731414259, now seen corresponding path program 1 times [2021-06-11 21:09:53,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:53,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539823549] [2021-06-11 21:09:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:53,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,723 INFO L142 QuantifierPusher]: treesize reduction 14, result has 56.3 percent of original size [2021-06-11 21:09:53,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 21:09:53,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:53,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:09:53,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:53,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539823549] [2021-06-11 21:09:53,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934139219] [2021-06-11 21:09:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:09:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:53,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-11 21:09:53,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:09:53,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:09:53,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:53,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:09:53,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,844 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:09:53,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:53,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:09:53,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:53,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:53,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:53,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-11 21:09:53,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2021-06-11 21:09:53,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325481065] [2021-06-11 21:09:53,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:53,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-11 21:09:53,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:09:53,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 770 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:53,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:53,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:09:53,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:54,507 INFO L129 PetriNetUnfolder]: 3099/4445 cut-off events. [2021-06-11 21:09:54,507 INFO L130 PetriNetUnfolder]: For 104161/104978 co-relation queries the response was YES. [2021-06-11 21:09:54,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31324 conditions, 4445 events. 3099/4445 cut-off events. For 104161/104978 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 23545 event pairs, 675 based on Foata normal form. 334/4385 useless extension candidates. Maximal degree in co-relation 31133. Up to 1813 conditions per place. [2021-06-11 21:09:54,625 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 57 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2021-06-11 21:09:54,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 102 transitions, 1362 flow [2021-06-11 21:09:54,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 21:09:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 21:09:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2021-06-11 21:09:54,626 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7355769230769231 [2021-06-11 21:09:54,626 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 153 transitions. [2021-06-11 21:09:54,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 153 transitions. [2021-06-11 21:09:54,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:54,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 153 transitions. [2021-06-11 21:09:54,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:54,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:54,628 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:54,628 INFO L185 Difference]: Start difference. First operand has 86 places, 68 transitions, 770 flow. Second operand 4 states and 153 transitions. [2021-06-11 21:09:54,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 102 transitions, 1362 flow [2021-06-11 21:09:54,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 1183 flow, removed 77 selfloop flow, removed 16 redundant places. [2021-06-11 21:09:54,802 INFO L241 Difference]: Finished difference. Result has 75 places, 79 transitions, 843 flow [2021-06-11 21:09:54,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=843, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2021-06-11 21:09:54,802 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2021-06-11 21:09:54,802 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:54,802 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 79 transitions, 843 flow [2021-06-11 21:09:54,802 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 79 transitions, 843 flow [2021-06-11 21:09:54,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 843 flow [2021-06-11 21:09:54,888 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][30], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 60#(not b1), 4#thread5EXITtrue, Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 191#(and (= i 0) (<= j i)), Black: 69#(not b2), 11#thread2EXITtrue, 267#true, 76#true, 14#L62-1true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 79#(= min max), 97#true, 34#L83true, 44#L27-1true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 213#(and (<= min max) (< j N) (<= j i)), Black: 217#(and (<= min max) (<= min (select A 0))), Black: 225#(and v_assert (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-06-11 21:09:54,889 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 21:09:54,889 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:09:54,889 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 21:09:54,889 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:09:54,898 INFO L129 PetriNetUnfolder]: 585/1047 cut-off events. [2021-06-11 21:09:54,898 INFO L130 PetriNetUnfolder]: For 12500/12745 co-relation queries the response was YES. [2021-06-11 21:09:54,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6395 conditions, 1047 events. 585/1047 cut-off events. For 12500/12745 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5551 event pairs, 76 based on Foata normal form. 29/997 useless extension candidates. Maximal degree in co-relation 6202. Up to 546 conditions per place. [2021-06-11 21:09:54,944 INFO L151 LiptonReduction]: Number of co-enabled transitions 940 [2021-06-11 21:09:54,956 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:54,956 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:54,957 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 155 [2021-06-11 21:09:54,957 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 843 flow [2021-06-11 21:09:54,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:54,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:54,957 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:55,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:09:55,165 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:55,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:55,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1680079630, now seen corresponding path program 1 times [2021-06-11 21:09:55,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:55,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092226296] [2021-06-11 21:09:55,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:55,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:55,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:55,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:55,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:55,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:55,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:55,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092226296] [2021-06-11 21:09:55,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:55,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 21:09:55,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674328258] [2021-06-11 21:09:55,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:55,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:55,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:55,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 21:09:55,193 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:09:55,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 843 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:55,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:55,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:09:55,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:55,760 INFO L129 PetriNetUnfolder]: 3558/5257 cut-off events. [2021-06-11 21:09:55,760 INFO L130 PetriNetUnfolder]: For 65082/65931 co-relation queries the response was YES. [2021-06-11 21:09:55,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31935 conditions, 5257 events. 3558/5257 cut-off events. For 65082/65931 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 29921 event pairs, 272 based on Foata normal form. 402/5492 useless extension candidates. Maximal degree in co-relation 31502. Up to 2086 conditions per place. [2021-06-11 21:09:55,873 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 130 selfloop transitions, 19 changer transitions 7/179 dead transitions. [2021-06-11 21:09:55,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 179 transitions, 2337 flow [2021-06-11 21:09:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 21:09:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 21:09:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2021-06-11 21:09:55,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7346153846153847 [2021-06-11 21:09:55,875 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2021-06-11 21:09:55,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2021-06-11 21:09:55,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:55,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2021-06-11 21:09:55,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:55,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:55,877 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:55,877 INFO L185 Difference]: Start difference. First operand has 75 places, 79 transitions, 843 flow. Second operand 5 states and 191 transitions. [2021-06-11 21:09:55,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 179 transitions, 2337 flow [2021-06-11 21:09:55,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 179 transitions, 2270 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-06-11 21:09:55,949 INFO L241 Difference]: Finished difference. Result has 79 places, 95 transitions, 1108 flow [2021-06-11 21:09:55,950 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1108, PETRI_PLACES=79, PETRI_TRANSITIONS=95} [2021-06-11 21:09:55,950 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 42 predicate places. [2021-06-11 21:09:55,950 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:55,950 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 95 transitions, 1108 flow [2021-06-11 21:09:55,951 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 95 transitions, 1108 flow [2021-06-11 21:09:55,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 95 transitions, 1108 flow [2021-06-11 21:09:56,050 INFO L129 PetriNetUnfolder]: 646/1245 cut-off events. [2021-06-11 21:09:56,050 INFO L130 PetriNetUnfolder]: For 14011/14407 co-relation queries the response was YES. [2021-06-11 21:09:56,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7418 conditions, 1245 events. 646/1245 cut-off events. For 14011/14407 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7495 event pairs, 87 based on Foata normal form. 80/1228 useless extension candidates. Maximal degree in co-relation 7149. Up to 621 conditions per place. [2021-06-11 21:09:56,074 INFO L151 LiptonReduction]: Number of co-enabled transitions 1174 [2021-06-11 21:09:56,089 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:56,090 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:56,090 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 140 [2021-06-11 21:09:56,091 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 95 transitions, 1108 flow [2021-06-11 21:09:56,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:56,091 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:56,091 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:56,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 21:09:56,092 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:56,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1656016788, now seen corresponding path program 2 times [2021-06-11 21:09:56,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:56,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346640258] [2021-06-11 21:09:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:56,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:56,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:56,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:56,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:56,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:56,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:56,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346640258] [2021-06-11 21:09:56,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:56,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 21:09:56,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122864189] [2021-06-11 21:09:56,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:56,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:56,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 21:09:56,136 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:09:56,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 95 transitions, 1108 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:56,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:56,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:09:56,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:56,795 INFO L129 PetriNetUnfolder]: 3407/5126 cut-off events. [2021-06-11 21:09:56,795 INFO L130 PetriNetUnfolder]: For 66930/67860 co-relation queries the response was YES. [2021-06-11 21:09:56,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32122 conditions, 5126 events. 3407/5126 cut-off events. For 66930/67860 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 30313 event pairs, 346 based on Foata normal form. 383/5330 useless extension candidates. Maximal degree in co-relation 31672. Up to 1969 conditions per place. [2021-06-11 21:09:56,848 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 132 selfloop transitions, 26 changer transitions 6/187 dead transitions. [2021-06-11 21:09:56,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 187 transitions, 2528 flow [2021-06-11 21:09:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 21:09:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 21:09:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2021-06-11 21:09:56,850 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7346153846153847 [2021-06-11 21:09:56,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2021-06-11 21:09:56,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2021-06-11 21:09:56,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:56,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2021-06-11 21:09:56,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:56,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:56,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:56,851 INFO L185 Difference]: Start difference. First operand has 77 places, 95 transitions, 1108 flow. Second operand 5 states and 191 transitions. [2021-06-11 21:09:56,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 187 transitions, 2528 flow [2021-06-11 21:09:56,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 187 transitions, 2490 flow, removed 19 selfloop flow, removed 2 redundant places. [2021-06-11 21:09:56,909 INFO L241 Difference]: Finished difference. Result has 81 places, 113 transitions, 1417 flow [2021-06-11 21:09:56,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1417, PETRI_PLACES=81, PETRI_TRANSITIONS=113} [2021-06-11 21:09:56,909 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2021-06-11 21:09:56,909 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:56,910 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 113 transitions, 1417 flow [2021-06-11 21:09:56,910 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 113 transitions, 1417 flow [2021-06-11 21:09:56,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 113 transitions, 1417 flow [2021-06-11 21:09:57,007 INFO L129 PetriNetUnfolder]: 736/1396 cut-off events. [2021-06-11 21:09:57,008 INFO L130 PetriNetUnfolder]: For 15698/16078 co-relation queries the response was YES. [2021-06-11 21:09:57,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 1396 events. 736/1396 cut-off events. For 15698/16078 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8597 event pairs, 101 based on Foata normal form. 84/1377 useless extension candidates. Maximal degree in co-relation 8461. Up to 706 conditions per place. [2021-06-11 21:09:57,034 INFO L151 LiptonReduction]: Number of co-enabled transitions 1312 [2021-06-11 21:09:57,054 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:57,054 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:57,054 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 145 [2021-06-11 21:09:57,055 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 113 transitions, 1417 flow [2021-06-11 21:09:57,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:57,055 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:57,055 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:57,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 21:09:57,055 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:57,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash -458232876, now seen corresponding path program 3 times [2021-06-11 21:09:57,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:57,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134779233] [2021-06-11 21:09:57,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:57,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:57,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:57,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:57,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:57,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:57,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:57,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134779233] [2021-06-11 21:09:57,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:57,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 21:09:57,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54496737] [2021-06-11 21:09:57,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:57,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 21:09:57,125 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:09:57,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 113 transitions, 1417 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:57,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:57,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:09:57,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:57,694 INFO L129 PetriNetUnfolder]: 3513/5312 cut-off events. [2021-06-11 21:09:57,694 INFO L130 PetriNetUnfolder]: For 71126/72321 co-relation queries the response was YES. [2021-06-11 21:09:57,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34051 conditions, 5312 events. 3513/5312 cut-off events. For 71126/72321 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 32014 event pairs, 431 based on Foata normal form. 421/5497 useless extension candidates. Maximal degree in co-relation 33585. Up to 2141 conditions per place. [2021-06-11 21:09:57,804 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 149 selfloop transitions, 30 changer transitions 5/207 dead transitions. [2021-06-11 21:09:57,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 207 transitions, 2970 flow [2021-06-11 21:09:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 21:09:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 21:09:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2021-06-11 21:09:57,805 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7346153846153847 [2021-06-11 21:09:57,806 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2021-06-11 21:09:57,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2021-06-11 21:09:57,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:57,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2021-06-11 21:09:57,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:57,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:57,807 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:57,807 INFO L185 Difference]: Start difference. First operand has 81 places, 113 transitions, 1417 flow. Second operand 5 states and 191 transitions. [2021-06-11 21:09:57,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 207 transitions, 2970 flow [2021-06-11 21:09:57,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 207 transitions, 2966 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-06-11 21:09:57,867 INFO L241 Difference]: Finished difference. Result has 87 places, 140 transitions, 1894 flow [2021-06-11 21:09:57,867 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1894, PETRI_PLACES=87, PETRI_TRANSITIONS=140} [2021-06-11 21:09:57,867 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 50 predicate places. [2021-06-11 21:09:57,867 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:57,868 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 140 transitions, 1894 flow [2021-06-11 21:09:57,868 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 140 transitions, 1894 flow [2021-06-11 21:09:57,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 140 transitions, 1894 flow [2021-06-11 21:09:58,020 INFO L129 PetriNetUnfolder]: 807/1514 cut-off events. [2021-06-11 21:09:58,020 INFO L130 PetriNetUnfolder]: For 20484/21153 co-relation queries the response was YES. [2021-06-11 21:09:58,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10425 conditions, 1514 events. 807/1514 cut-off events. For 20484/21153 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 9469 event pairs, 101 based on Foata normal form. 124/1504 useless extension candidates. Maximal degree in co-relation 10146. Up to 763 conditions per place. [2021-06-11 21:09:58,054 INFO L151 LiptonReduction]: Number of co-enabled transitions 1592 [2021-06-11 21:09:58,085 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:58,086 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:58,086 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 219 [2021-06-11 21:09:58,086 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 140 transitions, 1894 flow [2021-06-11 21:09:58,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:58,087 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:58,087 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:58,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 21:09:58,087 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1249508918, now seen corresponding path program 4 times [2021-06-11 21:09:58,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:58,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410499092] [2021-06-11 21:09:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:58,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:58,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:58,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:58,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:09:58,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:58,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:58,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410499092] [2021-06-11 21:09:58,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:58,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 21:09:58,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287204365] [2021-06-11 21:09:58,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:58,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:58,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:58,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 21:09:58,146 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:09:58,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 140 transitions, 1894 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:58,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:58,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:09:58,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:58,557 INFO L129 PetriNetUnfolder]: 2889/4342 cut-off events. [2021-06-11 21:09:58,557 INFO L130 PetriNetUnfolder]: For 64550/65831 co-relation queries the response was YES. [2021-06-11 21:09:58,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30694 conditions, 4342 events. 2889/4342 cut-off events. For 64550/65831 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 24796 event pairs, 633 based on Foata normal form. 347/4390 useless extension candidates. Maximal degree in co-relation 30322. Up to 2252 conditions per place. [2021-06-11 21:09:58,597 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 93 selfloop transitions, 41 changer transitions 1/158 dead transitions. [2021-06-11 21:09:58,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 158 transitions, 2398 flow [2021-06-11 21:09:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 21:09:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 21:09:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2021-06-11 21:09:58,599 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7355769230769231 [2021-06-11 21:09:58,599 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 153 transitions. [2021-06-11 21:09:58,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 153 transitions. [2021-06-11 21:09:58,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:58,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 153 transitions. [2021-06-11 21:09:58,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:58,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:58,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:58,600 INFO L185 Difference]: Start difference. First operand has 87 places, 140 transitions, 1894 flow. Second operand 4 states and 153 transitions. [2021-06-11 21:09:58,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 158 transitions, 2398 flow [2021-06-11 21:09:58,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 158 transitions, 2398 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 21:09:58,672 INFO L241 Difference]: Finished difference. Result has 91 places, 139 transitions, 1998 flow [2021-06-11 21:09:58,673 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1998, PETRI_PLACES=91, PETRI_TRANSITIONS=139} [2021-06-11 21:09:58,673 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 54 predicate places. [2021-06-11 21:09:58,673 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:58,673 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 139 transitions, 1998 flow [2021-06-11 21:09:58,673 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 139 transitions, 1998 flow [2021-06-11 21:09:58,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 139 transitions, 1998 flow [2021-06-11 21:09:58,808 INFO L129 PetriNetUnfolder]: 670/1233 cut-off events. [2021-06-11 21:09:58,808 INFO L130 PetriNetUnfolder]: For 18067/18603 co-relation queries the response was YES. [2021-06-11 21:09:58,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8915 conditions, 1233 events. 670/1233 cut-off events. For 18067/18603 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7343 event pairs, 84 based on Foata normal form. 111/1258 useless extension candidates. Maximal degree in co-relation 8728. Up to 637 conditions per place. [2021-06-11 21:09:58,833 INFO L151 LiptonReduction]: Number of co-enabled transitions 1490 [2021-06-11 21:09:58,854 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:58,855 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:58,855 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 182 [2021-06-11 21:09:58,855 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 139 transitions, 1998 flow [2021-06-11 21:09:58,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:58,855 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:58,855 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:58,855 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 21:09:58,856 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:58,856 INFO L82 PathProgramCache]: Analyzing trace with hash -306177054, now seen corresponding path program 1 times [2021-06-11 21:09:58,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:58,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891554375] [2021-06-11 21:09:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:58,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:58,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:58,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:58,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:58,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:58,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:58,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891554375] [2021-06-11 21:09:58,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:58,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 21:09:58,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68980124] [2021-06-11 21:09:58,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:58,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:58,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:58,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 21:09:58,894 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:09:58,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 139 transitions, 1998 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:58,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:58,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:09:58,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:59,213 INFO L129 PetriNetUnfolder]: 2528/3683 cut-off events. [2021-06-11 21:09:59,214 INFO L130 PetriNetUnfolder]: For 64548/65690 co-relation queries the response was YES. [2021-06-11 21:09:59,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27773 conditions, 3683 events. 2528/3683 cut-off events. For 64548/65690 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 19840 event pairs, 407 based on Foata normal form. 331/3735 useless extension candidates. Maximal degree in co-relation 27555. Up to 1887 conditions per place. [2021-06-11 21:09:59,247 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 126 selfloop transitions, 33 changer transitions 25/207 dead transitions. [2021-06-11 21:09:59,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 207 transitions, 3364 flow [2021-06-11 21:09:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 21:09:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 21:09:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2021-06-11 21:09:59,249 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7346153846153847 [2021-06-11 21:09:59,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2021-06-11 21:09:59,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2021-06-11 21:09:59,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:59,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2021-06-11 21:09:59,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,251 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,251 INFO L185 Difference]: Start difference. First operand has 91 places, 139 transitions, 1998 flow. Second operand 5 states and 191 transitions. [2021-06-11 21:09:59,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 207 transitions, 3364 flow [2021-06-11 21:09:59,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 207 transitions, 3294 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 21:09:59,322 INFO L241 Difference]: Finished difference. Result has 94 places, 134 transitions, 1996 flow [2021-06-11 21:09:59,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1996, PETRI_PLACES=94, PETRI_TRANSITIONS=134} [2021-06-11 21:09:59,323 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 57 predicate places. [2021-06-11 21:09:59,323 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:59,323 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 134 transitions, 1996 flow [2021-06-11 21:09:59,323 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 134 transitions, 1996 flow [2021-06-11 21:09:59,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 134 transitions, 1996 flow [2021-06-11 21:09:59,419 INFO L129 PetriNetUnfolder]: 547/994 cut-off events. [2021-06-11 21:09:59,419 INFO L130 PetriNetUnfolder]: For 14484/14866 co-relation queries the response was YES. [2021-06-11 21:09:59,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7428 conditions, 994 events. 547/994 cut-off events. For 14484/14866 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5522 event pairs, 65 based on Foata normal form. 71/1005 useless extension candidates. Maximal degree in co-relation 7299. Up to 541 conditions per place. [2021-06-11 21:09:59,431 INFO L151 LiptonReduction]: Number of co-enabled transitions 1336 [2021-06-11 21:09:59,438 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:59,438 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:59,438 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 115 [2021-06-11 21:09:59,439 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 134 transitions, 1996 flow [2021-06-11 21:09:59,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:59,439 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:59,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 21:09:59,439 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:59,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:59,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1204053262, now seen corresponding path program 2 times [2021-06-11 21:09:59,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:59,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686108642] [2021-06-11 21:09:59,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:59,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:59,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:59,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:59,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:09:59,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:59,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:59,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686108642] [2021-06-11 21:09:59,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:59,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 21:09:59,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679687438] [2021-06-11 21:09:59,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:59,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:59,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:59,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 21:09:59,458 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:09:59,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 134 transitions, 1996 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:59,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:09:59,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:09:59,781 INFO L129 PetriNetUnfolder]: 2568/3742 cut-off events. [2021-06-11 21:09:59,781 INFO L130 PetriNetUnfolder]: For 68448/69694 co-relation queries the response was YES. [2021-06-11 21:09:59,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28729 conditions, 3742 events. 2568/3742 cut-off events. For 68448/69694 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 20038 event pairs, 403 based on Foata normal form. 275/3756 useless extension candidates. Maximal degree in co-relation 28512. Up to 2170 conditions per place. [2021-06-11 21:09:59,808 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 160 selfloop transitions, 27 changer transitions 6/216 dead transitions. [2021-06-11 21:09:59,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 216 transitions, 3599 flow [2021-06-11 21:09:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 21:09:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 21:09:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2021-06-11 21:09:59,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7192307692307692 [2021-06-11 21:09:59,809 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 187 transitions. [2021-06-11 21:09:59,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 187 transitions. [2021-06-11 21:09:59,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:09:59,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 187 transitions. [2021-06-11 21:09:59,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,811 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,811 INFO L185 Difference]: Start difference. First operand has 93 places, 134 transitions, 1996 flow. Second operand 5 states and 187 transitions. [2021-06-11 21:09:59,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 216 transitions, 3599 flow [2021-06-11 21:09:59,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 216 transitions, 3546 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-06-11 21:09:59,857 INFO L241 Difference]: Finished difference. Result has 98 places, 150 transitions, 2318 flow [2021-06-11 21:09:59,857 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2318, PETRI_PLACES=98, PETRI_TRANSITIONS=150} [2021-06-11 21:09:59,857 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2021-06-11 21:09:59,857 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:09:59,857 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 150 transitions, 2318 flow [2021-06-11 21:09:59,857 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 150 transitions, 2318 flow [2021-06-11 21:09:59,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 150 transitions, 2318 flow [2021-06-11 21:09:59,927 INFO L129 PetriNetUnfolder]: 634/1107 cut-off events. [2021-06-11 21:09:59,927 INFO L130 PetriNetUnfolder]: For 16630/16949 co-relation queries the response was YES. [2021-06-11 21:09:59,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8838 conditions, 1107 events. 634/1107 cut-off events. For 16630/16949 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6125 event pairs, 76 based on Foata normal form. 62/1099 useless extension candidates. Maximal degree in co-relation 8703. Up to 573 conditions per place. [2021-06-11 21:09:59,948 INFO L151 LiptonReduction]: Number of co-enabled transitions 1404 [2021-06-11 21:09:59,960 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:09:59,960 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:09:59,960 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 103 [2021-06-11 21:09:59,960 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 150 transitions, 2318 flow [2021-06-11 21:09:59,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:09:59,961 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:09:59,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 21:09:59,961 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:09:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:09:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash -605505822, now seen corresponding path program 3 times [2021-06-11 21:09:59,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:09:59,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545001709] [2021-06-11 21:09:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:09:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:09:59,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:59,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:09:59,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:59,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:09:59,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:09:59,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:09:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 21:09:59,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545001709] [2021-06-11 21:09:59,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 21:09:59,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 21:09:59,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693928555] [2021-06-11 21:09:59,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 21:09:59,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:09:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 21:09:59,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 21:09:59,998 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:09:59,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 150 transitions, 2318 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:09:59,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:09:59,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:09:59,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:10:00,359 INFO L129 PetriNetUnfolder]: 2249/3280 cut-off events. [2021-06-11 21:10:00,359 INFO L130 PetriNetUnfolder]: For 62170/63110 co-relation queries the response was YES. [2021-06-11 21:10:00,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26830 conditions, 3280 events. 2249/3280 cut-off events. For 62170/63110 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 16904 event pairs, 521 based on Foata normal form. 178/3258 useless extension candidates. Maximal degree in co-relation 26597. Up to 2289 conditions per place. [2021-06-11 21:10:00,387 INFO L132 encePairwiseOnDemand]: 48/52 looper letters, 101 selfloop transitions, 32 changer transitions 1/157 dead transitions. [2021-06-11 21:10:00,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 157 transitions, 2710 flow [2021-06-11 21:10:00,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 21:10:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 21:10:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2021-06-11 21:10:00,389 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2021-06-11 21:10:00,389 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 152 transitions. [2021-06-11 21:10:00,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 152 transitions. [2021-06-11 21:10:00,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:10:00,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 152 transitions. [2021-06-11 21:10:00,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:00,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:00,391 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:00,391 INFO L185 Difference]: Start difference. First operand has 98 places, 150 transitions, 2318 flow. Second operand 4 states and 152 transitions. [2021-06-11 21:10:00,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 157 transitions, 2710 flow [2021-06-11 21:10:00,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 157 transitions, 2668 flow, removed 21 selfloop flow, removed 0 redundant places. [2021-06-11 21:10:00,466 INFO L241 Difference]: Finished difference. Result has 102 places, 142 transitions, 2292 flow [2021-06-11 21:10:00,467 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2202, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2292, PETRI_PLACES=102, PETRI_TRANSITIONS=142} [2021-06-11 21:10:00,467 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2021-06-11 21:10:00,467 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:10:00,467 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 142 transitions, 2292 flow [2021-06-11 21:10:00,467 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 142 transitions, 2292 flow [2021-06-11 21:10:00,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 142 transitions, 2292 flow [2021-06-11 21:10:00,554 INFO L129 PetriNetUnfolder]: 642/1108 cut-off events. [2021-06-11 21:10:00,554 INFO L130 PetriNetUnfolder]: For 16379/16692 co-relation queries the response was YES. [2021-06-11 21:10:00,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8995 conditions, 1108 events. 642/1108 cut-off events. For 16379/16692 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6065 event pairs, 78 based on Foata normal form. 55/1094 useless extension candidates. Maximal degree in co-relation 8872. Up to 591 conditions per place. [2021-06-11 21:10:00,575 INFO L151 LiptonReduction]: Number of co-enabled transitions 1280 [2021-06-11 21:10:00,584 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:10:00,584 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:10:00,584 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 117 [2021-06-11 21:10:00,584 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 142 transitions, 2292 flow [2021-06-11 21:10:00,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:00,585 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:10:00,585 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:10:00,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 21:10:00,585 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:10:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:10:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2023630891, now seen corresponding path program 1 times [2021-06-11 21:10:00,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:10:00,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883980463] [2021-06-11 21:10:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:10:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:10:00,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:00,614 INFO L142 QuantifierPusher]: treesize reduction 28, result has 71.1 percent of original size [2021-06-11 21:10:00,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-06-11 21:10:00,640 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size [2021-06-11 21:10:00,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 21:10:00,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:00,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:00,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 21:10:00,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883980463] [2021-06-11 21:10:00,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188542553] [2021-06-11 21:10:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:10:00,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-11 21:10:00,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:10:00,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:00,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:00,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:10:00,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:00,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:00,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:10:00,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:00,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:00,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 21:10:00,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:10:00,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 9 [2021-06-11 21:10:00,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565715867] [2021-06-11 21:10:00,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 21:10:00,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:10:00,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 21:10:00,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-11 21:10:00,796 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2021-06-11 21:10:00,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 142 transitions, 2292 flow. Second operand has 10 states, 10 states have (on average 26.4) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:00,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:10:00,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2021-06-11 21:10:00,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:10:02,030 INFO L129 PetriNetUnfolder]: 5437/7570 cut-off events. [2021-06-11 21:10:02,030 INFO L130 PetriNetUnfolder]: For 129188/129624 co-relation queries the response was YES. [2021-06-11 21:10:02,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61876 conditions, 7570 events. 5437/7570 cut-off events. For 129188/129624 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 40778 event pairs, 557 based on Foata normal form. 514/8083 useless extension candidates. Maximal degree in co-relation 61566. Up to 3436 conditions per place. [2021-06-11 21:10:02,093 INFO L132 encePairwiseOnDemand]: 43/52 looper letters, 142 selfloop transitions, 84 changer transitions 208/446 dead transitions. [2021-06-11 21:10:02,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 446 transitions, 7773 flow [2021-06-11 21:10:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-11 21:10:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-06-11 21:10:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 792 transitions. [2021-06-11 21:10:02,099 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6092307692307692 [2021-06-11 21:10:02,099 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 792 transitions. [2021-06-11 21:10:02,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 792 transitions. [2021-06-11 21:10:02,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:10:02,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 792 transitions. [2021-06-11 21:10:02,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 31.68) internal successors, (792), 25 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:02,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 52.0) internal successors, (1352), 26 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:02,104 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 52.0) internal successors, (1352), 26 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:02,104 INFO L185 Difference]: Start difference. First operand has 102 places, 142 transitions, 2292 flow. Second operand 25 states and 792 transitions. [2021-06-11 21:10:02,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 446 transitions, 7773 flow [2021-06-11 21:10:02,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 446 transitions, 7587 flow, removed 38 selfloop flow, removed 4 redundant places. [2021-06-11 21:10:02,235 INFO L241 Difference]: Finished difference. Result has 133 places, 161 transitions, 2810 flow [2021-06-11 21:10:02,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2810, PETRI_PLACES=133, PETRI_TRANSITIONS=161} [2021-06-11 21:10:02,236 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 96 predicate places. [2021-06-11 21:10:02,236 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:10:02,236 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 161 transitions, 2810 flow [2021-06-11 21:10:02,236 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 161 transitions, 2810 flow [2021-06-11 21:10:02,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 161 transitions, 2810 flow [2021-06-11 21:10:02,323 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, Black: 512#(and v_assert (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 120#(= i 0), Black: 514#(and v_assert (<= k i) (<= min (+ max 1)) (< k N)), Black: 122#(<= min (select A 0)), Black: 516#(and v_assert (<= min (+ max 1))), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 406#(<= min (+ max 1)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 506#(and (<= k i) (<= min (+ max 1)) (< k N)), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), Black: 508#(and v_assert (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 19#thread2ENTRYtrue, 32#thread3EXITtrue, Black: 60#(not b1), 69#(not b2), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 349#(and (= j l) (<= N l)), Black: 79#(= min max), 97#true, 353#true, Black: 355#(= i l), Black: 358#(and (<= N l) (= i l)), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 367#(and (<= N l) (= k l)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), 377#true, Black: 215#(and v_assert (<= min max) (< j N) (<= j i) (<= min (select A 0)))]) [2021-06-11 21:10:02,323 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-06-11 21:10:02,323 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:10:02,323 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:02,323 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:10:02,365 INFO L129 PetriNetUnfolder]: 819/1342 cut-off events. [2021-06-11 21:10:02,365 INFO L130 PetriNetUnfolder]: For 40594/41367 co-relation queries the response was YES. [2021-06-11 21:10:02,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13461 conditions, 1342 events. 819/1342 cut-off events. For 40594/41367 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6988 event pairs, 124 based on Foata normal form. 15/1214 useless extension candidates. Maximal degree in co-relation 13398. Up to 731 conditions per place. [2021-06-11 21:10:02,391 INFO L151 LiptonReduction]: Number of co-enabled transitions 1354 [2021-06-11 21:10:02,402 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:10:02,402 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:10:02,402 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 166 [2021-06-11 21:10:02,403 INFO L480 AbstractCegarLoop]: Abstraction has has 113 places, 161 transitions, 2810 flow [2021-06-11 21:10:02,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 26.4) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:02,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:10:02,403 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:10:02,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-11 21:10:02,625 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:10:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:10:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2095183454, now seen corresponding path program 1 times [2021-06-11 21:10:02,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:10:02,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680034543] [2021-06-11 21:10:02,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:10:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:10:02,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,679 INFO L142 QuantifierPusher]: treesize reduction 52, result has 50.0 percent of original size [2021-06-11 21:10:02,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-06-11 21:10:02,702 INFO L142 QuantifierPusher]: treesize reduction 28, result has 73.6 percent of original size [2021-06-11 21:10:02,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-06-11 21:10:02,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 21:10:02,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:10:02,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680034543] [2021-06-11 21:10:02,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308220361] [2021-06-11 21:10:02,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:10:02,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-11 21:10:02,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:10:02,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:02,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:02,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:02,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:02,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:02,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:02,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:02,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:02,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:02,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:02,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:02,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:02,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:02,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:02,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 21:10:02,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 21:10:02,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 21:10:02,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 21:10:02,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-11 21:10:02,907 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.2 percent of original size [2021-06-11 21:10:02,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,914 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 21:10:02,917 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,919 INFO L142 QuantifierPusher]: treesize reduction 5, result has 84.8 percent of original size [2021-06-11 21:10:02,922 INFO L147 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size 5 [2021-06-11 21:10:02,923 INFO L147 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size 5 [2021-06-11 21:10:02,924 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 21:10:02,925 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:02,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:02,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 21:10:02,931 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,931 INFO L142 QuantifierPusher]: treesize reduction 6, result has 64.7 percent of original size [2021-06-11 21:10:02,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:02,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:02,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-11 21:10:02,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-11 21:10:02,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-11 21:10:02,959 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-06-11 21:10:02,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,970 INFO L142 QuantifierPusher]: treesize reduction 23, result has 17.9 percent of original size [2021-06-11 21:10:02,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:02,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:02,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:02,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-06-11 21:10:02,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:02,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:10:02,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:10:02,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-06-11 21:10:02,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018754722] [2021-06-11 21:10:02,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-11 21:10:02,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:10:02,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-11 21:10:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-11 21:10:03,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 52 [2021-06-11 21:10:03,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 161 transitions, 2810 flow. Second operand has 11 states, 11 states have (on average 31.454545454545453) internal successors, (346), 11 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:03,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:10:03,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 52 [2021-06-11 21:10:03,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:10:03,625 INFO L129 PetriNetUnfolder]: 2114/3110 cut-off events. [2021-06-11 21:10:03,625 INFO L130 PetriNetUnfolder]: For 109446/110634 co-relation queries the response was YES. [2021-06-11 21:10:03,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33189 conditions, 3110 events. 2114/3110 cut-off events. For 109446/110634 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 15981 event pairs, 350 based on Foata normal form. 26/3036 useless extension candidates. Maximal degree in co-relation 33113. Up to 1702 conditions per place. [2021-06-11 21:10:03,662 INFO L132 encePairwiseOnDemand]: 43/52 looper letters, 128 selfloop transitions, 54 changer transitions 124/320 dead transitions. [2021-06-11 21:10:03,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 320 transitions, 6667 flow [2021-06-11 21:10:03,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-11 21:10:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-11 21:10:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 463 transitions. [2021-06-11 21:10:03,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6849112426035503 [2021-06-11 21:10:03,664 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 463 transitions. [2021-06-11 21:10:03,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 463 transitions. [2021-06-11 21:10:03,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:10:03,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 463 transitions. [2021-06-11 21:10:03,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 35.61538461538461) internal successors, (463), 13 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:03,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 52.0) internal successors, (728), 14 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:03,666 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 52.0) internal successors, (728), 14 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:03,667 INFO L185 Difference]: Start difference. First operand has 113 places, 161 transitions, 2810 flow. Second operand 13 states and 463 transitions. [2021-06-11 21:10:03,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 320 transitions, 6667 flow [2021-06-11 21:10:03,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 320 transitions, 6007 flow, removed 296 selfloop flow, removed 13 redundant places. [2021-06-11 21:10:03,794 INFO L241 Difference]: Finished difference. Result has 121 places, 160 transitions, 2809 flow [2021-06-11 21:10:03,794 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2543, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2809, PETRI_PLACES=121, PETRI_TRANSITIONS=160} [2021-06-11 21:10:03,794 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2021-06-11 21:10:03,794 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:10:03,794 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 160 transitions, 2809 flow [2021-06-11 21:10:03,795 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 160 transitions, 2809 flow [2021-06-11 21:10:03,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 160 transitions, 2809 flow [2021-06-11 21:10:03,877 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 530#true, 22#L38true, 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 97#true, 353#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 21:10:03,877 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 21:10:03,877 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:10:03,877 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:03,877 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:03,887 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 536#(<= min max), 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 21:10:03,887 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 21:10:03,887 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:10:03,887 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:03,887 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:03,907 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 530#true, 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 69#(not b2), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 21:10:03,907 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 21:10:03,907 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:03,907 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:03,908 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:03,916 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 530#true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), 380#(<= N j), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 21:10:03,916 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:10:03,916 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:03,916 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:03,916 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:03,923 INFO L129 PetriNetUnfolder]: 918/1569 cut-off events. [2021-06-11 21:10:03,923 INFO L130 PetriNetUnfolder]: For 44935/45940 co-relation queries the response was YES. [2021-06-11 21:10:03,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15314 conditions, 1569 events. 918/1569 cut-off events. For 44935/45940 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8820 event pairs, 145 based on Foata normal form. 26/1409 useless extension candidates. Maximal degree in co-relation 15251. Up to 870 conditions per place. [2021-06-11 21:10:03,951 INFO L151 LiptonReduction]: Number of co-enabled transitions 1324 [2021-06-11 21:10:03,965 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:10:03,966 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:10:03,966 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 172 [2021-06-11 21:10:03,966 INFO L480 AbstractCegarLoop]: Abstraction has has 116 places, 160 transitions, 2809 flow [2021-06-11 21:10:03,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 31.454545454545453) internal successors, (346), 11 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:03,967 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:10:03,967 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:10:04,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:04,181 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:10:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:10:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash 233999450, now seen corresponding path program 2 times [2021-06-11 21:10:04,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:10:04,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365488039] [2021-06-11 21:10:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:10:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:10:04,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,204 INFO L142 QuantifierPusher]: treesize reduction 28, result has 45.1 percent of original size [2021-06-11 21:10:04,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 21:10:04,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:04,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:10:04,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365488039] [2021-06-11 21:10:04,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188812432] [2021-06-11 21:10:04,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:04,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-11 21:10:04,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 21:10:04,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-11 21:10:04,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:10:04,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:04,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:04,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:04,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:04,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:04,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:04,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:04,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:04,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:04,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,294 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:04,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 21:10:04,296 INFO L147 QuantifierPusher]: treesize reduction 2, result has 93.1 percent of original size 27 [2021-06-11 21:10:04,296 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.3 percent of original size [2021-06-11 21:10:04,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:04,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 21:10:04,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 21:10:04,299 INFO L142 QuantifierPusher]: treesize reduction 17, result has 41.4 percent of original size [2021-06-11 21:10:04,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:04,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:04,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:04,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:04,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:04,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:04,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:04,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:04,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:04,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:04,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:04,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:04,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:04,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-11 21:10:04,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,311 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-11 21:10:04,312 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,313 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-11 21:10:04,313 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2021-06-11 21:10:04,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,318 INFO L142 QuantifierPusher]: treesize reduction 23, result has 17.9 percent of original size [2021-06-11 21:10:04,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:04,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:04,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:04,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-06-11 21:10:04,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:04,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:10:04,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:10:04,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 21:10:04,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265516725] [2021-06-11 21:10:04,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 21:10:04,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:10:04,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 21:10:04,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 21:10:04,348 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 52 [2021-06-11 21:10:04,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 160 transitions, 2809 flow. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:04,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:10:04,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 52 [2021-06-11 21:10:04,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:10:04,834 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][43], [Black: 227#(and (= i 0) (<= min (select A 0))), 641#(= j 0), 385#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 530#true, 22#L38true, 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 21:10:04,834 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 21:10:04,834 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:04,834 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:04,834 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:04,879 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][221], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 536#(<= min max), 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, 730#(and (<= min max) (= j 0)), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 624#(and v_assert (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 626#(and (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 628#(and v_assert (= (select A 0) (select A i)) (<= min max) (<= (select A i) min)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), Black: 620#(and (<= (select A i) min) (= i 0) (<= (select A 0) max) (<= min (select A 0))), Black: 622#(and v_assert (<= min max))]) [2021-06-11 21:10:04,879 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 21:10:04,879 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:04,880 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-06-11 21:10:04,880 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:10:04,988 INFO L129 PetriNetUnfolder]: 2471/3880 cut-off events. [2021-06-11 21:10:04,988 INFO L130 PetriNetUnfolder]: For 112496/113560 co-relation queries the response was YES. [2021-06-11 21:10:05,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41245 conditions, 3880 events. 2471/3880 cut-off events. For 112496/113560 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 22932 event pairs, 204 based on Foata normal form. 21/3582 useless extension candidates. Maximal degree in co-relation 41157. Up to 2264 conditions per place. [2021-06-11 21:10:05,022 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 110 selfloop transitions, 59 changer transitions 223/407 dead transitions. [2021-06-11 21:10:05,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 407 transitions, 8498 flow [2021-06-11 21:10:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-11 21:10:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-06-11 21:10:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 653 transitions. [2021-06-11 21:10:05,026 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7386877828054299 [2021-06-11 21:10:05,026 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 653 transitions. [2021-06-11 21:10:05,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 653 transitions. [2021-06-11 21:10:05,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:10:05,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 653 transitions. [2021-06-11 21:10:05,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 38.411764705882355) internal successors, (653), 17 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:05,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 52.0) internal successors, (936), 18 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:05,029 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 52.0) internal successors, (936), 18 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:05,029 INFO L185 Difference]: Start difference. First operand has 116 places, 160 transitions, 2809 flow. Second operand 17 states and 653 transitions. [2021-06-11 21:10:05,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 407 transitions, 8498 flow [2021-06-11 21:10:05,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 407 transitions, 7958 flow, removed 228 selfloop flow, removed 8 redundant places. [2021-06-11 21:10:05,142 INFO L241 Difference]: Finished difference. Result has 135 places, 139 transitions, 2559 flow [2021-06-11 21:10:05,142 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2651, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2559, PETRI_PLACES=135, PETRI_TRANSITIONS=139} [2021-06-11 21:10:05,142 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 98 predicate places. [2021-06-11 21:10:05,142 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:10:05,142 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 139 transitions, 2559 flow [2021-06-11 21:10:05,143 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 139 transitions, 2559 flow [2021-06-11 21:10:05,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 139 transitions, 2559 flow [2021-06-11 21:10:05,202 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][66], [Black: 227#(and (= i 0) (<= min (select A 0))), 641#(= j 0), 385#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 19#thread2ENTRYtrue, 32#thread3EXITtrue, Black: 60#(not b1), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 644#(<= min max), 362#true, Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0))]) [2021-06-11 21:10:05,202 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-06-11 21:10:05,202 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:10:05,202 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:10:05,202 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-06-11 21:10:05,276 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][66], [Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, 641#(= j 0), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 69#(not b2), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 644#(<= min max), Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), 362#true, Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0))]) [2021-06-11 21:10:05,276 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 21:10:05,276 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:05,276 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:05,276 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:05,287 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][66], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 355#(= i l), Black: 644#(<= min max), Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), 362#true, Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), 639#true]) [2021-06-11 21:10:05,287 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 21:10:05,287 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:05,287 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:05,287 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:05,300 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][66], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 644#(<= min max), Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), 362#true, Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), 639#true]) [2021-06-11 21:10:05,300 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:10:05,301 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:05,301 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:05,301 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:05,311 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][33], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 40#L86true, Black: 60#(not b1), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), Black: 79#(= min max), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 738#(and v_assert (<= min max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 724#(and (<= min max) (= j 0) (<= (select A 0) max)), Black: 644#(<= min max), Black: 726#(and (<= min max) (= j 0) (<= max (select A 0))), 362#true, Black: 728#(and (<= min max) (<= (select A 0) max)), Black: 730#(and (<= min max) (= j 0)), Black: 732#(and v_assert (<= min max) (<= (select A 0) max)), Black: 734#(and v_assert (<= min max) (= j 0) (<= (select A 0) max)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 618#(and (<= min max) (<= (select A i) min) (= i 0) (= j 0)), 639#true]) [2021-06-11 21:10:05,311 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 21:10:05,311 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:10:05,311 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:10:05,311 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:10:05,321 INFO L129 PetriNetUnfolder]: 1155/1923 cut-off events. [2021-06-11 21:10:05,321 INFO L130 PetriNetUnfolder]: For 68420/69366 co-relation queries the response was YES. [2021-06-11 21:10:05,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19980 conditions, 1923 events. 1155/1923 cut-off events. For 68420/69366 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 11003 event pairs, 237 based on Foata normal form. 28/1693 useless extension candidates. Maximal degree in co-relation 19887. Up to 1075 conditions per place. [2021-06-11 21:10:05,367 INFO L151 LiptonReduction]: Number of co-enabled transitions 1096 [2021-06-11 21:10:05,377 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:10:05,377 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:10:05,377 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 235 [2021-06-11 21:10:05,377 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 139 transitions, 2559 flow [2021-06-11 21:10:05,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:05,378 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:10:05,378 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:10:05,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-11 21:10:05,593 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:10:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:10:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash 782326286, now seen corresponding path program 3 times [2021-06-11 21:10:05,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:10:05,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6460072] [2021-06-11 21:10:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:10:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:10:05,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,613 INFO L142 QuantifierPusher]: treesize reduction 14, result has 56.3 percent of original size [2021-06-11 21:10:05,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 21:10:05,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:05,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-11 21:10:05,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6460072] [2021-06-11 21:10:05,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008344542] [2021-06-11 21:10:05,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:05,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-11 21:10:05,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 21:10:05,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-11 21:10:05,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:10:05,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:05,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:05,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:05,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:05,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:05,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:05,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:05,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:05,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:05,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:05,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:05,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 21:10:05,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:05,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:05,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 21:10:05,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:05,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:05,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 21:10:05,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 21:10:05,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-06-11 21:10:05,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:05,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:05,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-11 21:10:05,721 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:05,722 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-11 21:10:05,722 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2021-06-11 21:10:05,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:05,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:05,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 21:10:05,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:05,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 21:10:05,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:05,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:05,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 21:10:05,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 21:10:05,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-11 21:10:05,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-11 21:10:05,733 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,734 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-11 21:10:05,734 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-06-11 21:10:05,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,744 INFO L142 QuantifierPusher]: treesize reduction 23, result has 23.3 percent of original size [2021-06-11 21:10:05,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:05,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:05,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:05,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:10:05,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:05,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-11 21:10:05,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:10:05,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 21:10:05,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255536716] [2021-06-11 21:10:05,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 21:10:05,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:10:05,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 21:10:05,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-11 21:10:05,774 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 52 [2021-06-11 21:10:05,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 139 transitions, 2559 flow. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:05,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:10:05,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 52 [2021-06-11 21:10:05,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:10:06,414 INFO L129 PetriNetUnfolder]: 3117/4962 cut-off events. [2021-06-11 21:10:06,415 INFO L130 PetriNetUnfolder]: For 161564/162521 co-relation queries the response was YES. [2021-06-11 21:10:06,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53568 conditions, 4962 events. 3117/4962 cut-off events. For 161564/162521 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 31267 event pairs, 390 based on Foata normal form. 33/4605 useless extension candidates. Maximal degree in co-relation 53430. Up to 2731 conditions per place. [2021-06-11 21:10:06,463 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 130 selfloop transitions, 34 changer transitions 150/329 dead transitions. [2021-06-11 21:10:06,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 329 transitions, 7019 flow [2021-06-11 21:10:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 21:10:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 21:10:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 387 transitions. [2021-06-11 21:10:06,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7442307692307693 [2021-06-11 21:10:06,465 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 387 transitions. [2021-06-11 21:10:06,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 387 transitions. [2021-06-11 21:10:06,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:10:06,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 387 transitions. [2021-06-11 21:10:06,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 38.7) internal successors, (387), 10 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:06,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:06,467 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:06,467 INFO L185 Difference]: Start difference. First operand has 122 places, 139 transitions, 2559 flow. Second operand 10 states and 387 transitions. [2021-06-11 21:10:06,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 329 transitions, 7019 flow [2021-06-11 21:10:06,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 329 transitions, 6548 flow, removed 215 selfloop flow, removed 12 redundant places. [2021-06-11 21:10:06,645 INFO L241 Difference]: Finished difference. Result has 125 places, 146 transitions, 2679 flow [2021-06-11 21:10:06,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2374, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2679, PETRI_PLACES=125, PETRI_TRANSITIONS=146} [2021-06-11 21:10:06,645 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 88 predicate places. [2021-06-11 21:10:06,645 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:10:06,646 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 146 transitions, 2679 flow [2021-06-11 21:10:06,646 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 146 transitions, 2679 flow [2021-06-11 21:10:06,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 146 transitions, 2679 flow [2021-06-11 21:10:06,760 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 641#(= j 0), 385#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 756#(<= min (+ max 1)), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max)]) [2021-06-11 21:10:06,761 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-06-11 21:10:06,761 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:10:06,761 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:10:06,761 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 21:10:06,816 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 756#(<= min (+ max 1)), Black: 69#(not b2), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:06,817 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 21:10:06,817 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:06,817 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:06,817 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:06,830 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), Black: 756#(<= min (+ max 1)), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:06,830 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 21:10:06,830 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:06,831 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:06,831 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:06,836 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 756#(<= min (+ max 1)), Black: 69#(not b2), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:06,837 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-06-11 21:10:06,837 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 21:10:06,837 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 21:10:06,837 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 21:10:06,837 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 756#(<= min (+ max 1)), Black: 69#(not b2), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:06,837 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:10:06,837 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:06,837 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:06,837 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:06,837 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:06,853 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][73], [Black: 227#(and (= i 0) (<= min (select A 0))), 643#(<= (select A 0) max), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 832#(and (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 834#(and v_assert (<= (select A 0) (+ max 1)) (<= min (+ max 1))), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), Black: 756#(<= min (+ max 1)), Black: 836#(and v_assert (<= min (+ max 1))), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:06,853 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:06,853 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:06,853 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:06,853 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:06,867 INFO L129 PetriNetUnfolder]: 1559/2556 cut-off events. [2021-06-11 21:10:06,868 INFO L130 PetriNetUnfolder]: For 83759/84973 co-relation queries the response was YES. [2021-06-11 21:10:06,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25785 conditions, 2556 events. 1559/2556 cut-off events. For 83759/84973 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 15061 event pairs, 316 based on Foata normal form. 23/2232 useless extension candidates. Maximal degree in co-relation 25672. Up to 1469 conditions per place. [2021-06-11 21:10:06,919 INFO L151 LiptonReduction]: Number of co-enabled transitions 1174 [2021-06-11 21:10:06,931 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:10:06,931 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:10:06,931 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 286 [2021-06-11 21:10:06,932 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 146 transitions, 2679 flow [2021-06-11 21:10:06,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:06,932 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:10:06,932 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:10:07,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:07,182 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:10:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:10:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash -426316000, now seen corresponding path program 4 times [2021-06-11 21:10:07,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:10:07,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421453438] [2021-06-11 21:10:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:10:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:10:07,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:07,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:10:07,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421453438] [2021-06-11 21:10:07,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329423153] [2021-06-11 21:10:07,220 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:07,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-11 21:10:07,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 21:10:07,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-11 21:10:07,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:10:07,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:07,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:07,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:07,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:10:07,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:07,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,287 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:07,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:07,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:10:07,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,290 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:07,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:07,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:10:07,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:07,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:07,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:10:07,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,299 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:07,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:07,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:10:07,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:07,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:07,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:07,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:07,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:07,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:07,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:07,327 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-06-11 21:10:07,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:07,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:10:07,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:10:07,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 21:10:07,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485713021] [2021-06-11 21:10:07,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 21:10:07,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:10:07,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 21:10:07,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-11 21:10:07,344 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:10:07,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 146 transitions, 2679 flow. Second operand has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:07,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:10:07,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:10:07,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:10:09,628 INFO L129 PetriNetUnfolder]: 12993/18794 cut-off events. [2021-06-11 21:10:09,628 INFO L130 PetriNetUnfolder]: For 518967/519226 co-relation queries the response was YES. [2021-06-11 21:10:09,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176053 conditions, 18794 events. 12993/18794 cut-off events. For 518967/519226 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 119176 event pairs, 3038 based on Foata normal form. 1520/20074 useless extension candidates. Maximal degree in co-relation 175840. Up to 8197 conditions per place. [2021-06-11 21:10:09,885 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 213 selfloop transitions, 114 changer transitions 0/351 dead transitions. [2021-06-11 21:10:09,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 351 transitions, 7168 flow [2021-06-11 21:10:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 21:10:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 21:10:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 271 transitions. [2021-06-11 21:10:09,886 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7445054945054945 [2021-06-11 21:10:09,886 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 271 transitions. [2021-06-11 21:10:09,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 271 transitions. [2021-06-11 21:10:09,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:10:09,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 271 transitions. [2021-06-11 21:10:09,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:09,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 52.0) internal successors, (416), 8 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:09,888 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 52.0) internal successors, (416), 8 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:09,888 INFO L185 Difference]: Start difference. First operand has 121 places, 146 transitions, 2679 flow. Second operand 7 states and 271 transitions. [2021-06-11 21:10:09,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 351 transitions, 7168 flow [2021-06-11 21:10:10,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 351 transitions, 7000 flow, removed 84 selfloop flow, removed 4 redundant places. [2021-06-11 21:10:10,567 INFO L241 Difference]: Finished difference. Result has 127 places, 247 transitions, 5242 flow [2021-06-11 21:10:10,567 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5242, PETRI_PLACES=127, PETRI_TRANSITIONS=247} [2021-06-11 21:10:10,567 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 90 predicate places. [2021-06-11 21:10:10,567 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:10:10,567 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 247 transitions, 5242 flow [2021-06-11 21:10:10,568 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 247 transitions, 5242 flow [2021-06-11 21:10:10,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 247 transitions, 5242 flow [2021-06-11 21:10:11,654 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][185], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:11,654 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:10:11,654 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:11,654 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:11,654 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:11,763 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][158], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:11,763 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 21:10:11,763 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 21:10:11,763 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:10:11,763 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 21:10:11,764 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][149], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:11,764 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:11,764 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:11,764 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:11,764 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:11,794 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][185], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:11,794 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:11,794 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:11,794 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:11,794 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:11,814 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][158], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:11,814 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-06-11 21:10:11,814 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 21:10:11,814 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:10:11,814 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:10:12,050 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][80], [Black: 227#(and (= i 0) (<= min (select A 0))), 4#thread5EXITtrue, 388#(<= N j), Black: 120#(= i 0), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), 38#thread4EXITtrue, Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 365#(<= N l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:12,064 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 21:10:12,065 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:12,065 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:12,065 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:12,078 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][152], [Black: 227#(and (= i 0) (<= min (select A 0))), 388#(<= N j), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 40#L86true, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:12,078 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-06-11 21:10:12,078 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 21:10:12,078 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 21:10:12,078 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 21:10:12,106 INFO L129 PetriNetUnfolder]: 5379/9314 cut-off events. [2021-06-11 21:10:12,106 INFO L130 PetriNetUnfolder]: For 270749/273258 co-relation queries the response was YES. [2021-06-11 21:10:12,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91804 conditions, 9314 events. 5379/9314 cut-off events. For 270749/273258 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 73876 event pairs, 1204 based on Foata normal form. 150/8564 useless extension candidates. Maximal degree in co-relation 90622. Up to 4877 conditions per place. [2021-06-11 21:10:12,298 INFO L151 LiptonReduction]: Number of co-enabled transitions 2180 [2021-06-11 21:10:12,339 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:10:12,339 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:10:12,339 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1772 [2021-06-11 21:10:12,339 INFO L480 AbstractCegarLoop]: Abstraction has has 127 places, 247 transitions, 5242 flow [2021-06-11 21:10:12,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:12,340 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:10:12,340 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:10:12,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:12,553 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:10:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:10:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1121631106, now seen corresponding path program 5 times [2021-06-11 21:10:12,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:10:12,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770135916] [2021-06-11 21:10:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:10:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:10:12,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:12,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:10:12,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770135916] [2021-06-11 21:10:12,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004713660] [2021-06-11 21:10:12,597 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:12,647 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-11 21:10:12,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 21:10:12,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-11 21:10:12,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:10:12,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,664 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:12,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:12,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:10:12,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:12,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:12,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:10:12,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,680 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-06-11 21:10:12,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:12,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:12,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:12,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:10:12,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:12,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:12,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:12,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:12,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:12,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:12,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:12,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:12,699 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-06-11 21:10:12,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:12,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:10:12,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:10:12,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 21:10:12,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670633429] [2021-06-11 21:10:12,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 21:10:12,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:10:12,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 21:10:12,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 21:10:12,799 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:10:12,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 247 transitions, 5242 flow. Second operand has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:12,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:10:12,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:10:12,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:10:20,694 INFO L129 PetriNetUnfolder]: 27891/41691 cut-off events. [2021-06-11 21:10:20,694 INFO L130 PetriNetUnfolder]: For 1260324/1260913 co-relation queries the response was YES. [2021-06-11 21:10:21,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392819 conditions, 41691 events. 27891/41691 cut-off events. For 1260324/1260913 co-relation queries the response was YES. Maximal size of possible extension queue 2608. Compared 314078 event pairs, 2422 based on Foata normal form. 604/42178 useless extension candidates. Maximal degree in co-relation 388985. Up to 16683 conditions per place. [2021-06-11 21:10:21,244 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 543 selfloop transitions, 153 changer transitions 13/733 dead transitions. [2021-06-11 21:10:21,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 733 transitions, 17815 flow [2021-06-11 21:10:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 21:10:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 21:10:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 345 transitions. [2021-06-11 21:10:21,246 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2021-06-11 21:10:21,246 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 345 transitions. [2021-06-11 21:10:21,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 345 transitions. [2021-06-11 21:10:21,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:10:21,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 345 transitions. [2021-06-11 21:10:21,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 38.333333333333336) internal successors, (345), 9 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:21,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:21,247 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:21,247 INFO L185 Difference]: Start difference. First operand has 127 places, 247 transitions, 5242 flow. Second operand 9 states and 345 transitions. [2021-06-11 21:10:21,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 733 transitions, 17815 flow [2021-06-11 21:10:22,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 733 transitions, 17044 flow, removed 378 selfloop flow, removed 1 redundant places. [2021-06-11 21:10:22,583 INFO L241 Difference]: Finished difference. Result has 138 places, 380 transitions, 8938 flow [2021-06-11 21:10:22,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=5055, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8938, PETRI_PLACES=138, PETRI_TRANSITIONS=380} [2021-06-11 21:10:22,583 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 101 predicate places. [2021-06-11 21:10:22,583 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:10:22,583 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 380 transitions, 8938 flow [2021-06-11 21:10:22,583 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 380 transitions, 8938 flow [2021-06-11 21:10:22,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 380 transitions, 8938 flow [2021-06-11 21:10:24,587 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:24,588 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 21:10:24,588 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:24,588 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:24,588 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:25,278 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][24], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:25,278 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:10:25,278 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:25,278 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:25,279 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:25,359 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:25,360 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 21:10:25,360 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:10:25,360 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:10:25,360 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:10:25,360 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:25,360 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,360 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:25,360 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:25,360 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:25,360 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:25,375 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 643#(<= (select A 0) max), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j)]) [2021-06-11 21:10:25,375 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,375 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,375 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,376 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:25,514 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:25,514 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,514 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,514 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,515 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,545 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][33], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:25,545 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,545 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,545 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,545 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:25,708 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:25,708 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,708 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,708 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,708 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,723 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:25,723 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,723 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,723 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,723 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,726 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][33], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j)]) [2021-06-11 21:10:25,726 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,726 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,726 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,726 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:25,782 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][64], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j)]) [2021-06-11 21:10:25,782 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 21:10:25,782 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:10:25,782 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:10:25,782 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:26,234 INFO L129 PetriNetUnfolder]: 13931/24425 cut-off events. [2021-06-11 21:10:26,234 INFO L130 PetriNetUnfolder]: For 834302/844972 co-relation queries the response was YES. [2021-06-11 21:10:26,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235440 conditions, 24425 events. 13931/24425 cut-off events. For 834302/844972 co-relation queries the response was YES. Maximal size of possible extension queue 2227. Compared 223085 event pairs, 2652 based on Foata normal form. 504/22826 useless extension candidates. Maximal degree in co-relation 232027. Up to 12314 conditions per place. [2021-06-11 21:10:26,786 INFO L151 LiptonReduction]: Number of co-enabled transitions 3630 [2021-06-11 21:10:26,970 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:10:26,970 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:10:26,971 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4387 [2021-06-11 21:10:26,971 INFO L480 AbstractCegarLoop]: Abstraction has has 138 places, 380 transitions, 8938 flow [2021-06-11 21:10:26,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:26,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:10:26,971 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:10:27,172 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-11 21:10:27,173 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:10:27,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:10:27,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1346243092, now seen corresponding path program 6 times [2021-06-11 21:10:27,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:10:27,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965234971] [2021-06-11 21:10:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:10:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:10:27,189 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-06-11 21:10:27,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:27,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:10:27,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965234971] [2021-06-11 21:10:27,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131074026] [2021-06-11 21:10:27,207 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:10:27,243 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-11 21:10:27,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 21:10:27,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-11 21:10:27,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:10:27,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:27,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:27,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:10:27,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:27,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:10:27,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:10:27,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:10:27,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:27,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:27,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:27,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:27,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:10:27,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:10:27,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:27,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:27,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:10:27,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,284 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:10:27,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:10:27,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:10:27,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:10:27,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:10:27,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:10:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 21:10:27,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:10:27,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-06-11 21:10:27,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078864766] [2021-06-11 21:10:27,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 21:10:27,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:10:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 21:10:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-11 21:10:27,318 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 52 [2021-06-11 21:10:27,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 380 transitions, 8938 flow. Second operand has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:27,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:10:27,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 52 [2021-06-11 21:10:27,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:10:41,501 INFO L129 PetriNetUnfolder]: 48796/72465 cut-off events. [2021-06-11 21:10:41,501 INFO L130 PetriNetUnfolder]: For 2278609/2280246 co-relation queries the response was YES. [2021-06-11 21:10:42,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 718065 conditions, 72465 events. 48796/72465 cut-off events. For 2278609/2280246 co-relation queries the response was YES. Maximal size of possible extension queue 4726. Compared 574526 event pairs, 4461 based on Foata normal form. 2533/74758 useless extension candidates. Maximal degree in co-relation 712453. Up to 28434 conditions per place. [2021-06-11 21:10:42,623 INFO L132 encePairwiseOnDemand]: 45/52 looper letters, 590 selfloop transitions, 635 changer transitions 9/1258 dead transitions. [2021-06-11 21:10:42,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1258 transitions, 30060 flow [2021-06-11 21:10:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-11 21:10:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-06-11 21:10:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 990 transitions. [2021-06-11 21:10:42,625 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7322485207100592 [2021-06-11 21:10:42,625 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 990 transitions. [2021-06-11 21:10:42,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 990 transitions. [2021-06-11 21:10:42,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:10:42,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 990 transitions. [2021-06-11 21:10:42,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 38.07692307692308) internal successors, (990), 26 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:42,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 52.0) internal successors, (1404), 27 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:42,629 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 52.0) internal successors, (1404), 27 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:10:42,629 INFO L185 Difference]: Start difference. First operand has 138 places, 380 transitions, 8938 flow. Second operand 26 states and 990 transitions. [2021-06-11 21:10:42,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1258 transitions, 30060 flow [2021-06-11 21:10:49,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 1258 transitions, 29738 flow, removed 147 selfloop flow, removed 1 redundant places. [2021-06-11 21:10:49,258 INFO L241 Difference]: Finished difference. Result has 178 places, 917 transitions, 24200 flow [2021-06-11 21:10:49,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=8796, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=24200, PETRI_PLACES=178, PETRI_TRANSITIONS=917} [2021-06-11 21:10:49,259 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 141 predicate places. [2021-06-11 21:10:49,259 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:10:49,259 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 917 transitions, 24200 flow [2021-06-11 21:10:49,259 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 917 transitions, 24200 flow [2021-06-11 21:10:49,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 917 transitions, 24200 flow [2021-06-11 21:10:52,435 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][787], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), 385#true, 641#(= j 0), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), 844#true, 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:52,435 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 21:10:52,435 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:10:52,435 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 21:10:52,435 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 21:10:55,320 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1141#(and (<= N l) (<= k l)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:55,320 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:10:55,320 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:55,320 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:55,320 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:10:56,154 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][787], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), 641#(= j 0), 385#true, Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:56,155 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:10:56,155 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:56,155 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:56,155 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:56,678 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][143], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:56,678 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 21:10:56,678 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:10:56,678 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:10:56,678 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:10:56,683 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:56,683 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:56,683 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:56,683 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:56,683 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:10:56,776 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][166], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), 8#L51-1true, Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:56,776 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:56,776 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:56,776 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:56,776 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:56,777 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), 8#L51-1true, Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:56,778 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:10:56,778 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:56,778 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:56,778 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:10:57,619 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][787], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:57,619 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,619 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,619 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,619 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,636 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][787], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 643#(<= (select A 0) max), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:57,636 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,636 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,636 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,636 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,761 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][166], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), 4#thread5EXITtrue, 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:57,761 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,761 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,761 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,761 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,766 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][166], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:57,766 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,766 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,766 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,766 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,768 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][166], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:57,768 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,768 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,768 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,768 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,769 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:57,769 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,769 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,769 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,769 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,770 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:57,770 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,770 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,770 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:57,770 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:10:58,031 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][601], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:58,032 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 21:10:58,032 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:10:58,032 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:10:58,032 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:10:58,464 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][607], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), 38#thread4EXITtrue, Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 40#L86true, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), 365#(<= N l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), 1141#(and (<= N l) (<= k l)), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:10:58,464 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-06-11 21:10:58,464 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 21:10:58,464 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-06-11 21:10:58,464 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-06-11 21:10:58,563 INFO L129 PetriNetUnfolder]: 25442/44149 cut-off events. [2021-06-11 21:10:58,563 INFO L130 PetriNetUnfolder]: For 1763964/1784546 co-relation queries the response was YES. [2021-06-11 21:10:59,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 460944 conditions, 44149 events. 25442/44149 cut-off events. For 1763964/1784546 co-relation queries the response was YES. Maximal size of possible extension queue 3951. Compared 429352 event pairs, 4856 based on Foata normal form. 1129/41911 useless extension candidates. Maximal degree in co-relation 454797. Up to 21725 conditions per place. [2021-06-11 21:11:00,377 INFO L151 LiptonReduction]: Number of co-enabled transitions 8518 [2021-06-11 21:11:00,570 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:11:00,570 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:11:00,571 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11312 [2021-06-11 21:11:00,571 INFO L480 AbstractCegarLoop]: Abstraction has has 178 places, 917 transitions, 24200 flow [2021-06-11 21:11:00,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:11:00,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:11:00,571 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:11:00,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:11:00,772 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:11:00,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:11:00,772 INFO L82 PathProgramCache]: Analyzing trace with hash -869186482, now seen corresponding path program 7 times [2021-06-11 21:11:00,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:11:00,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315770041] [2021-06-11 21:11:00,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:11:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:11:00,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:11:00,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:11:00,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315770041] [2021-06-11 21:11:00,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734322277] [2021-06-11 21:11:00,815 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:11:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:11:00,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-11 21:11:00,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:11:00,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:11:00,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:00,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:11:00,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:11:00,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:00,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:11:00,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:11:00,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:00,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:11:00,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:11:00,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,900 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-06-11 21:11:00,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:11:00,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:00,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:11:00,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:11:00,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:00,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:00,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:11:00,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:11:00,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:00,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:11:00,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:11:00,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:00,911 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-06-11 21:11:00,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:00,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:11:00,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:11:00,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-11 21:11:00,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774559676] [2021-06-11 21:11:00,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 21:11:00,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:11:00,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 21:11:00,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 21:11:00,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-06-11 21:11:00,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 917 transitions, 24200 flow. Second operand has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:11:00,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:11:00,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-06-11 21:11:00,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:11:21,872 INFO L129 PetriNetUnfolder]: 46714/69489 cut-off events. [2021-06-11 21:11:21,872 INFO L130 PetriNetUnfolder]: For 2666916/2669128 co-relation queries the response was YES. [2021-06-11 21:11:22,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751418 conditions, 69489 events. 46714/69489 cut-off events. For 2666916/2669128 co-relation queries the response was YES. Maximal size of possible extension queue 4681. Compared 550523 event pairs, 5508 based on Foata normal form. 1834/71114 useless extension candidates. Maximal degree in co-relation 746087. Up to 26985 conditions per place. [2021-06-11 21:11:23,138 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 599 selfloop transitions, 625 changer transitions 13/1261 dead transitions. [2021-06-11 21:11:23,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1261 transitions, 35097 flow [2021-06-11 21:11:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 21:11:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 21:11:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 345 transitions. [2021-06-11 21:11:23,139 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2021-06-11 21:11:23,139 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 345 transitions. [2021-06-11 21:11:23,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 345 transitions. [2021-06-11 21:11:23,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:11:23,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 345 transitions. [2021-06-11 21:11:23,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 38.333333333333336) internal successors, (345), 9 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:11:23,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:11:23,141 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:11:23,141 INFO L185 Difference]: Start difference. First operand has 178 places, 917 transitions, 24200 flow. Second operand 9 states and 345 transitions. [2021-06-11 21:11:23,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1261 transitions, 35097 flow [2021-06-11 21:11:39,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 1261 transitions, 33753 flow, removed 667 selfloop flow, removed 1 redundant places. [2021-06-11 21:11:39,164 INFO L241 Difference]: Finished difference. Result has 189 places, 1097 transitions, 30644 flow [2021-06-11 21:11:39,164 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=23144, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=917, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=463, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=30644, PETRI_PLACES=189, PETRI_TRANSITIONS=1097} [2021-06-11 21:11:39,164 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 152 predicate places. [2021-06-11 21:11:39,164 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:11:39,164 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 1097 transitions, 30644 flow [2021-06-11 21:11:39,165 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 1097 transitions, 30644 flow [2021-06-11 21:11:39,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 189 places, 1097 transitions, 30644 flow [2021-06-11 21:11:42,609 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), 641#(= j 0), 385#true, Black: 1033#(<= k l), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, 400#true, Black: 494#(and (<= k i) (< k N)), 22#L38true, 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), 844#true, 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:42,609 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 21:11:42,609 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 21:11:42,609 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 21:11:42,609 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:11:44,851 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), 1030#true, Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), 8#L51-1true, Black: 387#(= k j), Black: 405#(<= min (+ (select A 0) 1)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 14#L62-1true, Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:44,851 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 21:11:44,851 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:11:44,851 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:11:44,851 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:11:46,402 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, 641#(= j 0), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, 400#true, Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 207#(and (< j N) (<= j i)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:46,402 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:11:46,402 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:46,402 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:46,402 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:46,953 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][856], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), 4#thread5EXITtrue, Black: 1034#(<= k (+ l 1)), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:46,953 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 21:11:46,953 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:11:46,953 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:11:46,953 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:11:46,955 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, 1167#true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:46,955 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:11:46,955 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:46,955 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:46,955 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:46,960 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:46,960 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 21:11:46,960 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:11:46,960 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:11:46,960 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:11:46,960 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 10#L82true, Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 1167#true, 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:46,961 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:11:46,961 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:46,961 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:46,961 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:46,961 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:47,418 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][898], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), 8#L51-1true, Black: 387#(= k j), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 1176#(<= k l), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:47,419 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:11:47,419 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:47,419 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:47,419 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:47,448 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][333], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:47,448 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:11:47,448 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:47,448 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:47,448 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:47,979 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][78], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), 38#thread4EXITtrue, Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 365#(<= N l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), 1139#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 122#(<= min (select A 0)), Black: 536#(<= min max), 380#(<= N j), 1022#(and (<= N l) (<= i l)), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:47,979 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 21:11:47,979 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:47,979 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:47,979 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:48,017 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), 1167#true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,017 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,017 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,018 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,018 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,023 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][319], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,024 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,024 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,024 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,024 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,070 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][856], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,070 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,070 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,070 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,070 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,074 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][333], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), 4#thread5EXITtrue, Black: 1034#(<= k (+ l 1)), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,074 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-06-11 21:11:48,074 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 21:11:48,075 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 21:11:48,075 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 21:11:48,078 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,078 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,078 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,078 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,078 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,079 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][892], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), 1030#true, Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), 1167#true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,079 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,079 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,079 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,079 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,080 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][319], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,080 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,080 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,081 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,081 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,084 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][319], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,085 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,085 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,085 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,085 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,094 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,094 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,094 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,094 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,094 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:48,195 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][78], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), 388#(<= N j), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 120#(= i 0), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), 38#thread4EXITtrue, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 365#(<= N l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 1139#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), 1022#(and (<= N l) (<= i l)), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,195 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 21:11:48,195 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:11:48,195 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,195 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:11:48,381 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][333], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1252#(and (<= N l) (<= k l)), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,381 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 21:11:48,381 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:11:48,381 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:11:48,381 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:11:48,397 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, 388#(<= N j), Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 122#(<= min (select A 0)), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,397 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 21:11:48,397 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:11:48,397 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:11:48,398 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:11:48,403 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), 1033#(<= k l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,403 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 21:11:48,403 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:11:48,403 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:11:48,403 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:11:48,563 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][830], [Black: 1125#(and (<= k l) (<= i l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1135#(and (<= k (+ l 1)) (<= i l)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), 11#thread2EXITtrue, Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 14#L62-1true, Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), 400#true, Black: 494#(and (<= k i) (< k N)), 536#(<= min max), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 32#thread3EXITtrue, 34#L83true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), 362#true, Black: 1176#(<= k l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,563 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 21:11:48,563 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 21:11:48,564 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:11:48,564 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 21:11:48,695 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][716], [Black: 1125#(and (<= k l) (<= i l)), 1024#(and (<= i (+ l 1)) (<= N l)), Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1034#(<= k (+ l 1)), 388#(<= N j), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 122#(<= min (select A 0)), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1141#(and (<= N l) (<= k l)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), 38#thread4EXITtrue, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 40#L86true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1176#(<= k l), 365#(<= N l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), Black: 364#(= k l), 1137#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,695 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-06-11 21:11:48,695 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 21:11:48,695 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 21:11:48,695 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 21:11:48,713 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][716], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 4#thread5EXITtrue, 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1022#(and (<= N l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 397#(<= (+ l 1) N), 400#true, Black: 494#(and (<= k i) (< k N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), 38#thread4EXITtrue, Black: 853#(<= k l), 40#L86true, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 355#(= i l), Black: 1172#(<= N l), Black: 1176#(<= k l), 365#(<= N l), 751#true, Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), 1141#(and (<= N l) (<= k l)), Black: 207#(and (< j N) (<= j i)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,713 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-06-11 21:11:48,713 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-06-11 21:11:48,713 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2021-06-11 21:11:48,713 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 21:11:48,741 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][716], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 1125#(and (<= k l) (<= i l)), 1024#(and (<= i (+ l 1)) (<= N l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 946#(<= i l), Black: 1033#(<= k l), Black: 940#(<= i (+ l 1)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 388#(<= N j), Black: 1034#(<= k (+ l 1)), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 120#(= i 0), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 191#(and (= i 0) (<= j i)), Black: 1141#(and (<= N l) (<= k l)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 1145#(and (<= N l) (<= i l)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 405#(<= min (+ (select A 0) 1)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), 38#thread4EXITtrue, 40#L86true, Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), 356#(<= N l), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 355#(= i l), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 365#(<= N l), Black: 99#(= min (select A 0)), 751#true, Black: 100#(= min max), 1137#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 364#(= k l), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 103#(and (= min (select A 0)) (= min max)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 122#(<= min (select A 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l))]) [2021-06-11 21:11:48,741 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2021-06-11 21:11:48,741 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 21:11:48,742 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 21:11:48,742 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 21:11:48,804 INFO L129 PetriNetUnfolder]: 23928/41928 cut-off events. [2021-06-11 21:11:48,804 INFO L130 PetriNetUnfolder]: For 1725831/1746657 co-relation queries the response was YES. [2021-06-11 21:11:49,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 438621 conditions, 41928 events. 23928/41928 cut-off events. For 1725831/1746657 co-relation queries the response was YES. Maximal size of possible extension queue 3912. Compared 411989 event pairs, 4063 based on Foata normal form. 1289/40416 useless extension candidates. Maximal degree in co-relation 432673. Up to 20089 conditions per place. [2021-06-11 21:11:50,442 INFO L151 LiptonReduction]: Number of co-enabled transitions 10100 [2021-06-11 21:11:50,852 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:11:50,852 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:11:50,852 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11688 [2021-06-11 21:11:50,853 INFO L480 AbstractCegarLoop]: Abstraction has has 189 places, 1097 transitions, 30644 flow [2021-06-11 21:11:50,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:11:50,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:11:50,853 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:11:51,053 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:11:51,054 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:11:51,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:11:51,054 INFO L82 PathProgramCache]: Analyzing trace with hash 806926026, now seen corresponding path program 8 times [2021-06-11 21:11:51,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:11:51,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844791574] [2021-06-11 21:11:51,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:11:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:11:51,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:11:51,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 21:11:51,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844791574] [2021-06-11 21:11:51,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819136324] [2021-06-11 21:11:51,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:11:51,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-11 21:11:51,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 21:11:51,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-11 21:11:51,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:11:51,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:51,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:11:51,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:11:51,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:51,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:11:51,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:11:51,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:51,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:11:51,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:11:51,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,198 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:51,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:11:51,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:11:51,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:11:51,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,235 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:51,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:11:51,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:11:51,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:11:51,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:11:51,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:11:51,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:11:51,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:11:51,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:11:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 21:11:51,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:11:51,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-06-11 21:11:51,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565134190] [2021-06-11 21:11:51,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 21:11:51,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:11:51,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 21:11:51,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-11 21:11:51,261 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 52 [2021-06-11 21:11:51,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1097 transitions, 30644 flow. Second operand has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:11:51,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:11:51,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 52 [2021-06-11 21:11:51,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:12:44,479 INFO L129 PetriNetUnfolder]: 92987/138534 cut-off events. [2021-06-11 21:12:44,479 INFO L130 PetriNetUnfolder]: For 5984505/5987396 co-relation queries the response was YES. [2021-06-11 21:12:46,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1578295 conditions, 138534 events. 92987/138534 cut-off events. For 5984505/5987396 co-relation queries the response was YES. Maximal size of possible extension queue 9512. Compared 1189071 event pairs, 10549 based on Foata normal form. 18574/156467 useless extension candidates. Maximal degree in co-relation 1569030. Up to 59112 conditions per place. [2021-06-11 21:12:47,621 INFO L132 encePairwiseOnDemand]: 45/52 looper letters, 2846 selfloop transitions, 838 changer transitions 59/3767 dead transitions. [2021-06-11 21:12:47,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 3767 transitions, 111636 flow [2021-06-11 21:12:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-11 21:12:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-06-11 21:12:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 873 transitions. [2021-06-11 21:12:47,622 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.729933110367893 [2021-06-11 21:12:47,622 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 873 transitions. [2021-06-11 21:12:47,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 873 transitions. [2021-06-11 21:12:47,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:12:47,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 873 transitions. [2021-06-11 21:12:47,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 37.95652173913044) internal successors, (873), 23 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:12:47,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 52.0) internal successors, (1248), 24 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:12:47,625 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 52.0) internal successors, (1248), 24 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:12:47,625 INFO L185 Difference]: Start difference. First operand has 189 places, 1097 transitions, 30644 flow. Second operand 23 states and 873 transitions. [2021-06-11 21:12:47,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 3767 transitions, 111636 flow [2021-06-11 21:14:11,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 3767 transitions, 109389 flow, removed 1117 selfloop flow, removed 1 redundant places. [2021-06-11 21:14:11,323 INFO L241 Difference]: Finished difference. Result has 227 places, 1751 transitions, 50712 flow [2021-06-11 21:14:11,324 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=28552, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=50712, PETRI_PLACES=227, PETRI_TRANSITIONS=1751} [2021-06-11 21:14:11,324 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 190 predicate places. [2021-06-11 21:14:11,324 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 21:14:11,324 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 1751 transitions, 50712 flow [2021-06-11 21:14:11,324 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 1751 transitions, 50712 flow [2021-06-11 21:14:11,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 1751 transitions, 50712 flow [2021-06-11 21:14:15,441 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][148], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 46#L25true, Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, 1121#(and (< i N) (<= i l)), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), 374#(<= (+ i 1) N), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), 120#(= i 0), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 946#(<= i l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:15,441 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-06-11 21:14:15,441 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:14:15,441 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-06-11 21:14:15,441 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-06-11 21:14:15,779 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][379], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 38#thread4EXITtrue, 46#L25true, Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 1133#(and (<= N l) (< i N)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), 374#(<= (+ i 1) N), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), 120#(= i 0), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1172#(<= N l), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1022#(and (<= N l) (<= i l))]) [2021-06-11 21:14:15,779 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2021-06-11 21:14:15,779 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-06-11 21:14:15,779 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 21:14:15,779 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-06-11 21:14:18,445 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][77], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 1121#(and (< i N) (<= i l)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), 374#(<= (+ i 1) N), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), 120#(= i 0), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 946#(<= i l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:18,445 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-06-11 21:14:18,445 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:14:18,445 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:14:18,445 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:22,070 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:22,070 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 21:14:22,070 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:14:22,070 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:22,070 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-06-11 21:14:27,672 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([142] L62-1-->thread4EXIT: Formula: (not (< v_l_15 v_N_23)) InVars {N=v_N_23, l=v_l_15} OutVars{N=v_N_23, l=v_l_15} AuxVars[] AssignedVars[][1228], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, 11#thread2EXITtrue, 1035#(<= N l), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 38#thread4EXITtrue, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1172#(<= N l), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:27,673 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 21:14:27,673 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:27,673 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:27,673 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:27,673 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:27,673 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 21:14:27,673 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:27,673 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:27,673 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:27,937 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1590], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1176#(<= k l), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:27,938 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:14:27,938 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:27,938 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:27,938 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:28,330 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][77], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 14#L62-1true, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 1052#(<= i (+ l 1)), 32#thread3EXITtrue, 34#L83true, 44#L27-1true, Black: 60#(not b1), 1348#(and (< i N) (<= i l)), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 122#(<= min (select A 0)), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 940#(<= i (+ l 1)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:28,331 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-06-11 21:14:28,331 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 21:14:28,331 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 21:14:28,331 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:14:28,363 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][77], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:28,363 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:14:28,363 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:28,363 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:28,363 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:28,390 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:28,390 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-06-11 21:14:28,390 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 21:14:28,390 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:14:28,390 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 21:14:28,390 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:28,390 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:14:28,390 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:28,390 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:28,390 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:28,391 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 1167#true, Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:28,391 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:14:28,391 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:28,391 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 21:14:28,391 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:28,391 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,527 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1563], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:32,527 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,527 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,527 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,527 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,656 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, 1364#(and (<= (+ j 2) N) (<= (+ j 1) l)), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 641#(= j 0), 385#true, Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, 207#(and (< j N) (<= j i)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0)))]) [2021-06-11 21:14:32,656 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,656 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,656 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,656 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,700 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:32,700 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:14:32,700 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,700 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:32,700 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:34,048 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][281], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 10#L82true, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:34,048 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:14:34,048 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:34,049 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:34,049 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:34,446 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 1167#true, Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:34,446 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:14:34,446 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:34,446 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:34,446 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:34,446 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:36,777 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 10#L82true, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:36,777 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:14:36,777 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:36,777 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 21:14:36,777 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,262 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:37,262 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,263 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,263 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,263 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:37,407 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1590], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1176#(<= k l), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:37,407 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,407 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,407 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,407 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,706 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 8#L51-1true, Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:37,706 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,706 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,706 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,706 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,724 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1128], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 1176#(<= k l), 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:37,724 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,724 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,725 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:37,725 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:38,657 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][732], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 1167#true, 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:38,657 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:14:38,657 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:38,657 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:38,657 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:38,658 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 21:14:39,225 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][281], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:39,225 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:14:39,225 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:39,225 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:39,225 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:40,765 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([141] thread5ENTRY-->thread5EXIT: Formula: (let ((.cse0 (<= v_min_17 (+ v_max_20 1)))) (or (and (or (not v_b2_9) (not v_b1_8) .cse0) v_v_assert_10) (and (not v_v_assert_10) (not .cse0) v_b2_9 v_b1_8))) InVars {b2=v_b2_9, b1=v_b1_8, min=v_min_17, max=v_max_20} OutVars{b2=v_b2_9, b1=v_b1_8, v_assert=v_v_assert_10, min=v_min_17, max=v_max_20} AuxVars[] AssignedVars[v_assert][77], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, 44#L27-1true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1022#(and (<= N l) (<= i l))]) [2021-06-11 21:14:40,765 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:14:40,765 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:40,765 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:40,765 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:41,694 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1541], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:41,694 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:14:41,694 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:41,694 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:41,694 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,104 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), 8#L51-1true, Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:42,104 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,104 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,104 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,104 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,106 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1541], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:42,106 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,106 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,106 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,106 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,205 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][281], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), 385#true, Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:42,205 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,205 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,205 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,205 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,211 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1541], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:42,211 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,212 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,212 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:42,212 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 21:14:43,052 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][281], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), 1033#(<= k l), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 21#L40-1true, 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 353#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), 377#true, Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), 385#true, Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:43,053 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 21:14:43,053 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:14:43,053 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:14:43,053 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 21:14:43,056 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 844#true, 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), 365#(<= N l), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:43,056 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 21:14:43,056 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:43,056 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:43,056 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,245 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), 755#(<= (select A 0) (+ max 1)), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:44,245 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,245 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,245 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,245 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,446 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 1147#(and (<= N l) (<= k (+ l 1))), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 643#(<= (select A 0) max), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:44,446 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,446 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,446 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,446 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,446 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([139] L40-1-->thread2EXIT: Formula: (not (< v_j_15 v_N_19)) InVars {N=v_N_19, j=v_j_15} OutVars{N=v_N_19, j=v_j_15} AuxVars[] AssignedVars[][1495], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), 4#thread5EXITtrue, Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, 38#thread4EXITtrue, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 347#(<= N l), Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 532#(and (= i 0) (= j 0)), Black: 374#(<= (+ i 1) N), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), 1147#(and (<= N l) (<= k (+ l 1))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), 643#(<= (select A 0) max), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 942#(<= N l), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), 1254#(and (<= N l) (<= k (+ l 1))), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:44,446 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,447 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,447 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:44,447 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:45,137 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][587], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1022#(and (<= N l) (<= i l)), 1030#true, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 33#thread5ENTRYtrue, 40#L86true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 844#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 346#(= j l), Black: 78#(= max (select A 0)), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), 362#true, Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), 388#(<= N j), Black: 1034#(<= k (+ l 1)), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 387#(= k j), Black: 1039#(<= i l), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), 1167#true, Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 937#true, Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1252#(and (<= N l) (<= k l)), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:45,137 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 21:14:45,137 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 21:14:45,137 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:45,137 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:45,379 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L62-1-->L62-1: Formula: (and (= v_l_11 (+ v_l_12 1)) (= (store v_A_22 v_l_12 (+ (select v_A_22 v_l_12) (- 1))) v_A_21) (< v_l_12 v_N_11)) InVars {A=v_A_22, N=v_N_11, l=v_l_12} OutVars{A=v_A_21, N=v_N_11, l=v_l_11} AuxVars[] AssignedVars[A, l][1541], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 1022#(and (<= N l) (<= i l)), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), 1033#(<= k l), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), 11#thread2EXITtrue, Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), 13#thread1EXITtrue, Black: 490#(and (= l 0) (= i 0) (= min (select A i))), 14#L62-1true, Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 32#thread3EXITtrue, 34#L83true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), 344#true, Black: 82#(and (= min max) (= max (select A 0))), Black: 78#(= max (select A 0)), Black: 346#(= j l), 353#true, 97#true, Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 362#true, Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 364#(= k l), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 853#(<= k l), 937#true, 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i))]) [2021-06-11 21:14:45,380 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 21:14:45,380 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:45,380 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:45,380 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 21:14:46,313 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][587], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 191#(and (= i 0) (<= j i)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 33#thread5ENTRYtrue, 38#thread4EXITtrue, 40#L86true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 1348#(and (< i N) (<= i l)), Black: 355#(= i l), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), 365#(<= N l), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 100#(= min max), Black: 1265#(<= (+ j 1) N), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), Black: 673#(and (= j 0) (<= max (select A 0))), 1252#(and (<= N l) (<= k l)), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1022#(and (<= N l) (<= i l))]) [2021-06-11 21:14:46,314 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-06-11 21:14:46,314 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 21:14:46,314 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 21:14:46,314 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 21:14:46,412 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([130] thread3EXIT-->L86: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][587], [Black: 227#(and (= i 0) (<= min (select A 0))), Black: 946#(<= i l), Black: 940#(<= i (+ l 1)), Black: 1020#(and (<= i (+ l 1)) (<= N (+ l 1))), 4#thread5EXITtrue, Black: 120#(= i 0), Black: 122#(<= min (select A 0)), Black: 405#(<= min (+ (select A 0) 1)), Black: 191#(and (= i 0) (<= j i)), Black: 502#(and (<= min (+ (select A 0) 1)) (<= k i) (<= min (+ max 1)) (< k N)), Black: 504#(and (<= min (+ (select A 0) 1)) (<= min (+ max 1))), Black: 490#(and (= l 0) (= i 0) (= min (select A i))), Black: 492#(and (<= min (+ (select A 0) 1)) (<= k i) (< k N)), Black: 494#(and (<= k i) (< k N)), 38#thread4EXITtrue, 40#L86true, Black: 60#(not b1), Black: 754#(and (= k 0) (= max (select A k))), Black: 755#(<= (select A 0) (+ max 1)), Black: 69#(not b2), 76#true, 853#(<= k l), Black: 340#(and (< i N) (<= i k)), Black: 277#(<= i k), Black: 82#(and (= min max) (= max (select A 0))), 347#(<= N l), Black: 78#(= max (select A 0)), Black: 346#(= j l), 97#true, 356#(<= N l), Black: 1376#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N)), Black: 1378#(and (<= (+ j 1) N) (<= i l)), Black: 355#(= i l), Black: 1348#(and (< i N) (<= i l)), Black: 1380#(and (<= (+ j 1) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1350#(and (<= (+ i 1) l) (<= (+ j 1) N) (< i N) (<= (+ j 1) l)), 1131#(and (<= N l) (<= k l) (<= i l)), Black: 1352#(and (<= (+ j 1) N) (<= (+ j 1) l)), Black: 1354#(and (<= (+ i 1) l) (< i N)), Black: 1356#(and (<= (+ i 1) l) (<= (+ j 2) N) (< (+ i 1) N) (<= (+ j 1) l)), 365#(<= N l), Black: 1358#(and (<= (+ j 1) N) (<= (+ j 1) l) (<= i l)), Black: 99#(= min (select A 0)), Black: 1360#(and (<= (+ j 2) N) (< i N) (<= (+ j 1) l) (<= i l)), Black: 1265#(<= (+ j 1) N), Black: 100#(= min max), Black: 364#(= k l), Black: 1362#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N)), Black: 1366#(and (<= (+ i 1) l) (<= (+ j 2) N) (< i N) (<= (+ j 1) l)), Black: 103#(and (= min (select A 0)) (= min max)), Black: 1368#(and (<= (+ i 1) l) (< (+ i 1) N)), Black: 1370#(and (<= (+ j 2) N) (<= (+ j 1) l) (<= i l)), Black: 1372#(and (<= (+ i 1) l) (<= (+ j 1) N) (< (+ i 1) N) (<= (+ j 1) l)), Black: 1374#(and (<= (+ j 1) N) (< i N) (<= i l)), Black: 374#(<= (+ i 1) N), Black: 532#(and (= i 0) (= j 0)), Black: 550#(and (= i 0) (= j 0) (= max (select A 0))), Black: 536#(<= min max), 380#(<= N j), Black: 1123#(and (<= k l) (< i N) (<= i l)), Black: 1125#(and (<= k l) (<= i l)), Black: 1127#(and (<= N l) (<= k l) (< i N)), Black: 1033#(<= k l), Black: 1129#(and (<= N l) (<= k (+ l 1)) (< i N)), Black: 1034#(<= k (+ l 1)), 388#(<= N j), Black: 1035#(<= N l), Black: 1133#(and (<= N l) (< i N)), Black: 1039#(<= i l), Black: 387#(= k j), Black: 1135#(and (<= k (+ l 1)) (<= i l)), Black: 1141#(and (<= N l) (<= k l)), Black: 1145#(and (<= N l) (<= i l)), Black: 1115#(and (<= i (+ l 1)) (<= k l)), Black: 1117#(and (<= k (+ l 1)) (< i N) (<= i l)), Black: 1149#(and (<= i (+ l 1)) (<= N l)), Black: 397#(<= (+ l 1) N), 400#true, Black: 929#(and (<= (+ k 1) l) (<= (+ k 2) N)), Black: 931#(and (<= k l) (<= (+ k 1) N)), Black: 927#(and (<= (+ k 1) l) (<= (+ k 1) N)), 1252#(and (<= N l) (<= k l)), Black: 673#(and (= j 0) (<= max (select A 0))), Black: 722#(and (= j 0) (<= (select A 0) max)), Black: 643#(<= (select A 0) max), Black: 1170#(<= k (+ l 1)), Black: 1172#(<= N l), Black: 1176#(<= k l), 1260#true, 751#true, Black: 193#(and (= i 0) (= min (select A i)) (<= j i)), Black: 197#(and (< j N) (<= j i) (<= min (select A 0))), Black: 199#(and (= i 0) (<= j i) (<= min (select A 0))), Black: 201#(and (<= min max) (< j N) (<= j i) (<= min (select A 0))), Black: 203#(and (<= min max) (= i 0) (<= j i) (<= min (select A 0))), Black: 207#(and (< j N) (<= j i)), 1022#(and (<= N l) (<= i l))]) [2021-06-11 21:14:46,412 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2021-06-11 21:14:46,412 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 21:14:46,412 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 21:14:46,412 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-06-11 21:14:46,557 INFO L129 PetriNetUnfolder]: 62280/103435 cut-off events. [2021-06-11 21:14:46,557 INFO L130 PetriNetUnfolder]: For 5280783/5337373 co-relation queries the response was YES. [2021-06-11 21:14:49,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1253623 conditions, 103435 events. 62280/103435 cut-off events. For 5280783/5337373 co-relation queries the response was YES. Maximal size of possible extension queue 9570. Compared 1062169 event pairs, 14189 based on Foata normal form. 3308/100457 useless extension candidates. Maximal degree in co-relation 1244021. Up to 46044 conditions per place. [2021-06-11 21:14:51,268 INFO L151 LiptonReduction]: Number of co-enabled transitions 14674 [2021-06-11 21:14:51,897 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 21:14:51,897 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 21:14:51,898 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40574 [2021-06-11 21:14:51,898 INFO L480 AbstractCegarLoop]: Abstraction has has 227 places, 1751 transitions, 50712 flow [2021-06-11 21:14:51,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:14:51,898 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 21:14:51,898 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 21:14:52,099 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-11 21:14:52,099 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-06-11 21:14:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 21:14:52,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2125783297, now seen corresponding path program 9 times [2021-06-11 21:14:52,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 21:14:52,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177157857] [2021-06-11 21:14:52,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 21:14:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 21:14:52,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:14:52,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:14:52,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177157857] [2021-06-11 21:14:52,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741082737] [2021-06-11 21:14:52,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-11 21:14:52,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-11 21:14:52,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-11 21:14:52,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-11 21:14:52,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-11 21:14:52,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:14:52,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:14:52,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 21:14:52,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 21:14:52,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:14:52,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:14:52,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:14:52,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:14:52,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:14:52,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:14:52,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:14:52,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:14:52,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:14:52,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:14:52,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 21:14:52,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 21:14:52,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 21:14:52,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:14:52,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:14:52,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:14:52,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,234 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 21:14:52,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 21:14:52,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 21:14:52,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 21:14:52,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 21:14:52,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 21:14:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-11 21:14:52,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-11 21:14:52,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-06-11 21:14:52,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141574606] [2021-06-11 21:14:52,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 21:14:52,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 21:14:52,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 21:14:52,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-11 21:14:52,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 52 [2021-06-11 21:14:52,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 1751 transitions, 50712 flow. Second operand has 10 states, 10 states have (on average 32.8) internal successors, (328), 10 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:14:52,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 21:14:52,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 52 [2021-06-11 21:14:52,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 21:17:42,663 INFO L129 PetriNetUnfolder]: 195908/295613 cut-off events. [2021-06-11 21:17:42,663 INFO L130 PetriNetUnfolder]: For 17350399/17357316 co-relation queries the response was YES. [2021-06-11 21:17:48,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3925336 conditions, 295613 events. 195908/295613 cut-off events. For 17350399/17357316 co-relation queries the response was YES. Maximal size of possible extension queue 19834. Compared 2811749 event pairs, 26316 based on Foata normal form. 12613/307156 useless extension candidates. Maximal degree in co-relation 3907504. Up to 132704 conditions per place. [2021-06-11 21:17:50,929 INFO L132 encePairwiseOnDemand]: 45/52 looper letters, 4958 selfloop transitions, 2465 changer transitions 16/7463 dead transitions. [2021-06-11 21:17:50,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 7463 transitions, 224618 flow [2021-06-11 21:17:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-11 21:17:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-06-11 21:17:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 878 transitions. [2021-06-11 21:17:50,931 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7341137123745819 [2021-06-11 21:17:50,931 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 878 transitions. [2021-06-11 21:17:50,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 878 transitions. [2021-06-11 21:17:50,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 21:17:50,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 878 transitions. [2021-06-11 21:17:50,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 38.17391304347826) internal successors, (878), 23 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:17:50,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 52.0) internal successors, (1248), 24 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:17:50,934 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 52.0) internal successors, (1248), 24 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 21:17:50,934 INFO L185 Difference]: Start difference. First operand has 227 places, 1751 transitions, 50712 flow. Second operand 23 states and 878 transitions. [2021-06-11 21:17:50,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 7463 transitions, 224618 flow Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown