/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 09:25:15,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 09:25:15,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 09:25:15,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 09:25:15,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 09:25:15,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 09:25:15,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 09:25:15,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 09:25:15,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 09:25:15,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 09:25:15,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 09:25:15,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 09:25:15,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 09:25:15,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 09:25:15,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 09:25:15,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 09:25:15,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 09:25:15,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 09:25:15,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 09:25:15,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 09:25:15,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 09:25:15,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 09:25:15,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 09:25:15,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 09:25:15,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 09:25:15,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 09:25:15,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 09:25:15,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 09:25:15,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 09:25:15,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 09:25:15,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 09:25:15,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 09:25:15,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 09:25:15,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 09:25:15,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 09:25:15,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 09:25:15,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 09:25:15,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 09:25:15,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 09:25:15,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 09:25:15,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 09:25:15,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-06-11 09:25:15,661 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 09:25:15,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 09:25:15,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 09:25:15,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 09:25:15,663 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 09:25:15,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 09:25:15,664 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 09:25:15,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 09:25:15,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 09:25:15,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 09:25:15,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 09:25:15,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 09:25:15,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 09:25:15,665 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 09:25:15,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 09:25:15,665 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 09:25:15,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 09:25:15,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 09:25:15,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 09:25:15,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 09:25:15,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 09:25:15,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 09:25:15,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 09:25:15,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 09:25:15,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 09:25:15,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 09:25:15,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 09:25:15,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 09:25:15,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 09:25:15,667 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 09:25:15,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 09:25:15,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 09:25:15,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 09:25:15,975 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-11 09:25:15,976 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-11 09:25:15,977 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl [2021-06-11 09:25:15,977 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl' [2021-06-11 09:25:16,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 09:25:16,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-11 09:25:16,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 09:25:16,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 09:25:16,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 09:25:16,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... [2021-06-11 09:25:16,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... [2021-06-11 09:25:16,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 09:25:16,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 09:25:16,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 09:25:16,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 09:25:16,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... [2021-06-11 09:25:16,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... [2021-06-11 09:25:16,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... [2021-06-11 09:25:16,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... [2021-06-11 09:25:16,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... [2021-06-11 09:25:16,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... [2021-06-11 09:25:16,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... [2021-06-11 09:25:16,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 09:25:16,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 09:25:16,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 09:25:16,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 09:25:16,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 09:25:16,123 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2021-06-11 09:25:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2021-06-11 09:25:16,124 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2021-06-11 09:25:16,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 09:25:16,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 09:25:16,125 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 09:25:16,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 09:25:16,229 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-06-11 09:25:16,232 INFO L202 PluginConnector]: Adding new model ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 09:25:16 BoogieIcfgContainer [2021-06-11 09:25:16,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 09:25:16,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 09:25:16,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 09:25:16,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 09:25:16,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.06 09:25:16" (1/2) ... [2021-06-11 09:25:16,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20682594 and model type ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 09:25:16, skipping insertion in model container [2021-06-11 09:25:16,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 09:25:16" (2/2) ... [2021-06-11 09:25:16,238 INFO L111 eAbstractionObserver]: Analyzing ICFG ForkInLoop02-Incrementer.bpl [2021-06-11 09:25:16,247 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 09:25:16,251 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-06-11 09:25:16,251 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 09:25:16,279 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 09:25:16,293 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-11 09:25:16,310 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 09:25:16,310 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 09:25:16,310 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 09:25:16,310 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 09:25:16,310 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 09:25:16,311 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 09:25:16,311 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 09:25:16,311 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 09:25:16,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 13 places, 10 transitions, 25 flow [2021-06-11 09:25:16,334 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-06-11 09:25:16,334 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 09:25:16,336 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 4. Compared 10 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 09:25:16,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 10 transitions, 25 flow [2021-06-11 09:25:16,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 10 transitions, 25 flow [2021-06-11 09:25:16,341 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:16,354 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 13 places, 10 transitions, 25 flow [2021-06-11 09:25:16,358 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 10 transitions, 25 flow [2021-06-11 09:25:16,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 13 places, 10 transitions, 25 flow [2021-06-11 09:25:16,362 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-06-11 09:25:16,363 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 09:25:16,363 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 4. Compared 13 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 09:25:16,365 INFO L151 LiptonReduction]: Number of co-enabled transitions 24 [2021-06-11 09:25:16,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:16,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 09:25:16,525 INFO L163 LiptonReduction]: Checked pairs total: 9 [2021-06-11 09:25:16,525 INFO L165 LiptonReduction]: Total number of compositions: 4 [2021-06-11 09:25:16,527 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 187 [2021-06-11 09:25:16,544 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2021-06-11 09:25:16,544 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 09:25:16,544 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:16,552 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-11 09:25:16,552 INFO L428 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:16,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash 59487, now seen corresponding path program 1 times [2021-06-11 09:25:16,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:16,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640830263] [2021-06-11 09:25:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 09:25:16,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:16,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 09:25:16,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640830263] [2021-06-11 09:25:16,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 09:25:16,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 09:25:16,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236605851] [2021-06-11 09:25:16,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 09:25:16,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 09:25:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 09:25:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 09:25:16,697 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 14 [2021-06-11 09:25:16,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 10 places, 7 transitions, 19 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:16,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 09:25:16,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 14 [2021-06-11 09:25:16,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 09:25:16,718 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2021-06-11 09:25:16,718 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 09:25:16,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15 conditions, 7 events. 0/7 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 7 event pairs, 0 based on Foata normal form. 0/7 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 09:25:16,719 INFO L132 encePairwiseOnDemand]: 11/14 looper letters, 0 selfloop transitions, 2 changer transitions 1/6 dead transitions. [2021-06-11 09:25:16,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 6 transitions, 21 flow [2021-06-11 09:25:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 09:25:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 09:25:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2021-06-11 09:25:16,730 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5 [2021-06-11 09:25:16,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 21 transitions. [2021-06-11 09:25:16,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 21 transitions. [2021-06-11 09:25:16,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 09:25:16,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 21 transitions. [2021-06-11 09:25:16,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:16,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:16,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:16,742 INFO L185 Difference]: Start difference. First operand has 10 places, 7 transitions, 19 flow. Second operand 3 states and 21 transitions. [2021-06-11 09:25:16,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 6 transitions, 21 flow [2021-06-11 09:25:16,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 6 transitions, 21 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 09:25:16,751 INFO L241 Difference]: Finished difference. Result has 11 places, 5 transitions, 19 flow [2021-06-11 09:25:16,752 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=19, PETRI_PLACES=11, PETRI_TRANSITIONS=5} [2021-06-11 09:25:16,753 INFO L343 CegarLoopForPetriNet]: 10 programPoint places, 1 predicate places. [2021-06-11 09:25:16,753 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:16,753 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 11 places, 5 transitions, 19 flow [2021-06-11 09:25:16,754 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 11 places, 5 transitions, 19 flow [2021-06-11 09:25:16,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 10 places, 5 transitions, 19 flow [2021-06-11 09:25:16,758 INFO L129 PetriNetUnfolder]: 0/5 cut-off events. [2021-06-11 09:25:16,759 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 09:25:16,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13 conditions, 5 events. 0/5 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 0/5 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 09:25:16,759 INFO L151 LiptonReduction]: Number of co-enabled transitions 4 [2021-06-11 09:25:16,760 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 09:25:16,760 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 09:25:16,760 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 09:25:16,762 INFO L480 AbstractCegarLoop]: Abstraction has has 10 places, 5 transitions, 19 flow [2021-06-11 09:25:16,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:16,763 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:16,763 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2021-06-11 09:25:16,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-11 09:25:16,763 INFO L428 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1843627, now seen corresponding path program 1 times [2021-06-11 09:25:16,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:16,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756905303] [2021-06-11 09:25:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 09:25:16,785 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 09:25:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 09:25:16,796 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 09:25:16,811 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 09:25:16,811 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 09:25:16,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-11 09:25:16,813 WARN L342 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-11 09:25:16,813 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-11 09:25:16,825 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 09:25:16,826 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-11 09:25:16,829 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 09:25:16,829 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 09:25:16,830 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 09:25:16,830 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 09:25:16,830 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 09:25:16,830 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 09:25:16,830 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 09:25:16,830 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 09:25:16,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 42 flow [2021-06-11 09:25:16,846 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-06-11 09:25:16,847 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 09:25:16,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 0/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 09:25:16,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 15 transitions, 42 flow [2021-06-11 09:25:16,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 42 flow [2021-06-11 09:25:16,849 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:16,849 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 15 transitions, 42 flow [2021-06-11 09:25:16,849 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 42 flow [2021-06-11 09:25:16,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 42 flow [2021-06-11 09:25:16,859 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-06-11 09:25:16,859 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 09:25:16,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 0/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 09:25:16,859 INFO L151 LiptonReduction]: Number of co-enabled transitions 88 [2021-06-11 09:25:16,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:16,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 09:25:17,004 INFO L163 LiptonReduction]: Checked pairs total: 146 [2021-06-11 09:25:17,004 INFO L165 LiptonReduction]: Total number of compositions: 5 [2021-06-11 09:25:17,004 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 155 [2021-06-11 09:25:17,007 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2021-06-11 09:25:17,007 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-06-11 09:25:17,007 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:17,007 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2021-06-11 09:25:17,007 INFO L428 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2522016, now seen corresponding path program 1 times [2021-06-11 09:25:17,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:17,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198132405] [2021-06-11 09:25:17,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 09:25:17,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:17,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 09:25:17,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198132405] [2021-06-11 09:25:17,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 09:25:17,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 09:25:17,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409566881] [2021-06-11 09:25:17,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 09:25:17,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 09:25:17,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 09:25:17,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 09:25:17,028 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 20 [2021-06-11 09:25:17,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 12 transitions, 36 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 09:25:17,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 20 [2021-06-11 09:25:17,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 09:25:17,055 INFO L129 PetriNetUnfolder]: 5/27 cut-off events. [2021-06-11 09:25:17,055 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 09:25:17,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 27 events. 5/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 55 event pairs, 1 based on Foata normal form. 2/22 useless extension candidates. Maximal degree in co-relation 38. Up to 15 conditions per place. [2021-06-11 09:25:17,057 INFO L132 encePairwiseOnDemand]: 13/20 looper letters, 2 selfloop transitions, 9 changer transitions 0/16 dead transitions. [2021-06-11 09:25:17,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 16 transitions, 66 flow [2021-06-11 09:25:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 09:25:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 09:25:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2021-06-11 09:25:17,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5625 [2021-06-11 09:25:17,059 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 45 transitions. [2021-06-11 09:25:17,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 45 transitions. [2021-06-11 09:25:17,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 09:25:17,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 45 transitions. [2021-06-11 09:25:17,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 11.25) internal successors, (45), 4 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-06-11 09:25:17,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,061 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,061 INFO L185 Difference]: Start difference. First operand has 17 places, 12 transitions, 36 flow. Second operand 4 states and 45 transitions. [2021-06-11 09:25:17,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 16 transitions, 66 flow [2021-06-11 09:25:17,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 16 transitions, 64 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-06-11 09:25:17,063 INFO L241 Difference]: Finished difference. Result has 21 places, 16 transitions, 72 flow [2021-06-11 09:25:17,063 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=21, PETRI_TRANSITIONS=16} [2021-06-11 09:25:17,063 INFO L343 CegarLoopForPetriNet]: 17 programPoint places, 4 predicate places. [2021-06-11 09:25:17,063 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:17,064 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 16 transitions, 72 flow [2021-06-11 09:25:17,064 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 72 flow [2021-06-11 09:25:17,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 72 flow [2021-06-11 09:25:17,069 INFO L129 PetriNetUnfolder]: 5/27 cut-off events. [2021-06-11 09:25:17,069 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 09:25:17,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 27 events. 5/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 70 event pairs, 1 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 48. Up to 15 conditions per place. [2021-06-11 09:25:17,070 INFO L151 LiptonReduction]: Number of co-enabled transitions 64 [2021-06-11 09:25:17,072 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 09:25:17,072 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 09:25:17,073 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 09:25:17,073 INFO L480 AbstractCegarLoop]: Abstraction has has 21 places, 16 transitions, 72 flow [2021-06-11 09:25:17,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:17,074 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2021-06-11 09:25:17,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-11 09:25:17,074 INFO L428 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:17,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1871568349, now seen corresponding path program 1 times [2021-06-11 09:25:17,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:17,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075170391] [2021-06-11 09:25:17,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 09:25:17,080 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 09:25:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 09:25:17,084 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 09:25:17,085 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 09:25:17,086 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 09:25:17,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-11 09:25:17,086 WARN L342 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-11 09:25:17,087 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-11 09:25:17,093 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 09:25:17,094 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 09:25:17,095 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 09:25:17,095 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 09:25:17,095 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 09:25:17,095 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 09:25:17,095 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 09:25:17,095 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 09:25:17,095 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 09:25:17,096 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 09:25:17,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 61 flow [2021-06-11 09:25:17,101 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-06-11 09:25:17,101 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-11 09:25:17,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 25 events. 0/25 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-06-11 09:25:17,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 20 transitions, 61 flow [2021-06-11 09:25:17,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 20 transitions, 61 flow [2021-06-11 09:25:17,102 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:17,102 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 61 flow [2021-06-11 09:25:17,102 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 61 flow [2021-06-11 09:25:17,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 61 flow [2021-06-11 09:25:17,106 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-06-11 09:25:17,107 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-11 09:25:17,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 25 events. 0/25 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-06-11 09:25:17,107 INFO L151 LiptonReduction]: Number of co-enabled transitions 192 [2021-06-11 09:25:17,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 09:25:17,279 INFO L163 LiptonReduction]: Checked pairs total: 340 [2021-06-11 09:25:17,279 INFO L165 LiptonReduction]: Total number of compositions: 7 [2021-06-11 09:25:17,279 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 177 [2021-06-11 09:25:17,284 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-06-11 09:25:17,284 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-06-11 09:25:17,284 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:17,284 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2021-06-11 09:25:17,284 INFO L428 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:17,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:17,285 INFO L82 PathProgramCache]: Analyzing trace with hash 3534044, now seen corresponding path program 1 times [2021-06-11 09:25:17,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:17,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728746114] [2021-06-11 09:25:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 09:25:17,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:17,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 09:25:17,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728746114] [2021-06-11 09:25:17,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 09:25:17,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 09:25:17,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509593369] [2021-06-11 09:25:17,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 09:25:17,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 09:25:17,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 09:25:17,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 09:25:17,319 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2021-06-11 09:25:17,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 09:25:17,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2021-06-11 09:25:17,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 09:25:17,408 INFO L129 PetriNetUnfolder]: 69/141 cut-off events. [2021-06-11 09:25:17,408 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-11 09:25:17,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 141 events. 69/141 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 545 event pairs, 21 based on Foata normal form. 3/98 useless extension candidates. Maximal degree in co-relation 260. Up to 124 conditions per place. [2021-06-11 09:25:17,411 INFO L132 encePairwiseOnDemand]: 17/27 looper letters, 9 selfloop transitions, 13 changer transitions 0/28 dead transitions. [2021-06-11 09:25:17,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 121 flow [2021-06-11 09:25:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 09:25:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 09:25:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2021-06-11 09:25:17,413 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2021-06-11 09:25:17,413 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 65 transitions. [2021-06-11 09:25:17,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 65 transitions. [2021-06-11 09:25:17,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 09:25:17,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 65 transitions. [2021-06-11 09:25:17,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,428 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,428 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 53 flow. Second operand 4 states and 65 transitions. [2021-06-11 09:25:17,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 121 flow [2021-06-11 09:25:17,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 115 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-06-11 09:25:17,429 INFO L241 Difference]: Finished difference. Result has 27 places, 28 transitions, 127 flow [2021-06-11 09:25:17,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=27, PETRI_TRANSITIONS=28} [2021-06-11 09:25:17,430 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 4 predicate places. [2021-06-11 09:25:17,430 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:17,430 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 28 transitions, 127 flow [2021-06-11 09:25:17,430 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 28 transitions, 127 flow [2021-06-11 09:25:17,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 28 transitions, 127 flow [2021-06-11 09:25:17,452 INFO L129 PetriNetUnfolder]: 38/102 cut-off events. [2021-06-11 09:25:17,453 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-06-11 09:25:17,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 102 events. 38/102 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 468 event pairs, 10 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 214. Up to 61 conditions per place. [2021-06-11 09:25:17,456 INFO L151 LiptonReduction]: Number of co-enabled transitions 174 [2021-06-11 09:25:17,459 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 09:25:17,460 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 09:25:17,460 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-06-11 09:25:17,461 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 28 transitions, 127 flow [2021-06-11 09:25:17,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,461 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:17,461 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 09:25:17,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 09:25:17,462 INFO L428 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2106954643, now seen corresponding path program 1 times [2021-06-11 09:25:17,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:17,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261598459] [2021-06-11 09:25:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 09:25:17,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 09:25:17,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 09:25:17,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261598459] [2021-06-11 09:25:17,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 09:25:17,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 09:25:17,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549572383] [2021-06-11 09:25:17,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 09:25:17,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 09:25:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 09:25:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 09:25:17,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2021-06-11 09:25:17,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 09:25:17,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2021-06-11 09:25:17,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 09:25:17,538 INFO L129 PetriNetUnfolder]: 57/153 cut-off events. [2021-06-11 09:25:17,538 INFO L130 PetriNetUnfolder]: For 60/174 co-relation queries the response was YES. [2021-06-11 09:25:17,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 153 events. 57/153 cut-off events. For 60/174 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 737 event pairs, 15 based on Foata normal form. 23/124 useless extension candidates. Maximal degree in co-relation 457. Up to 94 conditions per place. [2021-06-11 09:25:17,542 INFO L132 encePairwiseOnDemand]: 17/27 looper letters, 18 selfloop transitions, 16 changer transitions 0/40 dead transitions. [2021-06-11 09:25:17,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 249 flow [2021-06-11 09:25:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 09:25:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 09:25:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2021-06-11 09:25:17,544 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2021-06-11 09:25:17,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 49 transitions. [2021-06-11 09:25:17,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 49 transitions. [2021-06-11 09:25:17,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 09:25:17,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 49 transitions. [2021-06-11 09:25:17,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,546 INFO L185 Difference]: Start difference. First operand has 27 places, 28 transitions, 127 flow. Second operand 3 states and 49 transitions. [2021-06-11 09:25:17,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 249 flow [2021-06-11 09:25:17,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 249 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 09:25:17,549 INFO L241 Difference]: Finished difference. Result has 31 places, 40 transitions, 275 flow [2021-06-11 09:25:17,549 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=31, PETRI_TRANSITIONS=40} [2021-06-11 09:25:17,549 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 8 predicate places. [2021-06-11 09:25:17,549 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:17,550 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 40 transitions, 275 flow [2021-06-11 09:25:17,550 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 40 transitions, 275 flow [2021-06-11 09:25:17,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 40 transitions, 275 flow [2021-06-11 09:25:17,574 INFO L129 PetriNetUnfolder]: 57/153 cut-off events. [2021-06-11 09:25:17,574 INFO L130 PetriNetUnfolder]: For 155/293 co-relation queries the response was YES. [2021-06-11 09:25:17,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 153 events. 57/153 cut-off events. For 155/293 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 792 event pairs, 15 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 502. Up to 94 conditions per place. [2021-06-11 09:25:17,577 INFO L151 LiptonReduction]: Number of co-enabled transitions 230 [2021-06-11 09:25:17,584 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 09:25:17,584 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 09:25:17,584 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-06-11 09:25:17,587 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 40 transitions, 275 flow [2021-06-11 09:25:17,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,587 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:17,587 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 09:25:17,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 09:25:17,588 INFO L428 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:17,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2106941817, now seen corresponding path program 1 times [2021-06-11 09:25:17,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:17,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056455467] [2021-06-11 09:25:17,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 09:25:17,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:17,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:17,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 09:25:17,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056455467] [2021-06-11 09:25:17,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 09:25:17,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 09:25:17,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920473682] [2021-06-11 09:25:17,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 09:25:17,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 09:25:17,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 09:25:17,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-11 09:25:17,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2021-06-11 09:25:17,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 40 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 09:25:17,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2021-06-11 09:25:17,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 09:25:17,693 INFO L129 PetriNetUnfolder]: 36/105 cut-off events. [2021-06-11 09:25:17,693 INFO L130 PetriNetUnfolder]: For 172/407 co-relation queries the response was YES. [2021-06-11 09:25:17,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 105 events. 36/105 cut-off events. For 172/407 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 431 event pairs, 8 based on Foata normal form. 38/139 useless extension candidates. Maximal degree in co-relation 436. Up to 61 conditions per place. [2021-06-11 09:25:17,695 INFO L132 encePairwiseOnDemand]: 17/27 looper letters, 9 selfloop transitions, 25 changer transitions 0/40 dead transitions. [2021-06-11 09:25:17,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 343 flow [2021-06-11 09:25:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 09:25:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 09:25:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2021-06-11 09:25:17,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2021-06-11 09:25:17,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 75 transitions. [2021-06-11 09:25:17,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 75 transitions. [2021-06-11 09:25:17,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 09:25:17,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 75 transitions. [2021-06-11 09:25:17,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,699 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,699 INFO L185 Difference]: Start difference. First operand has 31 places, 40 transitions, 275 flow. Second operand 5 states and 75 transitions. [2021-06-11 09:25:17,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 343 flow [2021-06-11 09:25:17,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 09:25:17,702 INFO L241 Difference]: Finished difference. Result has 34 places, 40 transitions, 317 flow [2021-06-11 09:25:17,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=34, PETRI_TRANSITIONS=40} [2021-06-11 09:25:17,703 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 11 predicate places. [2021-06-11 09:25:17,703 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:17,703 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 40 transitions, 317 flow [2021-06-11 09:25:17,703 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 40 transitions, 317 flow [2021-06-11 09:25:17,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 40 transitions, 317 flow [2021-06-11 09:25:17,711 INFO L129 PetriNetUnfolder]: 36/105 cut-off events. [2021-06-11 09:25:17,711 INFO L130 PetriNetUnfolder]: For 87/124 co-relation queries the response was YES. [2021-06-11 09:25:17,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 105 events. 36/105 cut-off events. For 87/124 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 472 event pairs, 8 based on Foata normal form. 2/93 useless extension candidates. Maximal degree in co-relation 403. Up to 61 conditions per place. [2021-06-11 09:25:17,712 INFO L151 LiptonReduction]: Number of co-enabled transitions 226 [2021-06-11 09:25:17,716 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 09:25:17,716 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 09:25:17,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-06-11 09:25:17,717 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 40 transitions, 317 flow [2021-06-11 09:25:17,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:17,717 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:17,717 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2021-06-11 09:25:17,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 09:25:17,718 INFO L428 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash -891596225, now seen corresponding path program 1 times [2021-06-11 09:25:17,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:17,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100422730] [2021-06-11 09:25:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 09:25:17,723 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 09:25:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 09:25:17,726 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 09:25:17,727 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 09:25:17,728 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 09:25:17,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 09:25:17,728 WARN L342 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-11 09:25:17,728 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-06-11 09:25:17,734 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 09:25:17,735 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 09:25:17,735 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 09:25:17,736 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 09:25:17,736 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 09:25:17,736 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 09:25:17,736 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 09:25:17,736 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 09:25:17,736 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 09:25:17,736 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 09:25:17,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 82 flow [2021-06-11 09:25:17,738 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-06-11 09:25:17,738 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-11 09:25:17,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 32 events. 0/32 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2021-06-11 09:25:17,739 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 25 transitions, 82 flow [2021-06-11 09:25:17,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 25 transitions, 82 flow [2021-06-11 09:25:17,739 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:17,739 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 82 flow [2021-06-11 09:25:17,740 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 82 flow [2021-06-11 09:25:17,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 82 flow [2021-06-11 09:25:17,742 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-06-11 09:25:17,742 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-11 09:25:17,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 32 events. 0/32 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2021-06-11 09:25:17,742 INFO L151 LiptonReduction]: Number of co-enabled transitions 336 [2021-06-11 09:25:17,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:17,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 09:25:18,004 INFO L163 LiptonReduction]: Checked pairs total: 624 [2021-06-11 09:25:18,004 INFO L165 LiptonReduction]: Total number of compositions: 9 [2021-06-11 09:25:18,004 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 265 [2021-06-11 09:25:18,005 INFO L129 PetriNetUnfolder]: 0/6 cut-off events. [2021-06-11 09:25:18,005 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-06-11 09:25:18,006 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:18,006 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2021-06-11 09:25:18,006 INFO L428 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:18,006 INFO L82 PathProgramCache]: Analyzing trace with hash 4582302, now seen corresponding path program 1 times [2021-06-11 09:25:18,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:18,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870803203] [2021-06-11 09:25:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 09:25:18,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:18,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:18,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:18,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 09:25:18,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870803203] [2021-06-11 09:25:18,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 09:25:18,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 09:25:18,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186502563] [2021-06-11 09:25:18,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 09:25:18,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 09:25:18,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 09:25:18,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 09:25:18,022 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2021-06-11 09:25:18,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 09:25:18,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2021-06-11 09:25:18,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 09:25:18,110 INFO L129 PetriNetUnfolder]: 489/755 cut-off events. [2021-06-11 09:25:18,111 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-11 09:25:18,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 755 events. 489/755 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 3559 event pairs, 213 based on Foata normal form. 4/491 useless extension candidates. Maximal degree in co-relation 1482. Up to 733 conditions per place. [2021-06-11 09:25:18,117 INFO L132 encePairwiseOnDemand]: 21/34 looper letters, 12 selfloop transitions, 17 changer transitions 0/36 dead transitions. [2021-06-11 09:25:18,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 162 flow [2021-06-11 09:25:18,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 09:25:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 09:25:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2021-06-11 09:25:18,119 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5955882352941176 [2021-06-11 09:25:18,119 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 81 transitions. [2021-06-11 09:25:18,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 81 transitions. [2021-06-11 09:25:18,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 09:25:18,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 81 transitions. [2021-06-11 09:25:18,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,121 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,121 INFO L185 Difference]: Start difference. First operand has 29 places, 20 transitions, 72 flow. Second operand 4 states and 81 transitions. [2021-06-11 09:25:18,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 162 flow [2021-06-11 09:25:18,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 150 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-06-11 09:25:18,122 INFO L241 Difference]: Finished difference. Result has 33 places, 36 transitions, 166 flow [2021-06-11 09:25:18,122 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=33, PETRI_TRANSITIONS=36} [2021-06-11 09:25:18,123 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2021-06-11 09:25:18,123 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:18,123 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 36 transitions, 166 flow [2021-06-11 09:25:18,123 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 36 transitions, 166 flow [2021-06-11 09:25:18,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 36 transitions, 166 flow [2021-06-11 09:25:18,144 INFO L129 PetriNetUnfolder]: 189/374 cut-off events. [2021-06-11 09:25:18,144 INFO L130 PetriNetUnfolder]: For 7/27 co-relation queries the response was YES. [2021-06-11 09:25:18,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 374 events. 189/374 cut-off events. For 7/27 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2122 event pairs, 69 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 782. Up to 209 conditions per place. [2021-06-11 09:25:18,149 INFO L151 LiptonReduction]: Number of co-enabled transitions 282 [2021-06-11 09:25:18,154 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 09:25:18,154 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 09:25:18,154 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-06-11 09:25:18,155 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 36 transitions, 166 flow [2021-06-11 09:25:18,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,155 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:18,155 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 09:25:18,155 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 09:25:18,156 INFO L428 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:18,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:18,156 INFO L82 PathProgramCache]: Analyzing trace with hash -935274520, now seen corresponding path program 1 times [2021-06-11 09:25:18,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:18,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039820889] [2021-06-11 09:25:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 09:25:18,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:18,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:18,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:18,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:18,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 09:25:18,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 09:25:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-11 09:25:18,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039820889] [2021-06-11 09:25:18,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 09:25:18,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 09:25:18,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712022257] [2021-06-11 09:25:18,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 09:25:18,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 09:25:18,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 09:25:18,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-11 09:25:18,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2021-06-11 09:25:18,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 09:25:18,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2021-06-11 09:25:18,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 09:25:18,292 INFO L129 PetriNetUnfolder]: 323/647 cut-off events. [2021-06-11 09:25:18,292 INFO L130 PetriNetUnfolder]: For 276/720 co-relation queries the response was YES. [2021-06-11 09:25:18,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 647 events. 323/647 cut-off events. For 276/720 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 3796 event pairs, 93 based on Foata normal form. 150/570 useless extension candidates. Maximal degree in co-relation 1960. Up to 409 conditions per place. [2021-06-11 09:25:18,309 INFO L132 encePairwiseOnDemand]: 21/34 looper letters, 12 selfloop transitions, 25 changer transitions 0/44 dead transitions. [2021-06-11 09:25:18,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 272 flow [2021-06-11 09:25:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 09:25:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 09:25:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2021-06-11 09:25:18,311 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5941176470588235 [2021-06-11 09:25:18,311 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 101 transitions. [2021-06-11 09:25:18,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 101 transitions. [2021-06-11 09:25:18,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 09:25:18,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 101 transitions. [2021-06-11 09:25:18,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,312 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,313 INFO L185 Difference]: Start difference. First operand has 33 places, 36 transitions, 166 flow. Second operand 5 states and 101 transitions. [2021-06-11 09:25:18,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 272 flow [2021-06-11 09:25:18,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 09:25:18,314 INFO L241 Difference]: Finished difference. Result has 39 places, 44 transitions, 297 flow [2021-06-11 09:25:18,315 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=39, PETRI_TRANSITIONS=44} [2021-06-11 09:25:18,315 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2021-06-11 09:25:18,315 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 09:25:18,315 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 44 transitions, 297 flow [2021-06-11 09:25:18,315 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 44 transitions, 297 flow [2021-06-11 09:25:18,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 44 transitions, 297 flow [2021-06-11 09:25:18,352 INFO L129 PetriNetUnfolder]: 323/647 cut-off events. [2021-06-11 09:25:18,353 INFO L130 PetriNetUnfolder]: For 567/787 co-relation queries the response was YES. [2021-06-11 09:25:18,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 647 events. 323/647 cut-off events. For 567/787 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4015 event pairs, 89 based on Foata normal form. 2/584 useless extension candidates. Maximal degree in co-relation 2140. Up to 409 conditions per place. [2021-06-11 09:25:18,360 INFO L151 LiptonReduction]: Number of co-enabled transitions 278 [2021-06-11 09:25:18,368 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 09:25:18,368 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 09:25:18,368 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-06-11 09:25:18,369 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 44 transitions, 297 flow [2021-06-11 09:25:18,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 09:25:18,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 09:25:18,369 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 09:25:18,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 09:25:18,369 INFO L428 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 09:25:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 09:25:18,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2004207068, now seen corresponding path program 1 times [2021-06-11 09:25:18,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 09:25:18,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45405876] [2021-06-11 09:25:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 09:25:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 09:25:18,375 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 09:25:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 09:25:18,378 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 09:25:18,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 09:25:18,380 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 09:25:18,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 09:25:18,391 INFO L202 PluginConnector]: Adding new model ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 09:25:18 BasicIcfg [2021-06-11 09:25:18,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 09:25:18,392 INFO L168 Benchmark]: Toolchain (without parser) took 2382.32 ms. Allocated memory is still 360.7 MB. Free memory was 340.6 MB in the beginning and 313.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.0 GB. [2021-06-11 09:25:18,392 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 360.7 MB. Free memory is still 341.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 09:25:18,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.23 ms. Allocated memory is still 360.7 MB. Free memory was 340.4 MB in the beginning and 339.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 09:25:18,392 INFO L168 Benchmark]: Boogie Preprocessor took 15.05 ms. Allocated memory is still 360.7 MB. Free memory was 339.0 MB in the beginning and 338.1 MB in the end (delta: 894.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 09:25:18,393 INFO L168 Benchmark]: RCFGBuilder took 176.83 ms. Allocated memory is still 360.7 MB. Free memory was 338.0 MB in the beginning and 329.6 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. [2021-06-11 09:25:18,393 INFO L168 Benchmark]: TraceAbstraction took 2157.43 ms. Allocated memory is still 360.7 MB. Free memory was 329.1 MB in the beginning and 313.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.0 GB. [2021-06-11 09:25:18,394 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.12 ms. Allocated memory is still 360.7 MB. Free memory is still 341.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 26.23 ms. Allocated memory is still 360.7 MB. Free memory was 340.4 MB in the beginning and 339.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 15.05 ms. Allocated memory is still 360.7 MB. Free memory was 339.0 MB in the beginning and 338.1 MB in the end (delta: 894.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 176.83 ms. Allocated memory is still 360.7 MB. Free memory was 338.0 MB in the beginning and 329.6 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2157.43 ms. Allocated memory is still 360.7 MB. Free memory was 329.1 MB in the beginning and 313.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 167.5ms, 13 PlacesBefore, 10 PlacesAfterwards, 10 TransitionsBefore, 7 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 9, positive: 3, positive conditional: 0, positive unconditional: 3, 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): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4ms, 11 PlacesBefore, 10 PlacesAfterwards, 5 TransitionsBefore, 5 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 154.5ms, 20 PlacesBefore, 17 PlacesAfterwards, 15 TransitionsBefore, 12 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 49, unknown conditional: 0, unknown unconditional: 49] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6ms, 21 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 176.8ms, 27 PlacesBefore, 23 PlacesAfterwards, 20 TransitionsBefore, 16 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 100, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 100, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 100, unknown conditional: 0, unknown unconditional: 100] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.3ms, 27 PlacesBefore, 27 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.1ms, 31 PlacesBefore, 31 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.4ms, 34 PlacesBefore, 34 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 264.4ms, 34 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 20 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 240, positive: 208, positive conditional: 0, positive unconditional: 208, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 181, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 181, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 181, unknown conditional: 0, unknown unconditional: 181] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 214, Positive conditional cache size: 0, Positive unconditional cache size: 214, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.2ms, 33 PlacesBefore, 33 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 214, Positive conditional cache size: 0, Positive unconditional cache size: 214, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.6ms, 39 PlacesBefore, 39 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 214, Positive conditional cache size: 0, Positive unconditional cache size: 214, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - CounterExampleResult [Line: 31]: assertion can be violated assertion can be violated We found a FailurePath: [L17] 0 newid := 0; [L18] 0 n := 0; VAL [n=0, newid=0] [L21] FORK 0 fork newid foo(); VAL [n=0, newid=0] [L30] 1 n := n + 1; [L31] 1 assert n <= 2; [L22] 0 newid := newid + 1; VAL [n=1, newid=1] [L21] FORK 0 fork newid foo(); VAL [n=1, newid=1] [L30] 2 n := n + 1; [L31] 2 assert n <= 2; [L22] 0 newid := newid + 1; VAL [n=2, newid=2] [L21] FORK 0 fork newid foo(); VAL [n=2, newid=2] [L30] 3 n := n + 1; VAL [n=3, newid=2] [L31] 3 assert n <= 2; VAL [n=3, newid=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. Started 4 CEGAR loops. EmptinessCheckTime: 9.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2042.1ms, OverallIterations: 11, TraceHistogramMax: 3, EmptinessCheckTime: 0.0ms, AutomataDifference: 576.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 858.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 34 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 171 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 155.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 9.7ms SsaConstructionTime, 61.4ms SatisfiabilityAnalysisTime, 129.8ms InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 77 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3/3 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 proved your program to be incorrect! Received shutdown request...