/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-FA-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 14:09:23,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 14:09:23,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 14:09:23,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 14:09:23,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 14:09:23,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 14:09:23,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 14:09:23,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 14:09:23,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 14:09:23,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 14:09:23,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 14:09:23,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 14:09:23,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 14:09:23,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 14:09:23,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 14:09:23,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 14:09:23,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 14:09:23,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 14:09:23,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 14:09:23,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 14:09:23,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 14:09:23,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 14:09:23,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 14:09:23,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 14:09:23,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 14:09:23,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 14:09:23,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 14:09:23,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 14:09:23,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 14:09:23,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 14:09:23,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 14:09:23,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 14:09:23,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 14:09:23,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 14:09:23,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 14:09:23,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 14:09:23,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 14:09:23,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 14:09:23,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 14:09:23,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 14:09:23,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 14:09:23,471 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-FA-SemanticLbe.epf [2021-03-11 14:09:23,506 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 14:09:23,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 14:09:23,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 14:09:23,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 14:09:23,510 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 14:09:23,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 14:09:23,511 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 14:09:23,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 14:09:23,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 14:09:23,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 14:09:23,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 14:09:23,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 14:09:23,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 14:09:23,512 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 14:09:23,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 14:09:23,513 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 14:09:23,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 14:09:23,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 14:09:23,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 14:09:23,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 14:09:23,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 14:09:23,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 14:09:23,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 14:09:23,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 14:09:23,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 14:09:23,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 14:09:23,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 14:09:23,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 14:09:23,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-03-11 14:09:23,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 14:09:23,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 14:09:23,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 14:09:23,857 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-11 14:09:23,858 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-11 14:09:23,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl [2021-03-11 14:09:23,859 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl' [2021-03-11 14:09:24,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 14:09:24,107 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-11 14:09:24,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 14:09:24,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 14:09:24,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 14:09:24,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/1) ... [2021-03-11 14:09:24,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/1) ... [2021-03-11 14:09:24,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 14:09:24,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 14:09:24,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 14:09:24,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 14:09:24,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/1) ... [2021-03-11 14:09:24,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/1) ... [2021-03-11 14:09:24,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/1) ... [2021-03-11 14:09:24,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/1) ... [2021-03-11 14:09:24,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/1) ... [2021-03-11 14:09:24,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/1) ... [2021-03-11 14:09:24,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/1) ... [2021-03-11 14:09:24,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 14:09:24,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 14:09:24,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 14:09:24,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 14:09:24,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (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-03-11 14:09:24,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-11 14:09:24,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 14:09:24,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 14:09:24,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2021-03-11 14:09:24,211 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2021-03-11 14:09:24,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2021-03-11 14:09:24,211 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 14:09:24,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 14:09:24,315 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-03-11 14:09:24,316 INFO L202 PluginConnector]: Adding new model fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:09:24 BoogieIcfgContainer [2021-03-11 14:09:24,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 14:09:24,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 14:09:24,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 14:09:24,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 14:09:24,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:09:24" (1/2) ... [2021-03-11 14:09:24,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d249a2e and model type fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:09:24, skipping insertion in model container [2021-03-11 14:09:24,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:09:24" (2/2) ... [2021-03-11 14:09:24,323 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_loop_noop.bpl [2021-03-11 14:09:24,327 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 14:09:24,327 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 14:09:24,330 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-11 14:09:24,331 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 14:09:24,347 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:24,358 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:24,372 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:24,373 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:24,373 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:24,373 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:24,373 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:24,373 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:24,373 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:24,373 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:24,382 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:24,391 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 11 places, 8 transitions, 21 flow [2021-03-11 14:09:24,393 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 11 places, 8 transitions, 21 flow [2021-03-11 14:09:24,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 11 places, 8 transitions, 21 flow [2021-03-11 14:09:24,408 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-11 14:09:24,409 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:24,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 11 events. 0/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 19 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-11 14:09:24,411 INFO L116 LiptonReduction]: Number of co-enabled transitions 16 [2021-03-11 14:09:24,439 INFO L131 LiptonReduction]: Checked pairs total: 6 [2021-03-11 14:09:24,440 INFO L133 LiptonReduction]: Total number of compositions: 2 [2021-03-11 14:09:24,447 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 9 places, 6 transitions, 17 flow [2021-03-11 14:09:24,452 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 7 states have (on average 2.0) internal successors, (14), 11 states have internal predecessors, (14), 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-03-11 14:09:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 7 states have (on average 2.0) internal successors, (14), 11 states have internal predecessors, (14), 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-03-11 14:09:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:24,458 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:24,458 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:24,458 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:24,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1315, now seen corresponding path program 1 times [2021-03-11 14:09:24,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:24,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335975813] [2021-03-11 14:09:24,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:24,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:24,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:24,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335975813] [2021-03-11 14:09:24,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:24,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:24,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089315222] [2021-03-11 14:09:24,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:24,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:24,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:24,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:24,574 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 2.0) internal successors, (14), 11 states have internal predecessors, (14), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:24,585 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2021-03-11 14:09:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:24,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:24,592 INFO L225 Difference]: With dead ends: 9 [2021-03-11 14:09:24,592 INFO L226 Difference]: Without dead ends: 6 [2021-03-11 14:09:24,593 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2021-03-11 14:09:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2021-03-11 14:09:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-03-11 14:09:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2021-03-11 14:09:24,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 2 [2021-03-11 14:09:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:24,615 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2021-03-11 14:09:24,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2021-03-11 14:09:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-03-11 14:09:24,616 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:24,616 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-03-11 14:09:24,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 14:09:24,616 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:24,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash 41033, now seen corresponding path program 1 times [2021-03-11 14:09:24,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:24,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138720222] [2021-03-11 14:09:24,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:24,621 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:24,623 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:24,633 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:24,634 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:24,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 14:09:24,635 WARN L342 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:24,635 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-03-11 14:09:24,640 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:24,641 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:24,642 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:24,642 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:24,642 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:24,642 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:24,642 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:24,643 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:24,643 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:24,643 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:24,644 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:24,644 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 11 transitions, 34 flow [2021-03-11 14:09:24,644 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 11 transitions, 34 flow [2021-03-11 14:09:24,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 16 places, 11 transitions, 34 flow [2021-03-11 14:09:24,648 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-11 14:09:24,648 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:24,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 39 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-11 14:09:24,649 INFO L116 LiptonReduction]: Number of co-enabled transitions 44 [2021-03-11 14:09:24,687 INFO L131 LiptonReduction]: Checked pairs total: 17 [2021-03-11 14:09:24,687 INFO L133 LiptonReduction]: Total number of compositions: 3 [2021-03-11 14:09:24,689 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 13 places, 8 transitions, 28 flow [2021-03-11 14:09:24,690 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 25 states have internal predecessors, (41), 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-03-11 14:09:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 25 states have internal predecessors, (41), 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-03-11 14:09:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:24,691 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:24,691 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:24,691 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2021-03-11 14:09:24,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:24,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436005393] [2021-03-11 14:09:24,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:24,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:24,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:24,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436005393] [2021-03-11 14:09:24,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:24,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:24,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428572358] [2021-03-11 14:09:24,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:24,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:24,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:24,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:24,704 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 25 states have internal predecessors, (41), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:24,707 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. [2021-03-11 14:09:24,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:24,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:24,708 INFO L225 Difference]: With dead ends: 19 [2021-03-11 14:09:24,709 INFO L226 Difference]: Without dead ends: 12 [2021-03-11 14:09:24,709 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-03-11 14:09:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-03-11 14:09:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-03-11 14:09:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2021-03-11 14:09:24,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 2 [2021-03-11 14:09:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:24,712 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-03-11 14:09:24,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2021-03-11 14:09:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-03-11 14:09:24,712 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:24,712 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-03-11 14:09:24,712 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 14:09:24,713 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:24,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:24,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1674283, now seen corresponding path program 1 times [2021-03-11 14:09:24,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:24,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091691941] [2021-03-11 14:09:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:24,717 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:24,720 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:24,721 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:24,721 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:24,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 14:09:24,721 WARN L342 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:24,722 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-03-11 14:09:24,729 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:24,729 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:24,731 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:24,731 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:24,731 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:24,731 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:24,731 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:24,732 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:24,732 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:24,732 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:24,733 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:24,733 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 14 transitions, 49 flow [2021-03-11 14:09:24,733 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 14 transitions, 49 flow [2021-03-11 14:09:24,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 14 transitions, 49 flow [2021-03-11 14:09:24,738 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-11 14:09:24,738 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:24,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-11 14:09:24,739 INFO L116 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-11 14:09:24,830 INFO L131 LiptonReduction]: Checked pairs total: 33 [2021-03-11 14:09:24,830 INFO L133 LiptonReduction]: Total number of compositions: 4 [2021-03-11 14:09:24,831 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 10 transitions, 41 flow [2021-03-11 14:09:24,835 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54 states, 45 states have (on average 2.422222222222222) internal successors, (109), 53 states have internal predecessors, (109), 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-03-11 14:09:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 45 states have (on average 2.422222222222222) internal successors, (109), 53 states have internal predecessors, (109), 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-03-11 14:09:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:24,836 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:24,836 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:24,837 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:24,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2275, now seen corresponding path program 1 times [2021-03-11 14:09:24,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:24,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487438984] [2021-03-11 14:09:24,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:24,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:24,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:24,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487438984] [2021-03-11 14:09:24,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:24,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:24,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164828138] [2021-03-11 14:09:24,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:24,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:24,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:24,871 INFO L87 Difference]: Start difference. First operand has 54 states, 45 states have (on average 2.422222222222222) internal successors, (109), 53 states have internal predecessors, (109), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:24,885 INFO L93 Difference]: Finished difference Result 39 states and 77 transitions. [2021-03-11 14:09:24,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:24,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:24,887 INFO L225 Difference]: With dead ends: 39 [2021-03-11 14:09:24,887 INFO L226 Difference]: Without dead ends: 24 [2021-03-11 14:09:24,887 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-03-11 14:09:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-03-11 14:09:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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-03-11 14:09:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 45 transitions. [2021-03-11 14:09:24,894 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 45 transitions. Word has length 2 [2021-03-11 14:09:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:24,894 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 45 transitions. [2021-03-11 14:09:24,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 45 transitions. [2021-03-11 14:09:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-03-11 14:09:24,895 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:24,895 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 14:09:24,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 14:09:24,895 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash 68187654, now seen corresponding path program 1 times [2021-03-11 14:09:24,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:24,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142798877] [2021-03-11 14:09:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:24,900 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:24,902 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:24,904 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:24,904 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:24,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 14:09:24,904 WARN L342 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:24,905 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-03-11 14:09:24,922 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:24,923 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:24,927 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:24,927 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:24,928 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:24,928 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:24,928 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:24,928 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:24,929 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:24,929 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:24,931 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:24,932 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 66 flow [2021-03-11 14:09:24,932 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 66 flow [2021-03-11 14:09:24,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 66 flow [2021-03-11 14:09:24,948 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-11 14:09:24,959 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:24,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 91 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2021-03-11 14:09:24,961 INFO L116 LiptonReduction]: Number of co-enabled transitions 136 [2021-03-11 14:09:25,073 INFO L131 LiptonReduction]: Checked pairs total: 54 [2021-03-11 14:09:25,073 INFO L133 LiptonReduction]: Total number of compositions: 5 [2021-03-11 14:09:25,074 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 12 transitions, 56 flow [2021-03-11 14:09:25,081 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 99 states have (on average 2.757575757575758) internal successors, (273), 109 states have internal predecessors, (273), 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-03-11 14:09:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 99 states have (on average 2.757575757575758) internal successors, (273), 109 states have internal predecessors, (273), 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-03-11 14:09:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:25,082 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:25,082 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:25,082 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2021-03-11 14:09:25,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:25,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159547620] [2021-03-11 14:09:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:25,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:25,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:25,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159547620] [2021-03-11 14:09:25,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:25,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:25,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727180884] [2021-03-11 14:09:25,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:25,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:25,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:25,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:25,117 INFO L87 Difference]: Start difference. First operand has 110 states, 99 states have (on average 2.757575757575758) internal successors, (273), 109 states have internal predecessors, (273), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:25,126 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2021-03-11 14:09:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:25,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:25,132 INFO L225 Difference]: With dead ends: 79 [2021-03-11 14:09:25,132 INFO L226 Difference]: Without dead ends: 48 [2021-03-11 14:09:25,132 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-03-11 14:09:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-03-11 14:09:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.404255319148936) internal successors, (113), 47 states have internal predecessors, (113), 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-03-11 14:09:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 113 transitions. [2021-03-11 14:09:25,145 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 113 transitions. Word has length 2 [2021-03-11 14:09:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:25,145 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 113 transitions. [2021-03-11 14:09:25,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 113 transitions. [2021-03-11 14:09:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-03-11 14:09:25,146 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:25,146 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-03-11 14:09:25,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 14:09:25,147 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1557988658, now seen corresponding path program 1 times [2021-03-11 14:09:25,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:25,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645772839] [2021-03-11 14:09:25,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:25,157 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:25,163 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:25,165 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:25,166 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:25,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 14:09:25,166 WARN L342 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:25,167 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-03-11 14:09:25,179 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:25,179 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:25,180 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:25,180 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:25,180 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:25,181 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:25,181 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:25,181 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:25,181 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:25,181 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:25,182 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:25,183 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 85 flow [2021-03-11 14:09:25,184 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 85 flow [2021-03-11 14:09:25,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 85 flow [2021-03-11 14:09:25,197 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-11 14:09:25,197 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:25,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2021-03-11 14:09:25,199 INFO L116 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-11 14:09:25,359 INFO L131 LiptonReduction]: Checked pairs total: 80 [2021-03-11 14:09:25,359 INFO L133 LiptonReduction]: Total number of compositions: 6 [2021-03-11 14:09:25,362 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 14 transitions, 73 flow [2021-03-11 14:09:25,380 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 222 states, 209 states have (on average 3.1435406698564594) internal successors, (657), 221 states have internal predecessors, (657), 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-03-11 14:09:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 209 states have (on average 3.1435406698564594) internal successors, (657), 221 states have internal predecessors, (657), 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-03-11 14:09:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:25,381 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:25,381 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:25,381 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:25,382 INFO L82 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2021-03-11 14:09:25,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:25,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804610345] [2021-03-11 14:09:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:25,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:25,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:25,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804610345] [2021-03-11 14:09:25,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:25,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:25,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973136638] [2021-03-11 14:09:25,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:25,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:25,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:25,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:25,401 INFO L87 Difference]: Start difference. First operand has 222 states, 209 states have (on average 3.1435406698564594) internal successors, (657), 221 states have internal predecessors, (657), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:25,418 INFO L93 Difference]: Finished difference Result 159 states and 465 transitions. [2021-03-11 14:09:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:25,425 INFO L225 Difference]: With dead ends: 159 [2021-03-11 14:09:25,425 INFO L226 Difference]: Without dead ends: 96 [2021-03-11 14:09:25,426 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-03-11 14:09:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-03-11 14:09:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.873684210526316) internal successors, (273), 95 states have internal predecessors, (273), 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-03-11 14:09:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 273 transitions. [2021-03-11 14:09:25,437 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 273 transitions. Word has length 2 [2021-03-11 14:09:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:25,437 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 273 transitions. [2021-03-11 14:09:25,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 273 transitions. [2021-03-11 14:09:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-03-11 14:09:25,438 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:25,438 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:09:25,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 14:09:25,439 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:25,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:25,439 INFO L82 PathProgramCache]: Analyzing trace with hash 458500947, now seen corresponding path program 1 times [2021-03-11 14:09:25,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:25,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944057487] [2021-03-11 14:09:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:25,444 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:25,446 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:25,447 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:25,447 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:25,447 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 14:09:25,448 WARN L342 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:25,448 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2021-03-11 14:09:25,456 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:25,457 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:25,457 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:25,457 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:25,457 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:25,458 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:25,458 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:25,458 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:25,458 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:25,458 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:25,459 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:25,459 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 106 flow [2021-03-11 14:09:25,459 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 106 flow [2021-03-11 14:09:25,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 106 flow [2021-03-11 14:09:25,465 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-11 14:09:25,465 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:25,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2021-03-11 14:09:25,466 INFO L116 LiptonReduction]: Number of co-enabled transitions 276 [2021-03-11 14:09:25,648 INFO L131 LiptonReduction]: Checked pairs total: 111 [2021-03-11 14:09:25,648 INFO L133 LiptonReduction]: Total number of compositions: 7 [2021-03-11 14:09:25,651 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 16 transitions, 92 flow [2021-03-11 14:09:25,670 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 446 states, 431 states have (on average 3.566125290023202) internal successors, (1537), 445 states have internal predecessors, (1537), 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-03-11 14:09:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 446 states, 431 states have (on average 3.566125290023202) internal successors, (1537), 445 states have internal predecessors, (1537), 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-03-11 14:09:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:25,671 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:25,671 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:25,672 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:25,672 INFO L82 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 1 times [2021-03-11 14:09:25,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:25,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136043067] [2021-03-11 14:09:25,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:25,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:25,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:25,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136043067] [2021-03-11 14:09:25,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:25,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:25,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164964991] [2021-03-11 14:09:25,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:25,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:25,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:25,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:25,686 INFO L87 Difference]: Start difference. First operand has 446 states, 431 states have (on average 3.566125290023202) internal successors, (1537), 445 states have internal predecessors, (1537), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:25,700 INFO L93 Difference]: Finished difference Result 319 states and 1089 transitions. [2021-03-11 14:09:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:25,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:25,707 INFO L225 Difference]: With dead ends: 319 [2021-03-11 14:09:25,708 INFO L226 Difference]: Without dead ends: 192 [2021-03-11 14:09:25,708 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:25,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-03-11 14:09:25,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-03-11 14:09:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 3.356020942408377) internal successors, (641), 191 states have internal predecessors, (641), 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-03-11 14:09:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 641 transitions. [2021-03-11 14:09:25,733 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 641 transitions. Word has length 2 [2021-03-11 14:09:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:25,733 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 641 transitions. [2021-03-11 14:09:25,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 641 transitions. [2021-03-11 14:09:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-03-11 14:09:25,734 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:25,734 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:09:25,734 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 14:09:25,734 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:25,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1304549903, now seen corresponding path program 1 times [2021-03-11 14:09:25,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:25,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735406505] [2021-03-11 14:09:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:25,741 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:25,743 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:25,744 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:25,744 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:25,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 14:09:25,745 WARN L342 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:25,745 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2021-03-11 14:09:25,757 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:25,758 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:25,758 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:25,758 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:25,758 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:25,758 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:25,758 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:25,759 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:25,759 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:25,759 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:25,762 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:25,762 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 129 flow [2021-03-11 14:09:25,762 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 129 flow [2021-03-11 14:09:25,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 26 transitions, 129 flow [2021-03-11 14:09:25,775 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-11 14:09:25,776 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:25,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 166 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-03-11 14:09:25,777 INFO L116 LiptonReduction]: Number of co-enabled transitions 364 [2021-03-11 14:09:25,923 INFO L131 LiptonReduction]: Checked pairs total: 147 [2021-03-11 14:09:25,924 INFO L133 LiptonReduction]: Total number of compositions: 8 [2021-03-11 14:09:25,925 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 18 transitions, 113 flow [2021-03-11 14:09:25,970 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 894 states, 877 states have (on average 4.014823261117446) internal successors, (3521), 893 states have internal predecessors, (3521), 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-03-11 14:09:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 894 states, 877 states have (on average 4.014823261117446) internal successors, (3521), 893 states have internal predecessors, (3521), 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-03-11 14:09:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:25,972 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:25,972 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:25,974 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:25,978 INFO L82 PathProgramCache]: Analyzing trace with hash 5731, now seen corresponding path program 1 times [2021-03-11 14:09:25,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:25,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805652183] [2021-03-11 14:09:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:25,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:25,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:25,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805652183] [2021-03-11 14:09:25,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:25,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:25,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503451901] [2021-03-11 14:09:25,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:25,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:25,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:26,001 INFO L87 Difference]: Start difference. First operand has 894 states, 877 states have (on average 4.014823261117446) internal successors, (3521), 893 states have internal predecessors, (3521), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:26,015 INFO L93 Difference]: Finished difference Result 639 states and 2497 transitions. [2021-03-11 14:09:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:26,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:26,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:26,024 INFO L225 Difference]: With dead ends: 639 [2021-03-11 14:09:26,024 INFO L226 Difference]: Without dead ends: 384 [2021-03-11 14:09:26,025 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-03-11 14:09:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2021-03-11 14:09:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.845953002610966) internal successors, (1473), 383 states have internal predecessors, (1473), 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-03-11 14:09:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1473 transitions. [2021-03-11 14:09:26,057 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1473 transitions. Word has length 2 [2021-03-11 14:09:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:26,057 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 1473 transitions. [2021-03-11 14:09:26,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1473 transitions. [2021-03-11 14:09:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-03-11 14:09:26,060 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:26,060 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:09:26,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 14:09:26,060 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:26,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1599302192, now seen corresponding path program 1 times [2021-03-11 14:09:26,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:26,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140637226] [2021-03-11 14:09:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:26,072 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:26,086 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:26,088 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:26,088 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:26,088 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 14:09:26,088 WARN L342 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:26,089 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2021-03-11 14:09:26,102 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:26,102 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:26,106 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:26,106 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:26,106 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:26,106 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:26,106 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:26,107 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:26,107 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:26,107 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:26,110 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:26,111 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 29 transitions, 154 flow [2021-03-11 14:09:26,111 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 29 transitions, 154 flow [2021-03-11 14:09:26,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 29 transitions, 154 flow [2021-03-11 14:09:26,117 INFO L129 PetriNetUnfolder]: 0/53 cut-off events. [2021-03-11 14:09:26,117 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:26,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 53 events. 0/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 185 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2021-03-11 14:09:26,123 INFO L116 LiptonReduction]: Number of co-enabled transitions 464 [2021-03-11 14:09:26,279 INFO L131 LiptonReduction]: Checked pairs total: 188 [2021-03-11 14:09:26,279 INFO L133 LiptonReduction]: Total number of compositions: 9 [2021-03-11 14:09:26,280 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 20 transitions, 136 flow [2021-03-11 14:09:26,364 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1790 states, 1771 states have (on average 4.481648785996612) internal successors, (7937), 1789 states have internal predecessors, (7937), 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-03-11 14:09:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 1790 states, 1771 states have (on average 4.481648785996612) internal successors, (7937), 1789 states have internal predecessors, (7937), 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-03-11 14:09:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:26,371 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:26,371 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:26,371 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:26,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash 6915, now seen corresponding path program 1 times [2021-03-11 14:09:26,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:26,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828672633] [2021-03-11 14:09:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:26,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:26,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:26,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828672633] [2021-03-11 14:09:26,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:26,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:26,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367531897] [2021-03-11 14:09:26,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:26,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:26,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:26,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:26,387 INFO L87 Difference]: Start difference. First operand has 1790 states, 1771 states have (on average 4.481648785996612) internal successors, (7937), 1789 states have internal predecessors, (7937), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:26,405 INFO L93 Difference]: Finished difference Result 1279 states and 5633 transitions. [2021-03-11 14:09:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:26,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:26,413 INFO L225 Difference]: With dead ends: 1279 [2021-03-11 14:09:26,413 INFO L226 Difference]: Without dead ends: 768 [2021-03-11 14:09:26,413 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-03-11 14:09:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2021-03-11 14:09:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 4.340286831812255) internal successors, (3329), 767 states have internal predecessors, (3329), 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-03-11 14:09:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 3329 transitions. [2021-03-11 14:09:26,452 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 3329 transitions. Word has length 2 [2021-03-11 14:09:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:26,452 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 3329 transitions. [2021-03-11 14:09:26,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 3329 transitions. [2021-03-11 14:09:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-03-11 14:09:26,453 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:26,453 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:09:26,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 14:09:26,454 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1756765292, now seen corresponding path program 1 times [2021-03-11 14:09:26,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:26,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252489175] [2021-03-11 14:09:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:26,458 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:26,461 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:26,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:26,462 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:26,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 14:09:26,463 WARN L342 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:26,463 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2021-03-11 14:09:26,472 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:26,473 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:26,473 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:26,474 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:26,474 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:26,474 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:26,474 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:26,474 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:26,474 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:26,474 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:26,475 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:26,475 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 32 transitions, 181 flow [2021-03-11 14:09:26,475 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 32 transitions, 181 flow [2021-03-11 14:09:26,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 32 transitions, 181 flow [2021-03-11 14:09:26,481 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2021-03-11 14:09:26,481 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:26,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 59 events. 0/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 216 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2021-03-11 14:09:26,483 INFO L116 LiptonReduction]: Number of co-enabled transitions 576 [2021-03-11 14:09:26,668 INFO L131 LiptonReduction]: Checked pairs total: 234 [2021-03-11 14:09:26,669 INFO L133 LiptonReduction]: Total number of compositions: 10 [2021-03-11 14:09:26,671 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 22 transitions, 161 flow [2021-03-11 14:09:26,863 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3582 states, 3561 states have (on average 4.960685200786296) internal successors, (17665), 3581 states have internal predecessors, (17665), 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-03-11 14:09:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 3582 states, 3561 states have (on average 4.960685200786296) internal successors, (17665), 3581 states have internal predecessors, (17665), 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-03-11 14:09:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:26,873 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:26,873 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:26,873 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash 8227, now seen corresponding path program 1 times [2021-03-11 14:09:26,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:26,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169540260] [2021-03-11 14:09:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:26,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:26,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:26,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169540260] [2021-03-11 14:09:26,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:26,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:26,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720801080] [2021-03-11 14:09:26,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:26,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:26,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:26,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:26,895 INFO L87 Difference]: Start difference. First operand has 3582 states, 3561 states have (on average 4.960685200786296) internal successors, (17665), 3581 states have internal predecessors, (17665), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:26,930 INFO L93 Difference]: Finished difference Result 2559 states and 12545 transitions. [2021-03-11 14:09:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:26,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:26,944 INFO L225 Difference]: With dead ends: 2559 [2021-03-11 14:09:26,944 INFO L226 Difference]: Without dead ends: 1536 [2021-03-11 14:09:26,945 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2021-03-11 14:09:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1536. [2021-03-11 14:09:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 4.837133550488599) internal successors, (7425), 1535 states have internal predecessors, (7425), 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-03-11 14:09:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 7425 transitions. [2021-03-11 14:09:27,084 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 7425 transitions. Word has length 2 [2021-03-11 14:09:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:27,084 INFO L480 AbstractCegarLoop]: Abstraction has 1536 states and 7425 transitions. [2021-03-11 14:09:27,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 7425 transitions. [2021-03-11 14:09:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 14:09:27,086 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:27,086 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:09:27,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 14:09:27,086 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:27,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1145512803, now seen corresponding path program 1 times [2021-03-11 14:09:27,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:27,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757981230] [2021-03-11 14:09:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:27,127 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:27,130 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:27,131 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:27,131 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:27,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-11 14:09:27,132 WARN L342 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:27,132 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2021-03-11 14:09:27,148 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:27,149 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:27,149 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:27,149 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:27,149 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:27,149 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:27,149 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:27,149 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:27,150 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:27,150 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:27,150 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:27,150 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 35 transitions, 210 flow [2021-03-11 14:09:27,151 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 35 transitions, 210 flow [2021-03-11 14:09:27,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 35 transitions, 210 flow [2021-03-11 14:09:27,176 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2021-03-11 14:09:27,176 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:27,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 65 events. 0/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 234 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2021-03-11 14:09:27,177 INFO L116 LiptonReduction]: Number of co-enabled transitions 700 [2021-03-11 14:09:27,425 INFO L131 LiptonReduction]: Checked pairs total: 285 [2021-03-11 14:09:27,425 INFO L133 LiptonReduction]: Total number of compositions: 11 [2021-03-11 14:09:27,425 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 24 transitions, 188 flow [2021-03-11 14:09:27,814 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 7166 states, 7143 states have (on average 5.4477110457790845) internal successors, (38913), 7165 states have internal predecessors, (38913), 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-03-11 14:09:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 7166 states, 7143 states have (on average 5.4477110457790845) internal successors, (38913), 7165 states have internal predecessors, (38913), 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-03-11 14:09:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:27,835 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:27,835 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:27,836 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash 9667, now seen corresponding path program 1 times [2021-03-11 14:09:27,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:27,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345411840] [2021-03-11 14:09:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:27,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:27,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:27,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345411840] [2021-03-11 14:09:27,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:27,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:27,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138240718] [2021-03-11 14:09:27,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:27,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:27,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:27,864 INFO L87 Difference]: Start difference. First operand has 7166 states, 7143 states have (on average 5.4477110457790845) internal successors, (38913), 7165 states have internal predecessors, (38913), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:27,973 INFO L93 Difference]: Finished difference Result 5119 states and 27649 transitions. [2021-03-11 14:09:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:27,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:28,002 INFO L225 Difference]: With dead ends: 5119 [2021-03-11 14:09:28,003 INFO L226 Difference]: Without dead ends: 3072 [2021-03-11 14:09:28,003 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2021-03-11 14:09:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2021-03-11 14:09:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 5.335395636600456) internal successors, (16385), 3071 states have internal predecessors, (16385), 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-03-11 14:09:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 16385 transitions. [2021-03-11 14:09:28,318 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 16385 transitions. Word has length 2 [2021-03-11 14:09:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:28,318 INFO L480 AbstractCegarLoop]: Abstraction has 3072 states and 16385 transitions. [2021-03-11 14:09:28,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 16385 transitions. [2021-03-11 14:09:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 14:09:28,320 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:28,320 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:09:28,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-11 14:09:28,320 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:28,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1725822537, now seen corresponding path program 1 times [2021-03-11 14:09:28,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:28,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122113712] [2021-03-11 14:09:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:28,325 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:28,328 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:28,330 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:28,330 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:28,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-11 14:09:28,330 WARN L342 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:28,330 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2021-03-11 14:09:28,347 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:28,347 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:28,348 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:28,348 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:28,348 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:28,348 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:28,348 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:28,348 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:28,348 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:28,348 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:28,349 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:28,349 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 38 transitions, 241 flow [2021-03-11 14:09:28,349 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 38 transitions, 241 flow [2021-03-11 14:09:28,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 38 transitions, 241 flow [2021-03-11 14:09:28,356 INFO L129 PetriNetUnfolder]: 0/71 cut-off events. [2021-03-11 14:09:28,356 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:28,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 71 events. 0/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 257 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2021-03-11 14:09:28,357 INFO L116 LiptonReduction]: Number of co-enabled transitions 836 [2021-03-11 14:09:28,678 INFO L131 LiptonReduction]: Checked pairs total: 341 [2021-03-11 14:09:28,678 INFO L133 LiptonReduction]: Total number of compositions: 12 [2021-03-11 14:09:28,679 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 26 transitions, 217 flow [2021-03-11 14:09:29,713 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14334 states, 14309 states have (on average 5.939828080229226) internal successors, (84993), 14333 states have internal predecessors, (84993), 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-03-11 14:09:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 14334 states, 14309 states have (on average 5.939828080229226) internal successors, (84993), 14333 states have internal predecessors, (84993), 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-03-11 14:09:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:29,753 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:29,753 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:29,753 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:29,753 INFO L82 PathProgramCache]: Analyzing trace with hash 11235, now seen corresponding path program 1 times [2021-03-11 14:09:29,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:29,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025103276] [2021-03-11 14:09:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:29,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:29,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:29,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025103276] [2021-03-11 14:09:29,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:29,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:29,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811378065] [2021-03-11 14:09:29,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:29,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:29,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:29,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:29,814 INFO L87 Difference]: Start difference. First operand has 14334 states, 14309 states have (on average 5.939828080229226) internal successors, (84993), 14333 states have internal predecessors, (84993), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:29,921 INFO L93 Difference]: Finished difference Result 10239 states and 60417 transitions. [2021-03-11 14:09:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:29,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:29,977 INFO L225 Difference]: With dead ends: 10239 [2021-03-11 14:09:29,977 INFO L226 Difference]: Without dead ends: 6144 [2021-03-11 14:09:29,977 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6144 states. [2021-03-11 14:09:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6144 to 6144. [2021-03-11 14:09:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6144 states, 6143 states have (on average 5.834445710564871) internal successors, (35841), 6143 states have internal predecessors, (35841), 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-03-11 14:09:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6144 states to 6144 states and 35841 transitions. [2021-03-11 14:09:30,771 INFO L78 Accepts]: Start accepts. Automaton has 6144 states and 35841 transitions. Word has length 2 [2021-03-11 14:09:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:30,771 INFO L480 AbstractCegarLoop]: Abstraction has 6144 states and 35841 transitions. [2021-03-11 14:09:30,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6144 states and 35841 transitions. [2021-03-11 14:09:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 14:09:30,776 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:30,776 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:09:30,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-11 14:09:30,776 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash 772943002, now seen corresponding path program 1 times [2021-03-11 14:09:30,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:30,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560968427] [2021-03-11 14:09:30,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:30,783 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:30,788 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:30,791 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:30,791 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:30,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-11 14:09:30,792 WARN L342 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:30,793 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2021-03-11 14:09:30,806 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:30,806 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:30,808 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:30,808 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:30,808 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:30,808 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:30,808 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:30,808 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:30,808 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:30,808 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:30,809 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:30,809 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 41 transitions, 274 flow [2021-03-11 14:09:30,809 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 41 transitions, 274 flow [2021-03-11 14:09:30,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 41 transitions, 274 flow [2021-03-11 14:09:30,820 INFO L129 PetriNetUnfolder]: 0/77 cut-off events. [2021-03-11 14:09:30,820 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:30,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 77 events. 0/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 295 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 0. Up to 13 conditions per place. [2021-03-11 14:09:30,821 INFO L116 LiptonReduction]: Number of co-enabled transitions 984 [2021-03-11 14:09:31,182 INFO L131 LiptonReduction]: Checked pairs total: 402 [2021-03-11 14:09:31,182 INFO L133 LiptonReduction]: Total number of compositions: 13 [2021-03-11 14:09:31,182 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 28 transitions, 248 flow [2021-03-11 14:09:34,526 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 28670 states, 28643 states have (on average 6.435115036832734) internal successors, (184321), 28669 states have internal predecessors, (184321), 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-03-11 14:09:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 28670 states, 28643 states have (on average 6.435115036832734) internal successors, (184321), 28669 states have internal predecessors, (184321), 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-03-11 14:09:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:34,566 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:34,566 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:34,567 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:34,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash 12931, now seen corresponding path program 1 times [2021-03-11 14:09:34,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:34,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680252112] [2021-03-11 14:09:34,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:34,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:34,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:34,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680252112] [2021-03-11 14:09:34,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:34,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:34,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179337267] [2021-03-11 14:09:34,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:34,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:34,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:34,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:34,632 INFO L87 Difference]: Start difference. First operand has 28670 states, 28643 states have (on average 6.435115036832734) internal successors, (184321), 28669 states have internal predecessors, (184321), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:34,795 INFO L93 Difference]: Finished difference Result 20479 states and 131073 transitions. [2021-03-11 14:09:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:34,881 INFO L225 Difference]: With dead ends: 20479 [2021-03-11 14:09:34,881 INFO L226 Difference]: Without dead ends: 12288 [2021-03-11 14:09:34,882 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12288 states. [2021-03-11 14:09:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12288 to 12288. [2021-03-11 14:09:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12288 states, 12287 states have (on average 6.333930170098478) internal successors, (77825), 12287 states have internal predecessors, (77825), 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-03-11 14:09:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12288 states to 12288 states and 77825 transitions. [2021-03-11 14:09:37,253 INFO L78 Accepts]: Start accepts. Automaton has 12288 states and 77825 transitions. Word has length 2 [2021-03-11 14:09:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:37,253 INFO L480 AbstractCegarLoop]: Abstraction has 12288 states and 77825 transitions. [2021-03-11 14:09:37,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12288 states and 77825 transitions. [2021-03-11 14:09:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-03-11 14:09:37,259 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:37,259 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:09:37,259 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-11 14:09:37,259 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:37,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:37,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1612747174, now seen corresponding path program 1 times [2021-03-11 14:09:37,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:37,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543479299] [2021-03-11 14:09:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:37,264 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:37,266 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:37,268 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:37,268 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:37,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-11 14:09:37,268 WARN L342 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:37,269 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2021-03-11 14:09:37,281 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:37,281 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:37,282 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:37,282 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:37,282 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:37,282 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:37,282 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:37,282 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:37,282 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:37,282 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:37,283 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:37,283 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 44 transitions, 309 flow [2021-03-11 14:09:37,283 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 44 transitions, 309 flow [2021-03-11 14:09:37,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 44 transitions, 309 flow [2021-03-11 14:09:37,288 INFO L129 PetriNetUnfolder]: 0/83 cut-off events. [2021-03-11 14:09:37,289 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:37,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 83 events. 0/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 304 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2021-03-11 14:09:37,290 INFO L116 LiptonReduction]: Number of co-enabled transitions 1144 [2021-03-11 14:09:37,575 INFO L131 LiptonReduction]: Checked pairs total: 468 [2021-03-11 14:09:37,576 INFO L133 LiptonReduction]: Total number of compositions: 14 [2021-03-11 14:09:37,577 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 30 transitions, 281 flow [2021-03-11 14:09:49,907 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 57342 states, 57313 states have (on average 6.932336468166036) internal successors, (397313), 57341 states have internal predecessors, (397313), 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-03-11 14:09:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 57342 states, 57313 states have (on average 6.932336468166036) internal successors, (397313), 57341 states have internal predecessors, (397313), 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-03-11 14:09:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:09:49,998 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:49,998 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:09:49,998 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash 14755, now seen corresponding path program 1 times [2021-03-11 14:09:49,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:49,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342539109] [2021-03-11 14:09:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:09:50,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:09:50,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:09:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:09:50,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342539109] [2021-03-11 14:09:50,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:09:50,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:09:50,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107455195] [2021-03-11 14:09:50,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:09:50,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:09:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:09:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:50,105 INFO L87 Difference]: Start difference. First operand has 57342 states, 57313 states have (on average 6.932336468166036) internal successors, (397313), 57341 states have internal predecessors, (397313), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:09:50,656 INFO L93 Difference]: Finished difference Result 40959 states and 282625 transitions. [2021-03-11 14:09:50,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:09:50,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:09:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:09:50,826 INFO L225 Difference]: With dead ends: 40959 [2021-03-11 14:09:50,827 INFO L226 Difference]: Without dead ends: 24576 [2021-03-11 14:09:50,827 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:09:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24576 states. [2021-03-11 14:09:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24576 to 24576. [2021-03-11 14:09:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24576 states, 24575 states have (on average 6.833652085452695) internal successors, (167937), 24575 states have internal predecessors, (167937), 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-03-11 14:09:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24576 states to 24576 states and 167937 transitions. [2021-03-11 14:09:57,538 INFO L78 Accepts]: Start accepts. Automaton has 24576 states and 167937 transitions. Word has length 2 [2021-03-11 14:09:57,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:09:57,538 INFO L480 AbstractCegarLoop]: Abstraction has 24576 states and 167937 transitions. [2021-03-11 14:09:57,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:09:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 24576 states and 167937 transitions. [2021-03-11 14:09:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 14:09:57,544 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:09:57,544 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:09:57,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-11 14:09:57,544 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:09:57,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:09:57,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2106590247, now seen corresponding path program 1 times [2021-03-11 14:09:57,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:09:57,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570541335] [2021-03-11 14:09:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:09:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:57,548 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:09:57,551 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:09:57,552 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:09:57,552 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:09:57,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-11 14:09:57,553 WARN L342 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:09:57,553 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2021-03-11 14:09:57,566 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:09:57,566 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:09:57,567 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:09:57,567 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:09:57,567 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:09:57,567 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:09:57,567 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:09:57,567 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:09:57,567 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:09:57,567 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:09:57,568 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:09:57,568 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 47 transitions, 346 flow [2021-03-11 14:09:57,568 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 47 transitions, 346 flow [2021-03-11 14:09:57,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 47 transitions, 346 flow [2021-03-11 14:09:57,574 INFO L129 PetriNetUnfolder]: 0/89 cut-off events. [2021-03-11 14:09:57,574 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:09:57,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 89 events. 0/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 346 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. [2021-03-11 14:09:57,576 INFO L116 LiptonReduction]: Number of co-enabled transitions 1316 [2021-03-11 14:09:57,924 INFO L131 LiptonReduction]: Checked pairs total: 539 [2021-03-11 14:09:57,924 INFO L133 LiptonReduction]: Total number of compositions: 15 [2021-03-11 14:09:57,925 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 32 transitions, 316 flow [2021-03-11 14:10:48,699 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 114686 states, 114655 states have (on average 7.430718241681566) internal successors, (851969), 114685 states have internal predecessors, (851969), 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-03-11 14:10:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 114686 states, 114655 states have (on average 7.430718241681566) internal successors, (851969), 114685 states have internal predecessors, (851969), 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-03-11 14:10:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:10:48,891 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:10:48,891 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:10:48,891 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:10:48,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:10:48,892 INFO L82 PathProgramCache]: Analyzing trace with hash 16707, now seen corresponding path program 1 times [2021-03-11 14:10:48,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:10:48,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521190706] [2021-03-11 14:10:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:10:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:10:48,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:10:48,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:10:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:10:48,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521190706] [2021-03-11 14:10:48,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:10:48,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:10:48,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730510329] [2021-03-11 14:10:48,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:10:48,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:10:48,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:10:48,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:10:49,078 INFO L87 Difference]: Start difference. First operand has 114686 states, 114655 states have (on average 7.430718241681566) internal successors, (851969), 114685 states have internal predecessors, (851969), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:10:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:10:50,282 INFO L93 Difference]: Finished difference Result 81919 states and 606209 transitions. [2021-03-11 14:10:50,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:10:50,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:10:50,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:10:50,822 INFO L225 Difference]: With dead ends: 81919 [2021-03-11 14:10:50,822 INFO L226 Difference]: Without dead ends: 49152 [2021-03-11 14:10:50,822 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:11:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49152 states. [2021-03-11 14:11:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49152 to 49152. [2021-03-11 14:11:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49152 states, 49151 states have (on average 7.333502878883441) internal successors, (360449), 49151 states have internal predecessors, (360449), 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-03-11 14:11:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49152 states to 49152 states and 360449 transitions. [2021-03-11 14:11:15,294 INFO L78 Accepts]: Start accepts. Automaton has 49152 states and 360449 transitions. Word has length 2 [2021-03-11 14:11:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:11:15,294 INFO L480 AbstractCegarLoop]: Abstraction has 49152 states and 360449 transitions. [2021-03-11 14:11:15,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:11:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 49152 states and 360449 transitions. [2021-03-11 14:11:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 14:11:15,337 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:11:15,337 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:11:15,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-11 14:11:15,337 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:11:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:11:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2129139843, now seen corresponding path program 1 times [2021-03-11 14:11:15,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:11:15,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621006684] [2021-03-11 14:11:15,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:11:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:11:15,372 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:11:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:11:15,374 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:11:15,376 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:11:15,376 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:11:15,376 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-11 14:11:15,376 WARN L342 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:11:15,376 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2021-03-11 14:11:15,409 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:11:15,409 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:11:15,410 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:11:15,410 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:11:15,410 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:11:15,410 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:11:15,410 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:11:15,410 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:11:15,410 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:11:15,410 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:11:15,411 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:11:15,412 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 50 transitions, 385 flow [2021-03-11 14:11:15,412 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 50 transitions, 385 flow [2021-03-11 14:11:15,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 50 transitions, 385 flow [2021-03-11 14:11:15,418 INFO L129 PetriNetUnfolder]: 0/95 cut-off events. [2021-03-11 14:11:15,418 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:11:15,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 95 events. 0/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 301 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 0. Up to 16 conditions per place. [2021-03-11 14:11:15,421 INFO L116 LiptonReduction]: Number of co-enabled transitions 1500 [2021-03-11 14:11:15,837 INFO L131 LiptonReduction]: Checked pairs total: 615 [2021-03-11 14:11:15,837 INFO L133 LiptonReduction]: Total number of compositions: 16 [2021-03-11 14:11:15,839 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 34 transitions, 353 flow [2021-03-11 14:15:45,891 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 229374 states, 229341 states have (on average 7.929785777510345) internal successors, (1818625), 229373 states have internal predecessors, (1818625), 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-03-11 14:15:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 229374 states, 229341 states have (on average 7.929785777510345) internal successors, (1818625), 229373 states have internal predecessors, (1818625), 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-03-11 14:15:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:15:46,390 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:15:46,390 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:15:46,390 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:15:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:15:46,390 INFO L82 PathProgramCache]: Analyzing trace with hash 18787, now seen corresponding path program 1 times [2021-03-11 14:15:46,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:15:46,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325656273] [2021-03-11 14:15:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:15:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:15:46,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:15:46,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:15:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:15:46,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325656273] [2021-03-11 14:15:46,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:15:46,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:15:46,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486817874] [2021-03-11 14:15:46,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:15:46,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:15:46,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:15:46,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:15:46,731 INFO L87 Difference]: Start difference. First operand has 229374 states, 229341 states have (on average 7.929785777510345) internal successors, (1818625), 229373 states have internal predecessors, (1818625), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:15:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:15:49,783 INFO L93 Difference]: Finished difference Result 163839 states and 1294337 transitions. [2021-03-11 14:15:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:15:49,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-03-11 14:15:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:15:51,064 INFO L225 Difference]: With dead ends: 163839 [2021-03-11 14:15:51,064 INFO L226 Difference]: Without dead ends: 98304 [2021-03-11 14:15:51,065 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:17:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98304 states. [2021-03-11 14:17:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98304 to 98304. [2021-03-11 14:17:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98304 states, 98303 states have (on average 7.833423191560787) internal successors, (770049), 98303 states have internal predecessors, (770049), 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-03-11 14:17:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98304 states to 98304 states and 770049 transitions. [2021-03-11 14:17:24,253 INFO L78 Accepts]: Start accepts. Automaton has 98304 states and 770049 transitions. Word has length 2 [2021-03-11 14:17:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:17:24,253 INFO L480 AbstractCegarLoop]: Abstraction has 98304 states and 770049 transitions. [2021-03-11 14:17:24,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-11 14:17:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 98304 states and 770049 transitions. [2021-03-11 14:17:24,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 14:17:24,273 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:17:24,273 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:17:24,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-11 14:17:24,273 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:17:24,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:17:24,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1791364420, now seen corresponding path program 1 times [2021-03-11 14:17:24,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:17:24,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472013153] [2021-03-11 14:17:24,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:17:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:17:24,280 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:17:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:17:24,282 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:17:24,284 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:17:24,284 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:17:24,284 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-11 14:17:24,285 WARN L342 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:17:24,285 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2021-03-11 14:17:24,311 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:17:24,311 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:17:24,312 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:17:24,312 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:17:24,312 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:17:24,313 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:17:24,313 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:17:24,313 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:17:24,313 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:17:24,313 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:17:24,314 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:17:24,314 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 53 transitions, 426 flow [2021-03-11 14:17:24,314 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 53 transitions, 426 flow [2021-03-11 14:17:24,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 53 transitions, 426 flow [2021-03-11 14:17:24,321 INFO L129 PetriNetUnfolder]: 0/101 cut-off events. [2021-03-11 14:17:24,322 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:17:24,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 101 events. 0/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 328 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 0. Up to 17 conditions per place. [2021-03-11 14:17:24,324 INFO L116 LiptonReduction]: Number of co-enabled transitions 1696 [2021-03-11 14:17:24,792 INFO L131 LiptonReduction]: Checked pairs total: 696 [2021-03-11 14:17:24,792 INFO L133 LiptonReduction]: Total number of compositions: 17 [2021-03-11 14:17:24,795 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 36 transitions, 392 flow Received shutdown request... [2021-03-11 14:23:29,780 WARN L545 AbstractCegarLoop]: Verification canceled [2021-03-11 14:23:29,782 WARN L224 ceAbstractionStarter]: Timeout [2021-03-11 14:23:29,783 INFO L202 PluginConnector]: Adding new model fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 02:23:29 BasicIcfg [2021-03-11 14:23:29,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 14:23:29,784 INFO L168 Benchmark]: Toolchain (without parser) took 845681.23 ms. Allocated memory was 255.9 MB in the beginning and 9.6 GB in the end (delta: 9.3 GB). Free memory was 236.6 MB in the beginning and 7.1 GB in the end (delta: -6.9 GB). Peak memory consumption was 5.7 GB. Max. memory is 16.0 GB. [2021-03-11 14:23:29,784 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 14:23:29,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.64 ms. Allocated memory is still 255.9 MB. Free memory was 236.1 MB in the beginning and 234.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 14:23:29,784 INFO L168 Benchmark]: Boogie Preprocessor took 11.97 ms. Allocated memory is still 255.9 MB. Free memory was 234.6 MB in the beginning and 233.7 MB in the end (delta: 871.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 14:23:29,784 INFO L168 Benchmark]: RCFGBuilder took 173.63 ms. Allocated memory is still 255.9 MB. Free memory was 233.6 MB in the beginning and 240.6 MB in the end (delta: -7.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.0 GB. [2021-03-11 14:23:29,785 INFO L168 Benchmark]: TraceAbstraction took 845464.85 ms. Allocated memory was 255.9 MB in the beginning and 9.6 GB in the end (delta: 9.3 GB). Free memory was 240.0 MB in the beginning and 7.1 GB in the end (delta: -6.9 GB). Peak memory consumption was 5.7 GB. Max. memory is 16.0 GB. [2021-03-11 14:23:29,786 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 21.64 ms. Allocated memory is still 255.9 MB. Free memory was 236.1 MB in the beginning and 234.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 11.97 ms. Allocated memory is still 255.9 MB. Free memory was 234.6 MB in the beginning and 233.7 MB in the end (delta: 871.7 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 173.63 ms. Allocated memory is still 255.9 MB. Free memory was 233.6 MB in the beginning and 240.6 MB in the end (delta: -7.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 845464.85 ms. Allocated memory was 255.9 MB in the beginning and 9.6 GB in the end (delta: 9.3 GB). Free memory was 240.0 MB in the beginning and 7.1 GB in the end (delta: -6.9 GB). Peak memory consumption was 5.7 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.3ms, 11 PlacesBefore, 9 PlacesAfterwards, 8 TransitionsBefore, 6 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.3ms, 16 PlacesBefore, 13 PlacesAfterwards, 11 TransitionsBefore, 8 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 17 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.8ms, 21 PlacesBefore, 17 PlacesAfterwards, 14 TransitionsBefore, 10 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 33 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 33, positive conditional: 0, positive unconditional: 33, 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: 33, positive: 33, positive conditional: 0, positive unconditional: 33, 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: 33, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 33, unknown conditional: 0, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 140.9ms, 26 PlacesBefore, 21 PlacesAfterwards, 17 TransitionsBefore, 12 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 54 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 54, positive conditional: 0, positive unconditional: 54, 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: 54, positive: 54, positive conditional: 0, positive unconditional: 54, 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: 54, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 54, unknown conditional: 0, unknown unconditional: 54] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 175.9ms, 31 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 14 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 80 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 80, positive conditional: 0, positive unconditional: 80, 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: 80, positive: 80, positive conditional: 0, positive unconditional: 80, 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: 80, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 80, unknown conditional: 0, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 189.1ms, 36 PlacesBefore, 29 PlacesAfterwards, 23 TransitionsBefore, 16 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 111 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 111, positive conditional: 0, positive unconditional: 111, 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: 111, positive: 111, positive conditional: 0, positive unconditional: 111, 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: 111, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 111, unknown conditional: 0, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 161.3ms, 41 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 18 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 147 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 147, positive: 147, positive conditional: 0, positive unconditional: 147, 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: 147, positive: 147, positive conditional: 0, positive unconditional: 147, 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: 147, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 147, unknown conditional: 0, unknown unconditional: 147] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 168.4ms, 46 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 20 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 188, positive: 188, positive conditional: 0, positive unconditional: 188, 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: 188, positive: 188, positive conditional: 0, positive unconditional: 188, 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: 188, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 188, unknown conditional: 0, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 193.7ms, 51 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 22 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 234, positive: 234, positive conditional: 0, positive unconditional: 234, 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: 234, positive: 234, positive conditional: 0, positive unconditional: 234, 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: 234, positive: 162, positive conditional: 0, positive unconditional: 162, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, positive: 133, positive conditional: 0, positive unconditional: 133, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 234, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 234, unknown conditional: 0, unknown unconditional: 234] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 274.3ms, 56 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 285 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 285, positive: 285, positive conditional: 0, positive unconditional: 285, 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: 285, positive: 285, positive conditional: 0, positive unconditional: 285, 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: 285, positive: 195, positive conditional: 0, positive unconditional: 195, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 285, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 285, unknown conditional: 0, unknown unconditional: 285] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 329.1ms, 61 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 26 TransitionsAfterwards, 836 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 341 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 341, positive: 341, positive conditional: 0, positive unconditional: 341, 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: 341, positive: 341, positive conditional: 0, positive unconditional: 341, 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: 341, positive: 231, positive conditional: 0, positive unconditional: 231, negative: 110, negative conditional: 0, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 110, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 249, positive: 249, positive conditional: 0, positive unconditional: 249, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 341, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 341, unknown conditional: 0, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 372.6ms, 66 PlacesBefore, 53 PlacesAfterwards, 41 TransitionsBefore, 28 TransitionsAfterwards, 984 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 402 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 402, positive: 402, positive conditional: 0, positive unconditional: 402, 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: 402, positive: 402, positive conditional: 0, positive unconditional: 402, 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: 402, positive: 270, positive conditional: 0, positive unconditional: 270, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 132, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 288, positive: 288, positive conditional: 0, positive unconditional: 288, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 402, unknown conditional: 0, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 292.8ms, 71 PlacesBefore, 57 PlacesAfterwards, 44 TransitionsBefore, 30 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 468 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 468, positive: 468, positive conditional: 0, positive unconditional: 468, 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: 468, positive: 468, positive conditional: 0, positive unconditional: 468, 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: 468, positive: 312, positive conditional: 0, positive unconditional: 312, negative: 156, negative conditional: 0, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 156, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, positive: 217, positive conditional: 0, positive unconditional: 217, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 468, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 468, unknown conditional: 0, unknown unconditional: 468] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 356.6ms, 76 PlacesBefore, 61 PlacesAfterwards, 47 TransitionsBefore, 32 TransitionsAfterwards, 1316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 539 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 539, positive: 539, positive conditional: 0, positive unconditional: 539, 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: 539, positive: 539, positive conditional: 0, positive unconditional: 539, 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: 539, positive: 357, positive conditional: 0, positive unconditional: 357, negative: 182, negative conditional: 0, negative unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 273, positive: 273, positive conditional: 0, positive unconditional: 273, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 539, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 539, unknown conditional: 0, unknown unconditional: 539] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 425.3ms, 81 PlacesBefore, 65 PlacesAfterwards, 50 TransitionsBefore, 34 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 615 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 615, positive: 615, positive conditional: 0, positive unconditional: 615, 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: 615, positive: 615, positive conditional: 0, positive unconditional: 615, 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: 615, positive: 405, positive conditional: 0, positive unconditional: 405, negative: 210, negative conditional: 0, negative unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 210, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 327, positive: 327, positive conditional: 0, positive unconditional: 327, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 615, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 615, unknown conditional: 0, unknown unconditional: 615] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 477.9ms, 86 PlacesBefore, 69 PlacesAfterwards, 53 TransitionsBefore, 36 TransitionsAfterwards, 1696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 696 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 696, positive: 696, positive conditional: 0, positive unconditional: 696, 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: 696, positive: 696, positive conditional: 0, positive unconditional: 696, 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: 696, positive: 456, positive conditional: 0, positive unconditional: 456, negative: 240, negative conditional: 0, negative unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 240, positive: 240, positive conditional: 0, positive unconditional: 240, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 368, positive: 368, positive conditional: 0, positive unconditional: 368, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 696, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 696, unknown conditional: 0, unknown unconditional: 696] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 69 places, 36 transitions, 392 flow. Already constructed 335077 states. Currently 71438 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. Started 16 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 845164.8ms, OverallIterations: 30, TraceHistogramMax: 1, EmptinessCheckTime: 986.7ms, AutomataDifference: 8280.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 707113.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 270 SDtfs, 270 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=229374occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 128127.5ms AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 15.7ms SsaConstructionTime, 95.2ms SatisfiabilityAnalysisTime, 166.8ms InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 45 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown