/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/mcr/example_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 19:04:10,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 19:04:10,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 19:04:10,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 19:04:10,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 19:04:10,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 19:04:10,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 19:04:10,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 19:04:10,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 19:04:10,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 19:04:10,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 19:04:10,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 19:04:10,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 19:04:10,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 19:04:10,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 19:04:10,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 19:04:10,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 19:04:10,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 19:04:10,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 19:04:10,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 19:04:10,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 19:04:10,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 19:04:10,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 19:04:10,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 19:04:10,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 19:04:10,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 19:04:10,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 19:04:10,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 19:04:10,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 19:04:10,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 19:04:10,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 19:04:10,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 19:04:10,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 19:04:10,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 19:04:10,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 19:04:10,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 19:04:10,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 19:04:10,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 19:04:10,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 19:04:10,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 19:04:10,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 19:04:10,720 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 19:04:10,758 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 19:04:10,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 19:04:10,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 19:04:10,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 19:04:10,761 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 19:04:10,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 19:04:10,762 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 19:04:10,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 19:04:10,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 19:04:10,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 19:04:10,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 19:04:10,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 19:04:10,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 19:04:10,763 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 19:04:10,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 19:04:10,763 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 19:04:10,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 19:04:10,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 19:04:10,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 19:04:10,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 19:04:10,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 19:04:10,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 19:04:10,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 19:04:10,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 19:04:10,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 19:04:10,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 19:04:10,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 19:04:10,765 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 19:04:10,765 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 19:04:10,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 19:04:10,765 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 19:04:11,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 19:04:11,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 19:04:11,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 19:04:11,064 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-11 19:04:11,065 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-11 19:04:11,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_3.bpl [2021-06-11 19:04:11,066 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_3.bpl' [2021-06-11 19:04:11,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 19:04:11,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-11 19:04:11,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 19:04:11,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 19:04:11,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 19:04:11,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/1) ... [2021-06-11 19:04:11,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/1) ... [2021-06-11 19:04:11,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 19:04:11,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 19:04:11,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 19:04:11,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 19:04:11,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/1) ... [2021-06-11 19:04:11,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/1) ... [2021-06-11 19:04:11,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/1) ... [2021-06-11 19:04:11,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/1) ... [2021-06-11 19:04:11,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/1) ... [2021-06-11 19:04:11,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/1) ... [2021-06-11 19:04:11,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/1) ... [2021-06-11 19:04:11,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 19:04:11,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 19:04:11,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 19:04:11,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 19:04:11,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (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 19:04:11,202 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2021-06-11 19:04:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2021-06-11 19:04:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2021-06-11 19:04:11,203 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2021-06-11 19:04:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2021-06-11 19:04:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2021-06-11 19:04:11,203 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2021-06-11 19:04:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2021-06-11 19:04:11,204 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2021-06-11 19:04:11,204 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-11 19:04:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 19:04:11,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 19:04:11,205 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 19:04:11,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 19:04:11,302 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-11 19:04:11,303 INFO L202 PluginConnector]: Adding new model example_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 07:04:11 BoogieIcfgContainer [2021-06-11 19:04:11,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 19:04:11,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 19:04:11,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 19:04:11,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 19:04:11,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 07:04:11" (1/2) ... [2021-06-11 19:04:11,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699b015a and model type example_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 07:04:11, skipping insertion in model container [2021-06-11 19:04:11,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 07:04:11" (2/2) ... [2021-06-11 19:04:11,310 INFO L111 eAbstractionObserver]: Analyzing ICFG example_3.bpl [2021-06-11 19:04:11,314 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 19:04:11,317 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-06-11 19:04:11,318 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 19:04:11,350 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-06-11 19:04:11,364 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-11 19:04:11,380 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 19:04:11,380 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 19:04:11,380 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 19:04:11,380 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 19:04:11,380 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 19:04:11,381 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 19:04:11,381 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 19:04:11,381 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 19:04:11,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 90 flow [2021-06-11 19:04:11,410 INFO L129 PetriNetUnfolder]: 5/24 cut-off events. [2021-06-11 19:04:11,410 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-11 19:04:11,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 24 events. 5/24 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 6 conditions per place. [2021-06-11 19:04:11,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 90 flow [2021-06-11 19:04:11,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 19 transitions, 74 flow [2021-06-11 19:04:11,417 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 19:04:11,440 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 74 flow [2021-06-11 19:04:11,443 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 74 flow [2021-06-11 19:04:11,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 74 flow [2021-06-11 19:04:11,451 INFO L129 PetriNetUnfolder]: 5/22 cut-off events. [2021-06-11 19:04:11,451 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-11 19:04:11,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 22 events. 5/22 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 20. Up to 6 conditions per place. [2021-06-11 19:04:11,454 INFO L151 LiptonReduction]: Number of co-enabled transitions 84 [2021-06-11 19:04:11,495 INFO L163 LiptonReduction]: Checked pairs total: 27 [2021-06-11 19:04:11,495 INFO L165 LiptonReduction]: Total number of compositions: 3 [2021-06-11 19:04:11,497 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 81 [2021-06-11 19:04:11,507 INFO L129 PetriNetUnfolder]: 5/18 cut-off events. [2021-06-11 19:04:11,507 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-11 19:04:11,507 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 19:04:11,508 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 19:04:11,508 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 19:04:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 19:04:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash 33487082, now seen corresponding path program 1 times [2021-06-11 19:04:11,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 19:04:11,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459616793] [2021-06-11 19:04:11,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 19:04:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 19:04:11,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:11,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:11,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:11,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 19:04:11,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:11,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:11,707 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 19:04:11,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459616793] [2021-06-11 19:04:11,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 19:04:11,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 19:04:11,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271187207] [2021-06-11 19:04:11,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 19:04:11,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 19:04:11,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 19:04:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 19:04:11,737 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 27 [2021-06-11 19:04:11,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 19:04:11,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 19:04:11,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 27 [2021-06-11 19:04:11,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 19:04:11,770 INFO L129 PetriNetUnfolder]: 1/12 cut-off events. [2021-06-11 19:04:11,771 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-11 19:04:11,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 12 events. 1/12 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 3/15 useless extension candidates. Maximal degree in co-relation 11. Up to 3 conditions per place. [2021-06-11 19:04:11,773 INFO L132 encePairwiseOnDemand]: 24/27 looper letters, 1 selfloop transitions, 1 changer transitions 0/12 dead transitions. [2021-06-11 19:04:11,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 12 transitions, 52 flow [2021-06-11 19:04:11,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 19:04:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 19:04:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2021-06-11 19:04:11,783 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2021-06-11 19:04:11,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 73 transitions. [2021-06-11 19:04:11,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 73 transitions. [2021-06-11 19:04:11,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 19:04:11,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 73 transitions. [2021-06-11 19:04:11,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 19:04:11,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 19:04:11,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 19:04:11,796 INFO L185 Difference]: Start difference. First operand has 20 places, 16 transitions, 68 flow. Second operand 3 states and 73 transitions. [2021-06-11 19:04:11,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 12 transitions, 52 flow [2021-06-11 19:04:11,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 12 transitions, 36 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-06-11 19:04:11,801 INFO L241 Difference]: Finished difference. Result has 16 places, 12 transitions, 34 flow [2021-06-11 19:04:11,803 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=34, PETRI_PLACES=16, PETRI_TRANSITIONS=12} [2021-06-11 19:04:11,805 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, -4 predicate places. [2021-06-11 19:04:11,806 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 19:04:11,806 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 12 transitions, 34 flow [2021-06-11 19:04:11,807 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 12 transitions, 34 flow [2021-06-11 19:04:11,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 16 places, 12 transitions, 34 flow [2021-06-11 19:04:11,818 INFO L129 PetriNetUnfolder]: 1/12 cut-off events. [2021-06-11 19:04:11,818 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 19:04:11,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 12 events. 1/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2021-06-11 19:04:11,819 INFO L151 LiptonReduction]: Number of co-enabled transitions 24 [2021-06-11 19:04:11,821 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 19:04:11,821 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 19:04:11,821 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-06-11 19:04:11,824 INFO L480 AbstractCegarLoop]: Abstraction has has 16 places, 12 transitions, 34 flow [2021-06-11 19:04:11,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 19:04:11,825 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 19:04:11,825 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 19:04:11,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-11 19:04:11,826 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 19:04:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 19:04:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash 33659132, now seen corresponding path program 1 times [2021-06-11 19:04:11,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 19:04:11,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034016987] [2021-06-11 19:04:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 19:04:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 19:04:11,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:11,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:11,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:11,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 19:04:11,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:11,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 19:04:11,907 INFO L142 QuantifierPusher]: treesize reduction 18, result has 48.6 percent of original size [2021-06-11 19:04:11,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 19:04:11,920 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 19:04:11,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034016987] [2021-06-11 19:04:11,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 19:04:11,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 19:04:11,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560308371] [2021-06-11 19:04:11,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 19:04:11,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 19:04:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 19:04:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 19:04:11,923 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-06-11 19:04:11,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 12 transitions, 34 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:11,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 19:04:11,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-06-11 19:04:11,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 19:04:11,968 INFO L129 PetriNetUnfolder]: 6/33 cut-off events. [2021-06-11 19:04:11,968 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 19:04:11,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 33 events. 6/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 87 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 45. Up to 7 conditions per place. [2021-06-11 19:04:11,969 INFO L132 encePairwiseOnDemand]: 23/27 looper letters, 5 selfloop transitions, 2 changer transitions 1/16 dead transitions. [2021-06-11 19:04:11,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 16 transitions, 58 flow [2021-06-11 19:04:11,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 19:04:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 19:04:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2021-06-11 19:04:11,971 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7703703703703704 [2021-06-11 19:04:11,971 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 104 transitions. [2021-06-11 19:04:11,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 104 transitions. [2021-06-11 19:04:11,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 19:04:11,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 104 transitions. [2021-06-11 19:04:11,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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 19:04:11,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:11,974 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:11,974 INFO L185 Difference]: Start difference. First operand has 16 places, 12 transitions, 34 flow. Second operand 5 states and 104 transitions. [2021-06-11 19:04:11,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 16 transitions, 58 flow [2021-06-11 19:04:11,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 16 transitions, 57 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 19:04:11,976 INFO L241 Difference]: Finished difference. Result has 22 places, 13 transitions, 48 flow [2021-06-11 19:04:11,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=48, PETRI_PLACES=22, PETRI_TRANSITIONS=13} [2021-06-11 19:04:11,977 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2021-06-11 19:04:11,977 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 19:04:11,977 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 13 transitions, 48 flow [2021-06-11 19:04:11,977 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 13 transitions, 48 flow [2021-06-11 19:04:11,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 13 transitions, 48 flow [2021-06-11 19:04:11,982 INFO L129 PetriNetUnfolder]: 2/21 cut-off events. [2021-06-11 19:04:11,982 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-11 19:04:11,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 21 events. 2/21 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 31. Up to 4 conditions per place. [2021-06-11 19:04:11,983 INFO L151 LiptonReduction]: Number of co-enabled transitions 24 [2021-06-11 19:04:11,984 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 19:04:11,984 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 19:04:11,984 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 19:04:11,985 INFO L480 AbstractCegarLoop]: Abstraction has has 21 places, 13 transitions, 48 flow [2021-06-11 19:04:11,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:11,986 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 19:04:11,986 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 19:04:11,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-11 19:04:11,986 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 19:04:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 19:04:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash 53113680, now seen corresponding path program 2 times [2021-06-11 19:04:11,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 19:04:11,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218134858] [2021-06-11 19:04:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 19:04:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 19:04:12,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:12,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 19:04:12,019 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-06-11 19:04:12,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 19:04:12,032 INFO L142 QuantifierPusher]: treesize reduction 18, result has 48.6 percent of original size [2021-06-11 19:04:12,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 19:04:12,045 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 19:04:12,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218134858] [2021-06-11 19:04:12,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 19:04:12,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 19:04:12,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369577511] [2021-06-11 19:04:12,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 19:04:12,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 19:04:12,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 19:04:12,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 19:04:12,048 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-06-11 19:04:12,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 13 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 19:04:12,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-06-11 19:04:12,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 19:04:12,077 INFO L129 PetriNetUnfolder]: 5/33 cut-off events. [2021-06-11 19:04:12,078 INFO L130 PetriNetUnfolder]: For 24/27 co-relation queries the response was YES. [2021-06-11 19:04:12,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 33 events. 5/33 cut-off events. For 24/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 99 event pairs, 0 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 63. Up to 7 conditions per place. [2021-06-11 19:04:12,079 INFO L132 encePairwiseOnDemand]: 23/27 looper letters, 5 selfloop transitions, 2 changer transitions 3/18 dead transitions. [2021-06-11 19:04:12,079 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 18 transitions, 92 flow [2021-06-11 19:04:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 19:04:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 19:04:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2021-06-11 19:04:12,080 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7703703703703704 [2021-06-11 19:04:12,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 104 transitions. [2021-06-11 19:04:12,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 104 transitions. [2021-06-11 19:04:12,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 19:04:12,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 104 transitions. [2021-06-11 19:04:12,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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 19:04:12,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,083 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,083 INFO L185 Difference]: Start difference. First operand has 21 places, 13 transitions, 48 flow. Second operand 5 states and 104 transitions. [2021-06-11 19:04:12,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 18 transitions, 92 flow [2021-06-11 19:04:12,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 85 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 19:04:12,084 INFO L241 Difference]: Finished difference. Result has 26 places, 13 transitions, 58 flow [2021-06-11 19:04:12,084 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=26, PETRI_TRANSITIONS=13} [2021-06-11 19:04:12,085 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2021-06-11 19:04:12,085 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 19:04:12,085 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 13 transitions, 58 flow [2021-06-11 19:04:12,085 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 13 transitions, 58 flow [2021-06-11 19:04:12,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 13 transitions, 58 flow [2021-06-11 19:04:12,089 INFO L129 PetriNetUnfolder]: 2/21 cut-off events. [2021-06-11 19:04:12,089 INFO L130 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2021-06-11 19:04:12,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 21 events. 2/21 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2021-06-11 19:04:12,090 INFO L151 LiptonReduction]: Number of co-enabled transitions 20 [2021-06-11 19:04:12,091 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 19:04:12,091 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 19:04:12,091 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-06-11 19:04:12,092 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 13 transitions, 58 flow [2021-06-11 19:04:12,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 19:04:12,092 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 19:04:12,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-11 19:04:12,092 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 19:04:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 19:04:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash -802192974, now seen corresponding path program 3 times [2021-06-11 19:04:12,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 19:04:12,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007476984] [2021-06-11 19:04:12,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 19:04:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 19:04:12,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:12,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 19:04:12,124 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-06-11 19:04:12,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 19:04:12,138 INFO L142 QuantifierPusher]: treesize reduction 18, result has 48.6 percent of original size [2021-06-11 19:04:12,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 19:04:12,152 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 19:04:12,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007476984] [2021-06-11 19:04:12,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 19:04:12,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 19:04:12,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878629432] [2021-06-11 19:04:12,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 19:04:12,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 19:04:12,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 19:04:12,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 19:04:12,154 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-06-11 19:04:12,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 13 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 19:04:12,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-06-11 19:04:12,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 19:04:12,194 INFO L129 PetriNetUnfolder]: 4/30 cut-off events. [2021-06-11 19:04:12,194 INFO L130 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2021-06-11 19:04:12,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 30 events. 4/30 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2021-06-11 19:04:12,195 INFO L132 encePairwiseOnDemand]: 23/27 looper letters, 5 selfloop transitions, 3 changer transitions 1/17 dead transitions. [2021-06-11 19:04:12,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 17 transitions, 99 flow [2021-06-11 19:04:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 19:04:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 19:04:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2021-06-11 19:04:12,200 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7703703703703704 [2021-06-11 19:04:12,200 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 104 transitions. [2021-06-11 19:04:12,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 104 transitions. [2021-06-11 19:04:12,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 19:04:12,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 104 transitions. [2021-06-11 19:04:12,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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 19:04:12,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,205 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,205 INFO L185 Difference]: Start difference. First operand has 25 places, 13 transitions, 58 flow. Second operand 5 states and 104 transitions. [2021-06-11 19:04:12,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 17 transitions, 99 flow [2021-06-11 19:04:12,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 17 transitions, 81 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-06-11 19:04:12,208 INFO L241 Difference]: Finished difference. Result has 28 places, 14 transitions, 69 flow [2021-06-11 19:04:12,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=69, PETRI_PLACES=28, PETRI_TRANSITIONS=14} [2021-06-11 19:04:12,209 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2021-06-11 19:04:12,209 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 19:04:12,209 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 14 transitions, 69 flow [2021-06-11 19:04:12,209 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 14 transitions, 69 flow [2021-06-11 19:04:12,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 14 transitions, 69 flow [2021-06-11 19:04:12,220 INFO L129 PetriNetUnfolder]: 3/25 cut-off events. [2021-06-11 19:04:12,221 INFO L130 PetriNetUnfolder]: For 23/24 co-relation queries the response was YES. [2021-06-11 19:04:12,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 25 events. 3/25 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 47. Up to 6 conditions per place. [2021-06-11 19:04:12,222 INFO L151 LiptonReduction]: Number of co-enabled transitions 18 [2021-06-11 19:04:12,224 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 19:04:12,224 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 19:04:12,224 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-06-11 19:04:12,227 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 14 transitions, 69 flow [2021-06-11 19:04:12,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,228 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 19:04:12,228 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 19:04:12,228 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-11 19:04:12,228 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 19:04:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 19:04:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash 902364692, now seen corresponding path program 4 times [2021-06-11 19:04:12,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 19:04:12,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010104064] [2021-06-11 19:04:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 19:04:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 19:04:12,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:12,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 19:04:12,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 19:04:12,281 INFO L142 QuantifierPusher]: treesize reduction 18, result has 48.6 percent of original size [2021-06-11 19:04:12,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 19:04:12,292 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 19:04:12,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010104064] [2021-06-11 19:04:12,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 19:04:12,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 19:04:12,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430553610] [2021-06-11 19:04:12,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 19:04:12,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 19:04:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 19:04:12,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 19:04:12,294 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-06-11 19:04:12,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 14 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 19:04:12,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-06-11 19:04:12,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 19:04:12,329 INFO L129 PetriNetUnfolder]: 4/27 cut-off events. [2021-06-11 19:04:12,329 INFO L130 PetriNetUnfolder]: For 34/36 co-relation queries the response was YES. [2021-06-11 19:04:12,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 27 events. 4/27 cut-off events. For 34/36 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 1 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2021-06-11 19:04:12,330 INFO L132 encePairwiseOnDemand]: 23/27 looper letters, 3 selfloop transitions, 1 changer transitions 4/16 dead transitions. [2021-06-11 19:04:12,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 16 transitions, 99 flow [2021-06-11 19:04:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 19:04:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 19:04:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2021-06-11 19:04:12,331 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.762962962962963 [2021-06-11 19:04:12,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 103 transitions. [2021-06-11 19:04:12,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 103 transitions. [2021-06-11 19:04:12,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 19:04:12,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 103 transitions. [2021-06-11 19:04:12,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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 19:04:12,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,333 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,333 INFO L185 Difference]: Start difference. First operand has 27 places, 14 transitions, 69 flow. Second operand 5 states and 103 transitions. [2021-06-11 19:04:12,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 16 transitions, 99 flow [2021-06-11 19:04:12,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 16 transitions, 95 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 19:04:12,335 INFO L241 Difference]: Finished difference. Result has 31 places, 12 transitions, 56 flow [2021-06-11 19:04:12,335 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=12} [2021-06-11 19:04:12,335 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2021-06-11 19:04:12,336 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 19:04:12,336 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 12 transitions, 56 flow [2021-06-11 19:04:12,336 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 12 transitions, 56 flow [2021-06-11 19:04:12,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 12 transitions, 56 flow [2021-06-11 19:04:12,338 INFO L129 PetriNetUnfolder]: 1/12 cut-off events. [2021-06-11 19:04:12,338 INFO L130 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2021-06-11 19:04:12,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 12 events. 1/12 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2021-06-11 19:04:12,344 INFO L151 LiptonReduction]: Number of co-enabled transitions 8 [2021-06-11 19:04:12,345 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 19:04:12,345 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 19:04:12,345 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 19:04:12,346 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 12 transitions, 56 flow [2021-06-11 19:04:12,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,347 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 19:04:12,347 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 19:04:12,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 19:04:12,347 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 19:04:12,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 19:04:12,348 INFO L82 PathProgramCache]: Analyzing trace with hash 71195792, now seen corresponding path program 5 times [2021-06-11 19:04:12,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 19:04:12,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104176750] [2021-06-11 19:04:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 19:04:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 19:04:12,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:12,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 19:04:12,398 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-06-11 19:04:12,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 19:04:12,412 INFO L142 QuantifierPusher]: treesize reduction 18, result has 48.6 percent of original size [2021-06-11 19:04:12,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 19:04:12,428 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 19:04:12,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104176750] [2021-06-11 19:04:12,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 19:04:12,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 19:04:12,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547953451] [2021-06-11 19:04:12,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 19:04:12,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 19:04:12,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 19:04:12,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 19:04:12,437 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-06-11 19:04:12,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 12 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 19:04:12,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-06-11 19:04:12,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 19:04:12,468 INFO L129 PetriNetUnfolder]: 2/20 cut-off events. [2021-06-11 19:04:12,469 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-11 19:04:12,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 20 events. 2/20 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 51. Up to 4 conditions per place. [2021-06-11 19:04:12,470 INFO L132 encePairwiseOnDemand]: 23/27 looper letters, 3 selfloop transitions, 1 changer transitions 2/14 dead transitions. [2021-06-11 19:04:12,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 14 transitions, 87 flow [2021-06-11 19:04:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 19:04:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 19:04:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2021-06-11 19:04:12,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2021-06-11 19:04:12,472 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 102 transitions. [2021-06-11 19:04:12,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 102 transitions. [2021-06-11 19:04:12,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 19:04:12,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 102 transitions. [2021-06-11 19:04:12,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 19:04:12,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,474 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,475 INFO L185 Difference]: Start difference. First operand has 28 places, 12 transitions, 56 flow. Second operand 5 states and 102 transitions. [2021-06-11 19:04:12,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 14 transitions, 87 flow [2021-06-11 19:04:12,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 14 transitions, 59 flow, removed 5 selfloop flow, removed 9 redundant places. [2021-06-11 19:04:12,477 INFO L241 Difference]: Finished difference. Result has 26 places, 12 transitions, 46 flow [2021-06-11 19:04:12,477 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=12} [2021-06-11 19:04:12,478 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2021-06-11 19:04:12,478 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 19:04:12,478 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 12 transitions, 46 flow [2021-06-11 19:04:12,478 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 12 transitions, 46 flow [2021-06-11 19:04:12,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 12 transitions, 46 flow [2021-06-11 19:04:12,481 INFO L129 PetriNetUnfolder]: 1/13 cut-off events. [2021-06-11 19:04:12,481 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 19:04:12,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 13 events. 1/13 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 7 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2021-06-11 19:04:12,481 INFO L151 LiptonReduction]: Number of co-enabled transitions 6 [2021-06-11 19:04:12,483 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 19:04:12,483 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 19:04:12,483 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-06-11 19:04:12,485 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 12 transitions, 46 flow [2021-06-11 19:04:12,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,486 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 19:04:12,486 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 19:04:12,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 19:04:12,486 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 19:04:12,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 19:04:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash -832248358, now seen corresponding path program 1 times [2021-06-11 19:04:12,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 19:04:12,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898357532] [2021-06-11 19:04:12,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 19:04:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 19:04:12,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:12,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 19:04:12,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:12,553 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 19:04:12,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898357532] [2021-06-11 19:04:12,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 19:04:12,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 19:04:12,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566655190] [2021-06-11 19:04:12,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 19:04:12,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 19:04:12,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 19:04:12,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 19:04:12,555 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 27 [2021-06-11 19:04:12,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 12 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 19:04:12,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 19:04:12,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 27 [2021-06-11 19:04:12,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 19:04:12,563 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-06-11 19:04:12,564 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-06-11 19:04:12,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 11 events. 0/11 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 1/12 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 19:04:12,564 INFO L132 encePairwiseOnDemand]: 25/27 looper letters, 1 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2021-06-11 19:04:12,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 10 transitions, 44 flow [2021-06-11 19:04:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 19:04:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 19:04:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2021-06-11 19:04:12,565 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-06-11 19:04:12,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 72 transitions. [2021-06-11 19:04:12,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 72 transitions. [2021-06-11 19:04:12,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 19:04:12,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 72 transitions. [2021-06-11 19:04:12,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 19:04:12,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 19:04:12,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 19:04:12,567 INFO L185 Difference]: Start difference. First operand has 24 places, 12 transitions, 46 flow. Second operand 3 states and 72 transitions. [2021-06-11 19:04:12,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 10 transitions, 44 flow [2021-06-11 19:04:12,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 10 transitions, 35 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-06-11 19:04:12,569 INFO L241 Difference]: Finished difference. Result has 21 places, 10 transitions, 33 flow [2021-06-11 19:04:12,569 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=31, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=33, PETRI_PLACES=21, PETRI_TRANSITIONS=10} [2021-06-11 19:04:12,569 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2021-06-11 19:04:12,569 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 19:04:12,570 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 10 transitions, 33 flow [2021-06-11 19:04:12,570 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 10 transitions, 33 flow [2021-06-11 19:04:12,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 10 transitions, 33 flow [2021-06-11 19:04:12,572 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-06-11 19:04:12,572 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 19:04:12,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 11 events. 0/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 19:04:12,573 INFO L151 LiptonReduction]: Number of co-enabled transitions 2 [2021-06-11 19:04:12,573 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 19:04:12,574 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 19:04:12,574 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-06-11 19:04:12,577 INFO L480 AbstractCegarLoop]: Abstraction has has 21 places, 10 transitions, 33 flow [2021-06-11 19:04:12,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 19:04:12,578 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 19:04:12,578 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 19:04:12,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 19:04:12,578 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 19:04:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 19:04:12,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1788944852, now seen corresponding path program 6 times [2021-06-11 19:04:12,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 19:04:12,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056658379] [2021-06-11 19:04:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 19:04:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 19:04:12,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 19:04:12,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 19:04:12,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 19:04:12,613 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-06-11 19:04:12,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 19:04:12,623 INFO L142 QuantifierPusher]: treesize reduction 18, result has 48.6 percent of original size [2021-06-11 19:04:12,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 19:04:12,637 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 19:04:12,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056658379] [2021-06-11 19:04:12,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 19:04:12,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 19:04:12,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221508117] [2021-06-11 19:04:12,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 19:04:12,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 19:04:12,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 19:04:12,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 19:04:12,641 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-06-11 19:04:12,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 10 transitions, 33 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 19:04:12,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-06-11 19:04:12,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 19:04:12,663 INFO L129 PetriNetUnfolder]: 0/10 cut-off events. [2021-06-11 19:04:12,663 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 19:04:12,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 10 events. 0/10 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 1/11 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 19:04:12,664 INFO L132 encePairwiseOnDemand]: 23/27 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2021-06-11 19:04:12,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 10 transitions, 43 flow [2021-06-11 19:04:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 19:04:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 19:04:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2021-06-11 19:04:12,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2021-06-11 19:04:12,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 100 transitions. [2021-06-11 19:04:12,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 100 transitions. [2021-06-11 19:04:12,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 19:04:12,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 100 transitions. [2021-06-11 19:04:12,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 19:04:12,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,666 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 19:04:12,666 INFO L185 Difference]: Start difference. First operand has 21 places, 10 transitions, 33 flow. Second operand 5 states and 100 transitions. [2021-06-11 19:04:12,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 10 transitions, 43 flow [2021-06-11 19:04:12,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 10 transitions, 42 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 19:04:12,667 INFO L241 Difference]: Finished difference. Result has 23 places, 0 transitions, 0 flow [2021-06-11 19:04:12,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=23, PETRI_TRANSITIONS=0} [2021-06-11 19:04:12,667 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2021-06-11 19:04:12,668 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 19:04:12,668 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 0 transitions, 0 flow [2021-06-11 19:04:12,668 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 0 transitions, 0 flow [2021-06-11 19:04:12,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-06-11 19:04:12,668 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-06-11 19:04:12,668 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 19:04:12,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2021-06-11 19:04:12,669 INFO L151 LiptonReduction]: Number of co-enabled transitions 0 [2021-06-11 19:04:12,669 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 19:04:12,669 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 19:04:12,669 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-06-11 19:04:12,670 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-06-11 19:04:12,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 19:04:12,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 19:04:12,674 INFO L202 PluginConnector]: Adding new model example_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 07:04:12 BasicIcfg [2021-06-11 19:04:12,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 19:04:12,674 INFO L168 Benchmark]: Toolchain (without parser) took 1575.82 ms. Allocated memory is still 360.7 MB. Free memory was 340.1 MB in the beginning and 325.7 MB in the end (delta: 14.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.0 GB. [2021-06-11 19:04:12,675 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.57 ms. Allocated memory is still 360.7 MB. Free memory was 341.1 MB in the beginning and 341.0 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 19:04:12,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.08 ms. Allocated memory is still 360.7 MB. Free memory was 340.1 MB in the beginning and 338.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 19:04:12,675 INFO L168 Benchmark]: Boogie Preprocessor took 9.96 ms. Allocated memory is still 360.7 MB. Free memory was 338.6 MB in the beginning and 337.7 MB in the end (delta: 841.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 19:04:12,675 INFO L168 Benchmark]: RCFGBuilder took 162.02 ms. Allocated memory is still 360.7 MB. Free memory was 337.7 MB in the beginning and 328.9 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. [2021-06-11 19:04:12,676 INFO L168 Benchmark]: TraceAbstraction took 1368.88 ms. Allocated memory is still 360.7 MB. Free memory was 328.4 MB in the beginning and 325.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.2 MB. Max. memory is 16.0 GB. [2021-06-11 19:04:12,677 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.57 ms. Allocated memory is still 360.7 MB. Free memory was 341.1 MB in the beginning and 341.0 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 25.08 ms. Allocated memory is still 360.7 MB. Free memory was 340.1 MB in the beginning and 338.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 9.96 ms. Allocated memory is still 360.7 MB. Free memory was 338.6 MB in the beginning and 337.7 MB in the end (delta: 841.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 162.02 ms. Allocated memory is still 360.7 MB. Free memory was 337.7 MB in the beginning and 328.9 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 1368.88 ms. Allocated memory is still 360.7 MB. Free memory was 328.4 MB in the beginning and 325.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.8ms, 23 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 16 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 27 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.8ms, 16 PlacesBefore, 16 PlacesAfterwards, 12 TransitionsBefore, 12 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6ms, 22 PlacesBefore, 21 PlacesAfterwards, 13 TransitionsBefore, 13 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4ms, 26 PlacesBefore, 25 PlacesAfterwards, 13 TransitionsBefore, 13 TransitionsAfterwards, 20 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.8ms, 28 PlacesBefore, 27 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3ms, 31 PlacesBefore, 28 PlacesAfterwards, 12 TransitionsBefore, 12 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7ms, 26 PlacesBefore, 24 PlacesAfterwards, 12 TransitionsBefore, 12 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8ms, 21 PlacesBefore, 21 PlacesAfterwards, 10 TransitionsBefore, 10 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9ms, 23 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0 - PositiveResult [Line: 19]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 1294.8ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 350.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 120.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 34 SDtfs, 29 SDslu, 15 SDs, 0 SdLazy, 53 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 292.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 12.6ms SsaConstructionTime, 57.8ms SatisfiabilityAnalysisTime, 507.5ms InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...