/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-RepeatedSemanticLbeWithPredicates.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-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 05:34:39,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 05:34:39,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 05:34:39,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 05:34:39,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 05:34:39,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 05:34:39,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 05:34:39,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 05:34:39,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 05:34:39,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 05:34:39,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 05:34:39,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 05:34:39,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 05:34:39,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 05:34:39,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 05:34:39,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 05:34:39,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 05:34:39,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 05:34:39,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 05:34:39,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 05:34:39,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 05:34:39,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 05:34:39,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 05:34:39,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 05:34:39,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 05:34:39,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 05:34:39,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 05:34:39,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 05:34:39,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 05:34:39,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 05:34:39,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 05:34:39,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 05:34:39,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 05:34:39,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 05:34:39,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 05:34:39,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 05:34:39,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 05:34:39,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 05:34:39,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 05:34:39,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 05:34:39,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 05:34:39,538 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-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 05:34:39,567 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 05:34:39,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 05:34:39,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 05:34:39,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 05:34:39,569 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 05:34:39,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 05:34:39,570 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 05:34:39,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 05:34:39,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 05:34:39,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 05:34:39,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 05:34:39,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 05:34:39,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 05:34:39,573 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 05:34:39,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 05:34:39,573 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 05:34:39,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 05:34:39,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 05:34:39,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 05:34:39,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 05:34:39,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 05:34:39,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 05:34:39,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 05:34:39,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 05:34:39,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 05:34:39,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 05:34:39,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 05:34:39,580 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 05:34:39,581 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 05:34:39,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 05:34:39,581 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-04-29 05:34:39,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 05:34:40,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 05:34:40,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 05:34:40,020 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-04-29 05:34:40,022 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-04-29 05:34:40,023 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-04-29 05:34:40,024 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2021-04-29 05:34:40,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 05:34:40,124 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-04-29 05:34:40,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 05:34:40,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 05:34:40,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 05:34:40,149 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 29.04 05:34:40" (1/1) ... [2021-04-29 05:34:40,160 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 29.04 05:34:40" (1/1) ... [2021-04-29 05:34:40,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 05:34:40,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 05:34:40,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 05:34:40,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 05:34:40,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 05:34:40" (1/1) ... [2021-04-29 05:34:40,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 05:34:40" (1/1) ... [2021-04-29 05:34:40,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 05:34:40" (1/1) ... [2021-04-29 05:34:40,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 05:34:40" (1/1) ... [2021-04-29 05:34:40,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 05:34:40" (1/1) ... [2021-04-29 05:34:40,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 05:34:40" (1/1) ... [2021-04-29 05:34:40,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 05:34:40" (1/1) ... [2021-04-29 05:34:40,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 05:34:40,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 05:34:40,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 05:34:40,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 05:34:40,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 05:34:40" (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-04-29 05:34:40,350 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-04-29 05:34:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-04-29 05:34:40,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-04-29 05:34:40,354 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-04-29 05:34:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-04-29 05:34:40,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-04-29 05:34:40,355 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-04-29 05:34:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 05:34:40,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 05:34:40,355 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-04-29 05:34:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-04-29 05:34:40,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-04-29 05:34:40,356 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-04-29 05:34:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-04-29 05:34:40,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-04-29 05:34:40,356 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-04-29 05:34:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-04-29 05:34:40,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-04-29 05:34:40,357 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-04-29 05:34:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-04-29 05:34:40,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-04-29 05:34:40,361 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 05:34:40,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 05:34:40,631 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-04-29 05:34:40,637 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 05:34:40 BoogieIcfgContainer [2021-04-29 05:34:40,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 05:34:40,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 05:34:40,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 05:34:40,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 05:34:40,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 05:34:40" (1/2) ... [2021-04-29 05:34:40,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88d2237 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 05:34:40, skipping insertion in model container [2021-04-29 05:34:40,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 05:34:40" (2/2) ... [2021-04-29 05:34:40,658 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-04-29 05:34:40,670 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 05:34:40,682 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-04-29 05:34:40,686 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 05:34:40,895 INFO L149 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-04-29 05:34:40,923 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-04-29 05:34:40,950 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 05:34:40,950 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 05:34:40,950 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 05:34:40,951 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 05:34:40,951 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 05:34:40,951 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 05:34:40,951 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 05:34:40,951 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 05:34:40,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 218 flow [2021-04-29 05:34:41,017 INFO L129 PetriNetUnfolder]: 8/61 cut-off events. [2021-04-29 05:34:41,018 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-04-29 05:34:41,026 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-04-29 05:34:41,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 73 transitions, 218 flow [2021-04-29 05:34:41,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 59 transitions, 166 flow [2021-04-29 05:34:41,037 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 05:34:41,057 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 59 transitions, 166 flow [2021-04-29 05:34:41,062 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 59 transitions, 166 flow [2021-04-29 05:34:41,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 59 transitions, 166 flow [2021-04-29 05:34:41,094 INFO L129 PetriNetUnfolder]: 8/59 cut-off events. [2021-04-29 05:34:41,094 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-04-29 05:34:41,096 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-04-29 05:34:41,102 INFO L146 LiptonReduction]: Number of co-enabled transitions 1888 [2021-04-29 05:34:41,471 INFO L158 LiptonReduction]: Checked pairs total: 4200 [2021-04-29 05:34:41,471 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-29 05:34:41,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 440 [2021-04-29 05:34:41,549 INFO L129 PetriNetUnfolder]: 8/58 cut-off events. [2021-04-29 05:34:41,549 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-04-29 05:34:41,549 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 05:34:41,551 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-04-29 05:34:41,552 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-04-29 05:34:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 05:34:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash -871171209, now seen corresponding path program 1 times [2021-04-29 05:34:41,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 05:34:41,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429084874] [2021-04-29 05:34:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 05:34:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 05:34:41,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:41,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 05:34:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 05:34:41,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429084874] [2021-04-29 05:34:41,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 05:34:41,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 05:34:41,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806528859] [2021-04-29 05:34:41,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 05:34:41,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 05:34:41,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 05:34:41,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 05:34:41,879 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 78 [2021-04-29 05:34:41,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 166 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-04-29 05:34:41,883 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 05:34:41,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 78 [2021-04-29 05:34:41,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 05:34:42,504 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, 72#L119true, 89#true, thread6Thread1of1ForFork5NotInUse, thread2Thread1of1ForFork0NotInUse]) [2021-04-29 05:34:42,505 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-04-29 05:34:42,505 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-04-29 05:34:42,505 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-04-29 05:34:42,505 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-04-29 05:34:42,548 INFO L129 PetriNetUnfolder]: 1975/3929 cut-off events. [2021-04-29 05:34:42,549 INFO L130 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2021-04-29 05:34:42,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6573 conditions, 3929 events. 1975/3929 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 29012 event pairs, 737 based on Foata normal form. 1/3649 useless extension candidates. Maximal degree in co-relation 6543. Up to 2310 conditions per place. [2021-04-29 05:34:42,619 INFO L132 encePairwiseOnDemand]: 71/78 looper letters, 21 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2021-04-29 05:34:42,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 236 flow [2021-04-29 05:34:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 05:34:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 05:34:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2021-04-29 05:34:42,636 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8675213675213675 [2021-04-29 05:34:42,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 203 transitions. [2021-04-29 05:34:42,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 203 transitions. [2021-04-29 05:34:42,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 05:34:42,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 203 transitions. [2021-04-29 05:34:42,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 05:34:42,652 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-04-29 05:34:42,652 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-04-29 05:34:42,654 INFO L185 Difference]: Start difference. First operand has 70 places, 59 transitions, 166 flow. Second operand 3 states and 203 transitions. [2021-04-29 05:34:42,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 236 flow [2021-04-29 05:34:42,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 204 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-04-29 05:34:42,671 INFO L241 Difference]: Finished difference. Result has 61 places, 62 transitions, 165 flow [2021-04-29 05:34:42,674 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2021-04-29 05:34:42,675 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2021-04-29 05:34:42,675 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 05:34:42,675 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 62 transitions, 165 flow [2021-04-29 05:34:42,676 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 62 transitions, 165 flow [2021-04-29 05:34:42,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 62 transitions, 165 flow [2021-04-29 05:34:42,707 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[][47], [72#L119true, 89#true, Black: 91#(and (= y_1 y_9) (= x_0 x_8))]) [2021-04-29 05:34:42,707 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-04-29 05:34:42,707 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-04-29 05:34:42,707 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-04-29 05:34:42,707 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-04-29 05:34:42,710 INFO L382 tUnfolder$Statistics]: inserting event number 5 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[][47], [72#L119true, 89#true, Black: 91#(and (= y_1 y_9) (= x_0 x_8))]) [2021-04-29 05:34:42,710 INFO L384 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2021-04-29 05:34:42,711 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-04-29 05:34:42,711 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-04-29 05:34:42,711 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-04-29 05:34:42,711 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-04-29 05:34:42,711 INFO L129 PetriNetUnfolder]: 80/257 cut-off events. [2021-04-29 05:34:42,711 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 05:34:42,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 257 events. 80/257 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1183 event pairs, 6 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 313. Up to 64 conditions per place. [2021-04-29 05:34:42,721 INFO L146 LiptonReduction]: Number of co-enabled transitions 2008 [2021-04-29 05:34:42,765 INFO L158 LiptonReduction]: Checked pairs total: 1824 [2021-04-29 05:34:42,765 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 05:34:42,765 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90 [2021-04-29 05:34:42,768 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 165 flow [2021-04-29 05:34:42,769 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-04-29 05:34:42,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 05:34:42,769 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-04-29 05:34:42,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 05:34:42,770 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-04-29 05:34:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 05:34:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash -992939024, now seen corresponding path program 1 times [2021-04-29 05:34:42,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 05:34:42,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164325434] [2021-04-29 05:34:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 05:34:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 05:34:42,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:42,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 05:34:42,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:42,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-04-29 05:34:42,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:42,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 05:34:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 05:34:42,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164325434] [2021-04-29 05:34:42,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 05:34:42,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 05:34:42,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584199095] [2021-04-29 05:34:42,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 05:34:42,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 05:34:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 05:34:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 05:34:42,806 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-04-29 05:34:42,807 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-04-29 05:34:42,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 05:34:42,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-04-29 05:34:42,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 05:34:42,856 INFO L129 PetriNetUnfolder]: 101/344 cut-off events. [2021-04-29 05:34:42,856 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 05:34:42,858 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 1658 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-04-29 05:34:42,861 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2021-04-29 05:34:42,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 183 flow [2021-04-29 05:34:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 05:34:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 05:34:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-04-29 05:34:42,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-04-29 05:34:42,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-04-29 05:34:42,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-04-29 05:34:42,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 05:34:42,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-04-29 05:34:42,867 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-04-29 05:34:42,869 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-04-29 05:34:42,869 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-04-29 05:34:42,869 INFO L185 Difference]: Start difference. First operand has 60 places, 62 transitions, 165 flow. Second operand 3 states and 224 transitions. [2021-04-29 05:34:42,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 183 flow [2021-04-29 05:34:42,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 05:34:42,873 INFO L241 Difference]: Finished difference. Result has 63 places, 64 transitions, 186 flow [2021-04-29 05:34:42,873 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-04-29 05:34:42,874 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2021-04-29 05:34:42,874 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 05:34:42,874 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 64 transitions, 186 flow [2021-04-29 05:34:42,874 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 64 transitions, 186 flow [2021-04-29 05:34:42,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 64 transitions, 186 flow [2021-04-29 05:34:42,937 INFO L129 PetriNetUnfolder]: 102/337 cut-off events. [2021-04-29 05:34:42,937 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-04-29 05:34:42,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 337 events. 102/337 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1589 event pairs, 14 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 425. Up to 81 conditions per place. [2021-04-29 05:34:42,948 INFO L146 LiptonReduction]: Number of co-enabled transitions 2102 [2021-04-29 05:34:42,965 INFO L158 LiptonReduction]: Checked pairs total: 1604 [2021-04-29 05:34:42,965 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 05:34:42,965 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 91 [2021-04-29 05:34:42,968 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 186 flow [2021-04-29 05:34:42,968 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-04-29 05:34:42,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 05:34:42,969 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-04-29 05:34:42,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 05:34:42,969 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-04-29 05:34:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 05:34:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash 88735810, now seen corresponding path program 1 times [2021-04-29 05:34:42,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 05:34:42,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181707214] [2021-04-29 05:34:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 05:34:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 05:34:43,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:43,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 05:34:43,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:43,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-04-29 05:34:43,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:43,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 05:34:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 05:34:43,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181707214] [2021-04-29 05:34:43,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 05:34:43,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 05:34:43,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109295007] [2021-04-29 05:34:43,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 05:34:43,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 05:34:43,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 05:34:43,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 05:34:43,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-04-29 05:34:43,010 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-04-29 05:34:43,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 05:34:43,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-04-29 05:34:43,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 05:34:43,076 INFO L129 PetriNetUnfolder]: 150/497 cut-off events. [2021-04-29 05:34:43,077 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-04-29 05:34:43,081 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 2679 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-04-29 05:34:43,086 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2021-04-29 05:34:43,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 204 flow [2021-04-29 05:34:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 05:34:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 05:34:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-04-29 05:34:43,088 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-04-29 05:34:43,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-04-29 05:34:43,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-04-29 05:34:43,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 05:34:43,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-04-29 05:34:43,090 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-04-29 05:34:43,092 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-04-29 05:34:43,092 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-04-29 05:34:43,093 INFO L185 Difference]: Start difference. First operand has 63 places, 64 transitions, 186 flow. Second operand 3 states and 224 transitions. [2021-04-29 05:34:43,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 204 flow [2021-04-29 05:34:43,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 05:34:43,096 INFO L241 Difference]: Finished difference. Result has 65 places, 66 transitions, 204 flow [2021-04-29 05:34:43,097 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-04-29 05:34:43,097 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2021-04-29 05:34:43,097 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 05:34:43,098 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 66 transitions, 204 flow [2021-04-29 05:34:43,098 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 66 transitions, 204 flow [2021-04-29 05:34:43,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 204 flow [2021-04-29 05:34:43,154 INFO L129 PetriNetUnfolder]: 166/545 cut-off events. [2021-04-29 05:34:43,154 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-04-29 05:34:43,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 545 events. 166/545 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3045 event pairs, 32 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 708. Up to 129 conditions per place. [2021-04-29 05:34:43,172 INFO L146 LiptonReduction]: Number of co-enabled transitions 2178 [2021-04-29 05:34:43,191 INFO L158 LiptonReduction]: Checked pairs total: 1462 [2021-04-29 05:34:43,191 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 05:34:43,191 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-04-29 05:34:43,194 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 204 flow [2021-04-29 05:34:43,194 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-04-29 05:34:43,195 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 05:34:43,195 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-04-29 05:34:43,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 05:34:43,195 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-04-29 05:34:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 05:34:43,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1156811842, now seen corresponding path program 1 times [2021-04-29 05:34:43,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 05:34:43,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619080891] [2021-04-29 05:34:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 05:34:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 05:34:43,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:43,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 05:34:43,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:43,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-04-29 05:34:43,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:43,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 05:34:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 05:34:43,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619080891] [2021-04-29 05:34:43,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 05:34:43,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 05:34:43,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537356511] [2021-04-29 05:34:43,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 05:34:43,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 05:34:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 05:34:43,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 05:34:43,235 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-04-29 05:34:43,236 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-04-29 05:34:43,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 05:34:43,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-04-29 05:34:43,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 05:34:43,309 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], [133#(not f2_11), 117#(not f1_2), Black: 115#true, Black: 100#true, 72#L119true, Black: 91#(and (= y_1 y_9) (= x_0 x_8))]) [2021-04-29 05:34:43,310 INFO L384 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2021-04-29 05:34:43,310 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-04-29 05:34:43,311 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-04-29 05:34:43,311 INFO L387 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2021-04-29 05:34:43,335 INFO L129 PetriNetUnfolder]: 204/659 cut-off events. [2021-04-29 05:34:43,335 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-04-29 05:34:43,340 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 3985 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-04-29 05:34:43,346 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2021-04-29 05:34:43,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 222 flow [2021-04-29 05:34:43,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 05:34:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 05:34:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-04-29 05:34:43,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-04-29 05:34:43,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-04-29 05:34:43,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-04-29 05:34:43,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 05:34:43,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-04-29 05:34:43,352 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-04-29 05:34:43,354 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-04-29 05:34:43,355 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-04-29 05:34:43,355 INFO L185 Difference]: Start difference. First operand has 65 places, 66 transitions, 204 flow. Second operand 3 states and 224 transitions. [2021-04-29 05:34:43,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 222 flow [2021-04-29 05:34:43,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 05:34:43,362 INFO L241 Difference]: Finished difference. Result has 67 places, 68 transitions, 222 flow [2021-04-29 05:34:43,363 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-04-29 05:34:43,363 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2021-04-29 05:34:43,363 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 05:34:43,364 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 68 transitions, 222 flow [2021-04-29 05:34:43,364 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 68 transitions, 222 flow [2021-04-29 05:34:43,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 68 transitions, 222 flow [2021-04-29 05:34:43,429 INFO L129 PetriNetUnfolder]: 162/607 cut-off events. [2021-04-29 05:34:43,430 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2021-04-29 05:34:43,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 607 events. 162/607 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3962 event pairs, 46 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 952. Up to 154 conditions per place. [2021-04-29 05:34:43,448 INFO L146 LiptonReduction]: Number of co-enabled transitions 2288 [2021-04-29 05:34:43,467 INFO L158 LiptonReduction]: Checked pairs total: 1190 [2021-04-29 05:34:43,467 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 05:34:43,467 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 104 [2021-04-29 05:34:43,473 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 222 flow [2021-04-29 05:34:43,473 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-04-29 05:34:43,473 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 05:34:43,474 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-04-29 05:34:43,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 05:34:43,474 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-04-29 05:34:43,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 05:34:43,477 INFO L82 PathProgramCache]: Analyzing trace with hash -809591954, now seen corresponding path program 1 times [2021-04-29 05:34:43,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 05:34:43,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570515465] [2021-04-29 05:34:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 05:34:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 05:34:43,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:43,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 05:34:43,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:43,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-04-29 05:34:43,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 05:34:43,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 05:34:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 05:34:43,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570515465] [2021-04-29 05:34:43,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 05:34:43,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 05:34:43,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866362194] [2021-04-29 05:34:43,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 05:34:43,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 05:34:43,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 05:34:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 05:34:43,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 78 [2021-04-29 05:34:43,522 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-04-29 05:34:43,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 05:34:43,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 78 [2021-04-29 05:34:43,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 05:34:43,639 INFO L129 PetriNetUnfolder]: 295/962 cut-off events. [2021-04-29 05:34:43,640 INFO L130 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2021-04-29 05:34:43,647 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 6845 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-04-29 05:34:43,655 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 3 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2021-04-29 05:34:43,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 240 flow [2021-04-29 05:34:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 05:34:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 05:34:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-04-29 05:34:43,657 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2021-04-29 05:34:43,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-04-29 05:34:43,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-04-29 05:34:43,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 05:34:43,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-04-29 05:34:43,659 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-04-29 05:34:43,660 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-04-29 05:34:43,661 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-04-29 05:34:43,661 INFO L185 Difference]: Start difference. First operand has 67 places, 68 transitions, 222 flow. Second operand 3 states and 224 transitions. [2021-04-29 05:34:43,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 240 flow [2021-04-29 05:34:43,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 05:34:43,666 INFO L241 Difference]: Finished difference. Result has 69 places, 70 transitions, 240 flow [2021-04-29 05:34:43,666 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-04-29 05:34:43,667 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2021-04-29 05:34:43,667 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 05:34:43,667 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 70 transitions, 240 flow [2021-04-29 05:34:43,668 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 70 transitions, 240 flow [2021-04-29 05:34:43,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 70 transitions, 240 flow [2021-04-29 05:34:43,777 INFO L129 PetriNetUnfolder]: 290/932 cut-off events. [2021-04-29 05:34:43,778 INFO L130 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2021-04-29 05:34:43,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 932 events. 290/932 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6594 event pairs, 94 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 1581. Up to 242 conditions per place. [2021-04-29 05:34:43,807 INFO L146 LiptonReduction]: Number of co-enabled transitions 2380 [2021-04-29 05:34:43,828 INFO L158 LiptonReduction]: Checked pairs total: 1004 [2021-04-29 05:34:43,829 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 05:34:43,829 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 162 [2021-04-29 05:34:43,832 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 240 flow [2021-04-29 05:34:43,832 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-04-29 05:34:43,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 05:34:43,833 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-04-29 05:34:43,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 05:34:43,833 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-04-29 05:34:43,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 05:34:43,834 INFO L82 PathProgramCache]: Analyzing trace with hash 857017657, now seen corresponding path program 1 times [2021-04-29 05:34:43,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 05:34:43,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731320860] [2021-04-29 05:34:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 05:34:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 05:34:43,851 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 05:34:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 05:34:43,872 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 05:34:43,902 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 05:34:43,902 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 05:34:43,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-29 05:34:43,973 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 05:34:43 BasicIcfg [2021-04-29 05:34:43,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 05:34:43,978 INFO L168 Benchmark]: Toolchain (without parser) took 3911.84 ms. Allocated memory was 302.0 MB in the beginning and 381.7 MB in the end (delta: 79.7 MB). Free memory was 271.1 MB in the beginning and 156.6 MB in the end (delta: 114.5 MB). Peak memory consumption was 193.8 MB. Max. memory is 16.0 GB. [2021-04-29 05:34:43,979 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.34 ms. Allocated memory is still 302.0 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 05:34:43,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.82 ms. Allocated memory is still 302.0 MB. Free memory was 285.2 MB in the beginning and 283.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 05:34:43,983 INFO L168 Benchmark]: Boogie Preprocessor took 42.76 ms. Allocated memory is still 302.0 MB. Free memory was 283.7 MB in the beginning and 282.7 MB in the end (delta: 991.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 05:34:43,984 INFO L168 Benchmark]: RCFGBuilder took 420.15 ms. Allocated memory is still 302.0 MB. Free memory was 282.7 MB in the beginning and 274.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. [2021-04-29 05:34:43,987 INFO L168 Benchmark]: TraceAbstraction took 3332.02 ms. Allocated memory was 302.0 MB in the beginning and 381.7 MB in the end (delta: 79.7 MB). Free memory was 273.5 MB in the beginning and 156.6 MB in the end (delta: 116.9 MB). Peak memory consumption was 197.3 MB. Max. memory is 16.0 GB. [2021-04-29 05:34:43,994 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.34 ms. Allocated memory is still 302.0 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.82 ms. Allocated memory is still 302.0 MB. Free memory was 285.2 MB in the beginning and 283.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.76 ms. Allocated memory is still 302.0 MB. Free memory was 283.7 MB in the beginning and 282.7 MB in the end (delta: 991.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 420.15 ms. Allocated memory is still 302.0 MB. Free memory was 282.7 MB in the beginning and 274.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3332.02 ms. Allocated memory was 302.0 MB in the beginning and 381.7 MB in the end (delta: 79.7 MB). Free memory was 273.5 MB in the beginning and 156.6 MB in the end (delta: 116.9 MB). Peak memory consumption was 197.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 408.8ms, 70 PlacesBefore, 70 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1888 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4200 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2115, positive: 2003, positive conditional: 2003, positive unconditional: 0, negative: 112, negative conditional: 112, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 917, positive: 883, positive conditional: 0, positive unconditional: 883, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 917, positive: 883, positive conditional: 0, positive unconditional: 883, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 917, positive: 871, positive conditional: 0, positive unconditional: 871, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 206, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2115, positive: 1120, positive conditional: 1120, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 917, unknown conditional: 917, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 917, Positive cache size: 883, Positive conditional cache size: 883, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 89.4ms, 61 PlacesBefore, 60 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1824 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 960, positive: 912, positive conditional: 912, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, positive: 210, positive conditional: 6, positive unconditional: 204, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 218, positive: 210, positive conditional: 6, positive unconditional: 204, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 218, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 960, positive: 702, positive conditional: 702, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 218, unknown conditional: 218, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1135, Positive cache size: 1093, Positive conditional cache size: 1093, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.8ms, 63 PlacesBefore, 63 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 2102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1604 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 853, positive: 812, positive conditional: 812, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, positive: 103, positive conditional: 9, positive unconditional: 94, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 103, positive: 103, positive conditional: 9, positive unconditional: 94, 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: 103, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 853, positive: 709, positive conditional: 709, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 103, unknown conditional: 103, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1238, Positive cache size: 1196, Positive conditional cache size: 1196, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.3ms, 65 PlacesBefore, 65 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 2178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1462 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 789, positive: 753, positive conditional: 753, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, positive: 131, positive conditional: 10, positive unconditional: 121, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 131, positive: 131, positive conditional: 10, positive unconditional: 121, 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: 131, positive: 131, positive conditional: 0, positive unconditional: 131, 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: 789, positive: 622, positive conditional: 622, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1369, Positive cache size: 1327, Positive conditional cache size: 1327, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 102.5ms, 67 PlacesBefore, 67 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 2288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1190 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 577, positive: 548, positive conditional: 548, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 1, positive unconditional: 46, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 1, positive unconditional: 46, 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: 47, positive: 47, positive conditional: 0, positive unconditional: 47, 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: 577, positive: 501, positive conditional: 501, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1416, Positive cache size: 1374, Positive conditional cache size: 1374, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 161.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, 1004 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 524, positive: 500, positive conditional: 500, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, positive: 63, positive conditional: 12, positive unconditional: 51, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 63, positive: 63, positive conditional: 12, positive unconditional: 51, 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: 63, positive: 63, positive conditional: 0, positive unconditional: 63, 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: 524, positive: 437, positive conditional: 437, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 63, unknown conditional: 63, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1479, Positive cache size: 1437, Positive conditional cache size: 1437, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - 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: 38.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2959.2ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1237.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 558.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 39 SDtfs, 4 SDslu, 0 SDs, 0 SdLazy, 34 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.4ms 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: 26.9ms SsaConstructionTime, 81.7ms SatisfiabilityAnalysisTime, 222.8ms 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...