/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 15:01:41,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 15:01:41,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 15:01:41,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 15:01:41,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 15:01:41,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 15:01:41,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 15:01:41,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 15:01:41,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 15:01:41,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 15:01:41,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 15:01:41,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 15:01:41,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 15:01:41,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 15:01:41,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 15:01:41,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 15:01:41,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 15:01:41,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 15:01:41,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 15:01:41,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 15:01:41,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 15:01:41,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 15:01:41,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 15:01:41,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 15:01:41,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 15:01:41,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 15:01:41,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 15:01:41,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 15:01:41,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 15:01:41,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 15:01:41,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 15:01:41,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 15:01:41,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 15:01:41,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 15:01:41,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 15:01:41,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 15:01:41,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 15:01:41,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 15:01:41,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 15:01:41,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 15:01:41,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 15:01:41,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 15:01:41,228 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 15:01:41,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 15:01:41,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 15:01:41,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 15:01:41,231 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 15:01:41,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 15:01:41,232 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 15:01:41,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 15:01:41,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 15:01:41,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 15:01:41,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 15:01:41,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 15:01:41,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 15:01:41,233 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 15:01:41,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 15:01:41,233 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 15:01:41,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 15:01:41,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 15:01:41,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 15:01:41,234 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 15:01:41,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 15:01:41,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 15:01:41,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 15:01:41,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 15:01:41,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 15:01:41,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 15:01:41,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 15:01:41,235 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 15:01:41,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 15:01:41,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 15:01:41,236 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-03-26 15:01:41,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 15:01:41,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 15:01:41,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 15:01:41,558 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-26 15:01:41,558 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-26 15:01:41,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2021-03-26 15:01:41,559 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2021-03-26 15:01:41,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 15:01:41,597 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-26 15:01:41,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 15:01:41,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 15:01:41,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 15:01:41,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... [2021-03-26 15:01:41,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... [2021-03-26 15:01:41,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 15:01:41,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 15:01:41,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 15:01:41,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 15:01:41,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... [2021-03-26 15:01:41,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... [2021-03-26 15:01:41,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... [2021-03-26 15:01:41,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... [2021-03-26 15:01:41,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... [2021-03-26 15:01:41,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... [2021-03-26 15:01:41,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... [2021-03-26 15:01:41,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 15:01:41,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 15:01:41,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 15:01:41,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 15:01:41,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 15:01:41,696 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-26 15:01:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-26 15:01:41,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-26 15:01:41,698 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-26 15:01:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-26 15:01:41,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-26 15:01:41,698 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-26 15:01:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 15:01:41,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 15:01:41,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-26 15:01:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-26 15:01:41,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-26 15:01:41,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-03-26 15:01:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-03-26 15:01:41,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-03-26 15:01:41,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-03-26 15:01:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-03-26 15:01:41,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-03-26 15:01:41,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-03-26 15:01:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-03-26 15:01:41,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-03-26 15:01:41,702 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 15:01:41,933 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 15:01:41,933 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-03-26 15:01:41,935 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 03:01:41 BoogieIcfgContainer [2021-03-26 15:01:41,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 15:01:41,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 15:01:41,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 15:01:41,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 15:01:41,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 03:01:41" (1/2) ... [2021-03-26 15:01:41,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d88db68 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 03:01:41, skipping insertion in model container [2021-03-26 15:01:41,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 03:01:41" (2/2) ... [2021-03-26 15:01:41,944 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-03-26 15:01:41,959 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 15:01:41,962 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 15:01:41,962 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 15:01:42,049 INFO L149 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-03-26 15:01:42,065 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-03-26 15:01:42,084 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 15:01:42,084 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 15:01:42,084 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 15:01:42,084 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 15:01:42,084 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 15:01:42,085 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 15:01:42,085 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 15:01:42,085 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 15:01:42,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 218 flow [2021-03-26 15:01:42,151 INFO L129 PetriNetUnfolder]: 8/61 cut-off events. [2021-03-26 15:01:42,151 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 15:01:42,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 61 events. 8/61 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 190 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2021-03-26 15:01:42,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 73 transitions, 218 flow [2021-03-26 15:01:42,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 59 transitions, 166 flow [2021-03-26 15:01:42,162 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:01:42,177 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 59 transitions, 166 flow [2021-03-26 15:01:42,181 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 59 transitions, 166 flow [2021-03-26 15:01:42,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 59 transitions, 166 flow [2021-03-26 15:01:42,211 INFO L129 PetriNetUnfolder]: 8/59 cut-off events. [2021-03-26 15:01:42,211 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 15:01:42,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 59 events. 8/59 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 183 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2021-03-26 15:01:42,217 INFO L142 LiptonReduction]: Number of co-enabled transitions 1888 [2021-03-26 15:01:42,328 INFO L154 LiptonReduction]: Checked pairs total: 600 [2021-03-26 15:01:42,328 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 15:01:42,330 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 171 [2021-03-26 15:01:42,357 INFO L129 PetriNetUnfolder]: 8/57 cut-off events. [2021-03-26 15:01:42,357 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 15:01:42,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:01:42,358 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:01:42,358 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:01:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:01:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash -871171209, now seen corresponding path program 1 times [2021-03-26 15:01:42,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:01:42,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568218223] [2021-03-26 15:01:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:01:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:01:42,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:42,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 15:01:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:01:42,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568218223] [2021-03-26 15:01:42,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:01:42,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 15:01:42,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172194860] [2021-03-26 15:01:42,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 15:01:42,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:01:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 15:01:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 15:01:42,556 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 78 [2021-03-26 15:01:42,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:42,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:01:42,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 78 [2021-03-26 15:01:42,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:01:43,014 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][60], [thread3Thread1of1ForFork1NotInUse, thread5Thread1of1ForFork4NotInUse, thread4Thread1of1ForFork3NotInUse, thread1Thread1of1ForFork2NotInUse, 88#true, 72#L119true, thread6Thread1of1ForFork5NotInUse, thread2Thread1of1ForFork0NotInUse]) [2021-03-26 15:01:43,014 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-26 15:01:43,014 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-03-26 15:01:43,014 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-03-26 15:01:43,014 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 15:01:43,066 INFO L129 PetriNetUnfolder]: 1975/3928 cut-off events. [2021-03-26 15:01:43,066 INFO L130 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2021-03-26 15:01:43,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 3928 events. 1975/3928 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 28997 event pairs, 737 based on Foata normal form. 1/3649 useless extension candidates. Maximal degree in co-relation 6543. Up to 2309 conditions per place. [2021-03-26 15:01:43,102 INFO L132 encePairwiseOnDemand]: 72/78 looper letters, 21 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2021-03-26 15:01:43,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 232 flow [2021-03-26 15:01:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 15:01:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 15:01:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2021-03-26 15:01:43,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8589743589743589 [2021-03-26 15:01:43,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 201 transitions. [2021-03-26 15:01:43,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 201 transitions. [2021-03-26 15:01:43,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:01:43,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 201 transitions. [2021-03-26 15:01:43,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,130 INFO L185 Difference]: Start difference. First operand has 69 places, 58 transitions, 164 flow. Second operand 3 states and 201 transitions. [2021-03-26 15:01:43,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 232 flow [2021-03-26 15:01:43,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 200 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-03-26 15:01:43,143 INFO L241 Difference]: Finished difference. Result has 60 places, 62 transitions, 165 flow [2021-03-26 15:01:43,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2021-03-26 15:01:43,145 INFO L343 CegarLoopForPetriNet]: 69 programPoint places, -9 predicate places. [2021-03-26 15:01:43,146 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:01:43,146 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 62 transitions, 165 flow [2021-03-26 15:01:43,146 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 62 transitions, 165 flow [2021-03-26 15:01:43,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 62 transitions, 165 flow [2021-03-26 15:01:43,163 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][48], [88#true, 72#L119true, Black: 90#(and (= y_1 y_9) (= x_0 x_8))]) [2021-03-26 15:01:43,163 INFO L384 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2021-03-26 15:01:43,163 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-26 15:01:43,163 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 15:01:43,164 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 15:01:43,164 INFO L129 PetriNetUnfolder]: 78/255 cut-off events. [2021-03-26 15:01:43,164 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 15:01:43,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 255 events. 78/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1163 event pairs, 6 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 311. Up to 63 conditions per place. [2021-03-26 15:01:43,172 INFO L142 LiptonReduction]: Number of co-enabled transitions 2008 [2021-03-26 15:01:43,190 INFO L154 LiptonReduction]: Checked pairs total: 37 [2021-03-26 15:01:43,190 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 15:01:43,190 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-26 15:01:43,193 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 165 flow [2021-03-26 15:01:43,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,193 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:01:43,193 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:01:43,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 15:01:43,193 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:01:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:01:43,195 INFO L82 PathProgramCache]: Analyzing trace with hash -992939024, now seen corresponding path program 1 times [2021-03-26 15:01:43,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:01:43,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510482211] [2021-03-26 15:01:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:01:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:01:43,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:43,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-26 15:01:43,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:01:43,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510482211] [2021-03-26 15:01:43,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:01:43,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 15:01:43,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234986910] [2021-03-26 15:01:43,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 15:01:43,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:01:43,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 15:01:43,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 15:01:43,248 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-03-26 15:01:43,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:01:43,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-03-26 15:01:43,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:01:43,315 INFO L129 PetriNetUnfolder]: 101/344 cut-off events. [2021-03-26 15:01:43,315 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 15:01:43,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 344 events. 101/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1667 event pairs, 14 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 444. Up to 84 conditions per place. [2021-03-26 15:01:43,318 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2021-03-26 15:01:43,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 183 flow [2021-03-26 15:01:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 15:01:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 15:01:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-03-26 15:01:43,324 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-03-26 15:01:43,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:01:43,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,329 INFO L185 Difference]: Start difference. First operand has 60 places, 62 transitions, 165 flow. Second operand 3 states and 224 transitions. [2021-03-26 15:01:43,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 183 flow [2021-03-26 15:01:43,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 15:01:43,332 INFO L241 Difference]: Finished difference. Result has 63 places, 64 transitions, 186 flow [2021-03-26 15:01:43,332 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2021-03-26 15:01:43,333 INFO L343 CegarLoopForPetriNet]: 69 programPoint places, -6 predicate places. [2021-03-26 15:01:43,333 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:01:43,333 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 64 transitions, 186 flow [2021-03-26 15:01:43,334 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 64 transitions, 186 flow [2021-03-26 15:01:43,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 64 transitions, 186 flow [2021-03-26 15:01:43,359 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][50], [Black: 93#true, 72#L119true, Black: 90#(and (= y_1 y_9) (= x_0 x_8)), 95#(not f2_3)]) [2021-03-26 15:01:43,359 INFO L384 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2021-03-26 15:01:43,359 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-26 15:01:43,359 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 15:01:43,359 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 15:01:43,361 INFO L129 PetriNetUnfolder]: 92/327 cut-off events. [2021-03-26 15:01:43,361 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-03-26 15:01:43,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 327 events. 92/327 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1628 event pairs, 14 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 434. Up to 78 conditions per place. [2021-03-26 15:01:43,368 INFO L142 LiptonReduction]: Number of co-enabled transitions 2102 [2021-03-26 15:01:43,405 INFO L154 LiptonReduction]: Checked pairs total: 294 [2021-03-26 15:01:43,405 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 15:01:43,405 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-03-26 15:01:43,406 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 186 flow [2021-03-26 15:01:43,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:01:43,407 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:01:43,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 15:01:43,407 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:01:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:01:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 88735810, now seen corresponding path program 1 times [2021-03-26 15:01:43,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:01:43,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030913384] [2021-03-26 15:01:43,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:01:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:01:43,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:43,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-26 15:01:43,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:01:43,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030913384] [2021-03-26 15:01:43,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:01:43,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 15:01:43,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882119427] [2021-03-26 15:01:43,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 15:01:43,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:01:43,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 15:01:43,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 15:01:43,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-03-26 15:01:43,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:01:43,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-03-26 15:01:43,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:01:43,491 INFO L129 PetriNetUnfolder]: 150/497 cut-off events. [2021-03-26 15:01:43,491 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-03-26 15:01:43,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 497 events. 150/497 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2662 event pairs, 34 based on Foata normal form. 8/410 useless extension candidates. Maximal degree in co-relation 688. Up to 122 conditions per place. [2021-03-26 15:01:43,497 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2021-03-26 15:01:43,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 204 flow [2021-03-26 15:01:43,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 15:01:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 15:01:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-03-26 15:01:43,498 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-03-26 15:01:43,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:01:43,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,500 INFO L185 Difference]: Start difference. First operand has 63 places, 64 transitions, 186 flow. Second operand 3 states and 224 transitions. [2021-03-26 15:01:43,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 204 flow [2021-03-26 15:01:43,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 15:01:43,505 INFO L241 Difference]: Finished difference. Result has 65 places, 66 transitions, 204 flow [2021-03-26 15:01:43,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2021-03-26 15:01:43,505 INFO L343 CegarLoopForPetriNet]: 69 programPoint places, -4 predicate places. [2021-03-26 15:01:43,505 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:01:43,506 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 66 transitions, 204 flow [2021-03-26 15:01:43,507 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 66 transitions, 204 flow [2021-03-26 15:01:43,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 204 flow [2021-03-26 15:01:43,550 INFO L129 PetriNetUnfolder]: 146/481 cut-off events. [2021-03-26 15:01:43,550 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-03-26 15:01:43,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 481 events. 146/481 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2624 event pairs, 34 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 672. Up to 122 conditions per place. [2021-03-26 15:01:43,561 INFO L142 LiptonReduction]: Number of co-enabled transitions 2178 [2021-03-26 15:01:43,578 INFO L154 LiptonReduction]: Checked pairs total: 79 [2021-03-26 15:01:43,578 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 15:01:43,579 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 74 [2021-03-26 15:01:43,583 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 204 flow [2021-03-26 15:01:43,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,583 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:01:43,583 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:01:43,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 15:01:43,584 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:01:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:01:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1156811842, now seen corresponding path program 1 times [2021-03-26 15:01:43,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:01:43,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000597718] [2021-03-26 15:01:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:01:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:01:43,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:43,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-26 15:01:43,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:01:43,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000597718] [2021-03-26 15:01:43,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:01:43,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 15:01:43,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582879431] [2021-03-26 15:01:43,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 15:01:43,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:01:43,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 15:01:43,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 15:01:43,625 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-03-26 15:01:43,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:01:43,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-03-26 15:01:43,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:01:43,680 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][46], [Black: 93#true, 101#(not f1_2), Black: 99#true, 72#L119true, 107#(not f2_11), Black: 90#(and (= y_1 y_9) (= x_0 x_8))]) [2021-03-26 15:01:43,680 INFO L384 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2021-03-26 15:01:43,680 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 15:01:43,680 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-26 15:01:43,681 INFO L387 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2021-03-26 15:01:43,697 INFO L129 PetriNetUnfolder]: 204/659 cut-off events. [2021-03-26 15:01:43,698 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-03-26 15:01:43,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 659 events. 204/659 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3995 event pairs, 54 based on Foata normal form. 38/565 useless extension candidates. Maximal degree in co-relation 993. Up to 183 conditions per place. [2021-03-26 15:01:43,705 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2021-03-26 15:01:43,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 222 flow [2021-03-26 15:01:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 15:01:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 15:01:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-03-26 15:01:43,707 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-03-26 15:01:43,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:01:43,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,709 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,709 INFO L185 Difference]: Start difference. First operand has 65 places, 66 transitions, 204 flow. Second operand 3 states and 224 transitions. [2021-03-26 15:01:43,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 222 flow [2021-03-26 15:01:43,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 15:01:43,713 INFO L241 Difference]: Finished difference. Result has 67 places, 68 transitions, 222 flow [2021-03-26 15:01:43,713 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2021-03-26 15:01:43,714 INFO L343 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2021-03-26 15:01:43,714 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:01:43,714 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 68 transitions, 222 flow [2021-03-26 15:01:43,714 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 68 transitions, 222 flow [2021-03-26 15:01:43,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 68 transitions, 222 flow [2021-03-26 15:01:43,747 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][53], [Black: 93#true, Black: 99#true, 72#L119true, 107#(not f2_11), Black: 90#(and (= y_1 y_9) (= x_0 x_8)), Black: 105#true]) [2021-03-26 15:01:43,747 INFO L384 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2021-03-26 15:01:43,747 INFO L387 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2021-03-26 15:01:43,747 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 15:01:43,747 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-26 15:01:43,762 INFO L129 PetriNetUnfolder]: 208/663 cut-off events. [2021-03-26 15:01:43,762 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2021-03-26 15:01:43,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 663 events. 208/663 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4037 event pairs, 56 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 1038. Up to 185 conditions per place. [2021-03-26 15:01:43,777 INFO L142 LiptonReduction]: Number of co-enabled transitions 2288 [2021-03-26 15:01:43,824 INFO L154 LiptonReduction]: Checked pairs total: 169 [2021-03-26 15:01:43,824 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 15:01:43,824 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 110 [2021-03-26 15:01:43,826 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 222 flow [2021-03-26 15:01:43,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,826 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:01:43,826 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:01:43,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 15:01:43,827 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:01:43,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:01:43,827 INFO L82 PathProgramCache]: Analyzing trace with hash -809591954, now seen corresponding path program 1 times [2021-03-26 15:01:43,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:01:43,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693765154] [2021-03-26 15:01:43,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:01:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 15:01:43,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:43,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-03-26 15:01:43,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 15:01:43,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 15:01:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 15:01:43,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693765154] [2021-03-26 15:01:43,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 15:01:43,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 15:01:43,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147992499] [2021-03-26 15:01:43,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 15:01:43,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 15:01:43,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 15:01:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 15:01:43,869 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-03-26 15:01:43,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 15:01:43,870 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-03-26 15:01:43,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 15:01:43,959 INFO L129 PetriNetUnfolder]: 295/962 cut-off events. [2021-03-26 15:01:43,959 INFO L130 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2021-03-26 15:01:43,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 962 events. 295/962 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6868 event pairs, 96 based on Foata normal form. 32/781 useless extension candidates. Maximal degree in co-relation 1624. Up to 242 conditions per place. [2021-03-26 15:01:43,969 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2021-03-26 15:01:43,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 240 flow [2021-03-26 15:01:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 15:01:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 15:01:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-03-26 15:01:43,971 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-03-26 15:01:43,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 15:01:43,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-03-26 15:01:43,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:43,973 INFO L185 Difference]: Start difference. First operand has 67 places, 68 transitions, 222 flow. Second operand 3 states and 224 transitions. [2021-03-26 15:01:43,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 240 flow [2021-03-26 15:01:43,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 15:01:43,977 INFO L241 Difference]: Finished difference. Result has 69 places, 70 transitions, 240 flow [2021-03-26 15:01:43,977 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2021-03-26 15:01:43,977 INFO L343 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2021-03-26 15:01:43,977 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 15:01:43,978 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 70 transitions, 240 flow [2021-03-26 15:01:43,978 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 70 transitions, 240 flow [2021-03-26 15:01:43,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 70 transitions, 240 flow [2021-03-26 15:01:44,044 INFO L129 PetriNetUnfolder]: 295/962 cut-off events. [2021-03-26 15:01:44,045 INFO L130 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2021-03-26 15:01:44,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 962 events. 295/962 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6846 event pairs, 102 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 1636. Up to 242 conditions per place. [2021-03-26 15:01:44,063 INFO L142 LiptonReduction]: Number of co-enabled transitions 2380 [2021-03-26 15:01:44,111 INFO L154 LiptonReduction]: Checked pairs total: 174 [2021-03-26 15:01:44,111 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 15:01:44,111 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 134 [2021-03-26 15:01:44,113 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 240 flow [2021-03-26 15:01:44,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 15:01:44,113 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 15:01:44,114 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 15:01:44,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 15:01:44,114 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thread1Err3INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 15:01:44,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 15:01:44,114 INFO L82 PathProgramCache]: Analyzing trace with hash 857017657, now seen corresponding path program 1 times [2021-03-26 15:01:44,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 15:01:44,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398464996] [2021-03-26 15:01:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 15:01:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 15:01:44,136 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 15:01:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 15:01:44,171 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 15:01:44,202 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 15:01:44,202 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 15:01:44,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 15:01:44,263 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 03:01:44 BasicIcfg [2021-03-26 15:01:44,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 15:01:44,264 INFO L168 Benchmark]: Toolchain (without parser) took 2666.98 ms. Allocated memory was 255.9 MB in the beginning and 583.0 MB in the end (delta: 327.2 MB). Free memory was 236.3 MB in the beginning and 540.6 MB in the end (delta: -304.3 MB). Peak memory consumption was 95.9 MB. Max. memory is 16.0 GB. [2021-03-26 15:01:44,264 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 157.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 15:01:44,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.13 ms. Allocated memory is still 255.9 MB. Free memory was 236.3 MB in the beginning and 234.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 15:01:44,265 INFO L168 Benchmark]: Boogie Preprocessor took 14.61 ms. Allocated memory is still 255.9 MB. Free memory was 234.8 MB in the beginning and 233.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 15:01:44,265 INFO L168 Benchmark]: RCFGBuilder took 297.38 ms. Allocated memory is still 255.9 MB. Free memory was 233.6 MB in the beginning and 232.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.0 GB. [2021-03-26 15:01:44,265 INFO L168 Benchmark]: TraceAbstraction took 2324.00 ms. Allocated memory was 255.9 MB in the beginning and 583.0 MB in the end (delta: 327.2 MB). Free memory was 232.5 MB in the beginning and 540.6 MB in the end (delta: -308.1 MB). Peak memory consumption was 90.7 MB. Max. memory is 16.0 GB. [2021-03-26 15:01:44,266 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.14 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 157.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 21.13 ms. Allocated memory is still 255.9 MB. Free memory was 236.3 MB in the beginning and 234.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 14.61 ms. Allocated memory is still 255.9 MB. Free memory was 234.8 MB in the beginning and 233.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 297.38 ms. Allocated memory is still 255.9 MB. Free memory was 233.6 MB in the beginning and 232.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2324.00 ms. Allocated memory was 255.9 MB in the beginning and 583.0 MB in the end (delta: 327.2 MB). Free memory was 232.5 MB in the beginning and 540.6 MB in the end (delta: -308.1 MB). Peak memory consumption was 90.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 146.9ms, 70 PlacesBefore, 69 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 1888 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 600 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 308, positive: 292, positive conditional: 292, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 308, positive: 292, positive conditional: 0, positive unconditional: 292, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 308, positive: 292, positive conditional: 0, positive unconditional: 292, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 151, positive: 147, positive conditional: 0, positive unconditional: 147, 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: 151, positive: 142, positive conditional: 0, positive unconditional: 142, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 308, positive: 145, positive conditional: 0, positive unconditional: 145, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 151, unknown conditional: 0, unknown unconditional: 151] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.6ms, 60 PlacesBefore, 60 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.3ms, 63 PlacesBefore, 63 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 2102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 294 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, positive: 162, positive conditional: 162, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170, positive: 162, positive conditional: 1, positive unconditional: 161, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170, positive: 162, positive conditional: 1, positive unconditional: 161, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 101, positive: 96, positive conditional: 1, positive unconditional: 95, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 101, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 170, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 101, unknown conditional: 1, unknown unconditional: 100] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 256, Positive conditional cache size: 1, Positive unconditional cache size: 255, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 72.0ms, 65 PlacesBefore, 65 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 2178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 79 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, positive: 48, positive conditional: 3, positive unconditional: 45, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 48, positive conditional: 3, positive unconditional: 45, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 2, positive unconditional: 18, 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: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 50, positive: 28, positive conditional: 1, positive unconditional: 27, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 20, unknown conditional: 2, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 276, Positive conditional cache size: 3, Positive unconditional cache size: 273, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 109.7ms, 67 PlacesBefore, 67 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 2288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 169 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, positive: 93, positive conditional: 93, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, positive: 93, positive conditional: 5, positive unconditional: 88, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 93, positive conditional: 5, positive unconditional: 88, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 33, positive conditional: 2, positive unconditional: 31, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, positive: 60, positive conditional: 3, positive unconditional: 57, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 34, unknown conditional: 2, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 309, Positive conditional cache size: 5, Positive unconditional cache size: 304, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.3ms, 69 PlacesBefore, 69 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 2380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 174 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, positive: 101, positive conditional: 6, positive unconditional: 95, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, positive: 101, positive conditional: 6, positive unconditional: 95, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 1, positive unconditional: 15, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 105, positive: 85, positive conditional: 5, positive unconditional: 80, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 17, unknown conditional: 1, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 325, Positive conditional cache size: 6, Positive unconditional cache size: 319, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Eliminated conditions: 3 - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L30] 2 temp_4 := x_0; VAL [f1_2=false, f2_3=false, temp_4=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L31] 2 x_0 := temp_4 + 1; VAL [f1_2=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_2=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L45] 3 temp_6 := y_1; VAL [f1_2=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L46] 3 y_1 := temp_6 + 1; VAL [f1_2=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [f1_2=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L103] 4 f1_10 := false; [L104] 4 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L106] FORK 4 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L107] FORK 4 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L108] JOIN 5 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L109] JOIN 6 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L47] 3 f2_3 := true; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L32] 2 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L48] 3 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L49] 3 temp_7 := x_0; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, temp_7=0, x_0=0, x_8=-1, y_1=0, y_9=-1] [L50] 3 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L33] 2 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L51] 3 f2_3 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L34] 2 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=0, y_9=-1] [L35] 2 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L36] 2 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L52] 3 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L37] 2 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L65] JOIN 2 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L66] JOIN 3 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L119] JOIN 4 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2124.1ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 940.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 261.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 38 SDtfs, 4 SDslu, 0 SDs, 0 SdLazy, 33 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=5, InterpolantAutomatonStates: 15, 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: 21.0ms SsaConstructionTime, 89.9ms SatisfiabilityAnalysisTime, 156.5ms InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4/4 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...