./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:11:10,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:11:10,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:11:10,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:11:10,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:11:10,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:11:10,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:11:10,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:11:10,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:11:10,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:11:10,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:11:10,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:11:10,134 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:11:10,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:11:10,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:11:10,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:11:10,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:11:10,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:11:10,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:11:10,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:11:10,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:11:10,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:11:10,140 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:11:10,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:11:10,140 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:11:10,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:11:10,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:11:10,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:11:10,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:11:10,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:11:10,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:11:10,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:11:10,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:11:10,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:11:10,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:11:10,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:11:10,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:11:10,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:11:10,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:11:10,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:11:10,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:11:10,145 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2024-10-14 17:11:10,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:11:10,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:11:10,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:11:10,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:11:10,422 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:11:10,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2024-10-14 17:11:11,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:11:12,133 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:11:12,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2024-10-14 17:11:12,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c06127b2/68fcfc5ddc604481905503eb5186130f/FLAGb2f7c6936 [2024-10-14 17:11:12,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c06127b2/68fcfc5ddc604481905503eb5186130f [2024-10-14 17:11:12,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:11:12,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:11:12,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:11:12,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:11:12,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:11:12,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f876387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12, skipping insertion in model container [2024-10-14 17:11:12,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:11:12,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:11:12,385 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:11:12,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:11:12,433 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:11:12,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12 WrapperNode [2024-10-14 17:11:12,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:11:12,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:11:12,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:11:12,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:11:12,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,484 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 213 [2024-10-14 17:11:12,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:11:12,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:11:12,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:11:12,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:11:12,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:11:12,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:11:12,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:11:12,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:11:12,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (1/1) ... [2024-10-14 17:11:12,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:11:12,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:11:12,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:11:12,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:11:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:11:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:11:12,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:11:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:11:12,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:11:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:11:12,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:11:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-14 17:11:12,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-14 17:11:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:11:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-10-14 17:11:12,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-10-14 17:11:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-10-14 17:11:12,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-10-14 17:11:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:11:12,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:11:12,625 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:11:12,744 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:11:12,746 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:11:13,230 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:11:13,231 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:11:13,264 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:11:13,265 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 17:11:13,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:13 BoogieIcfgContainer [2024-10-14 17:11:13,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:11:13,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:11:13,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:11:13,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:11:13,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:11:12" (1/3) ... [2024-10-14 17:11:13,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559f0b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:13, skipping insertion in model container [2024-10-14 17:11:13,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:12" (2/3) ... [2024-10-14 17:11:13,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559f0b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:13, skipping insertion in model container [2024-10-14 17:11:13,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:13" (3/3) ... [2024-10-14 17:11:13,276 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-10-14 17:11:13,293 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:11:13,294 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2024-10-14 17:11:13,294 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:11:13,423 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-10-14 17:11:13,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 415 transitions, 872 flow [2024-10-14 17:11:13,702 INFO L124 PetriNetUnfolderBase]: 24/409 cut-off events. [2024-10-14 17:11:13,705 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:11:13,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 409 events. 24/409 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 832 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2024-10-14 17:11:13,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 415 transitions, 872 flow [2024-10-14 17:11:13,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 382 transitions, 800 flow [2024-10-14 17:11:13,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:11:13,748 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3803d558, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:11:13,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2024-10-14 17:11:13,754 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:11:13,757 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-14 17:11:13,758 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:11:13,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:13,758 INFO L204 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] [2024-10-14 17:11:13,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:13,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1565727841, now seen corresponding path program 1 times [2024-10-14 17:11:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:13,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268474839] [2024-10-14 17:11:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:13,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:13,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268474839] [2024-10-14 17:11:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268474839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:13,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:13,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:13,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483933361] [2024-10-14 17:11:13,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:14,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:14,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-14 17:11:14,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:14,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:14,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-14 17:11:14,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:14,291 INFO L124 PetriNetUnfolderBase]: 40/509 cut-off events. [2024-10-14 17:11:14,293 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-14 17:11:14,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 509 events. 40/509 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1797 event pairs, 20 based on Foata normal form. 91/490 useless extension candidates. Maximal degree in co-relation 460. Up to 68 conditions per place. [2024-10-14 17:11:14,307 INFO L140 encePairwiseOnDemand]: 405/415 looper letters, 22 selfloop transitions, 2 changer transitions 1/374 dead transitions. [2024-10-14 17:11:14,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 374 transitions, 832 flow [2024-10-14 17:11:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-14 17:11:14,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-14 17:11:14,338 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 800 flow. Second operand 3 states and 1172 transitions. [2024-10-14 17:11:14,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 374 transitions, 832 flow [2024-10-14 17:11:14,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 808 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-10-14 17:11:14,355 INFO L231 Difference]: Finished difference. Result has 368 places, 373 transitions, 762 flow [2024-10-14 17:11:14,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=368, PETRI_TRANSITIONS=373} [2024-10-14 17:11:14,362 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -11 predicate places. [2024-10-14 17:11:14,363 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 373 transitions, 762 flow [2024-10-14 17:11:14,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:14,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:14,365 INFO L204 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] [2024-10-14 17:11:14,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:11:14,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:14,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1180634064, now seen corresponding path program 1 times [2024-10-14 17:11:14,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:14,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374991985] [2024-10-14 17:11:14,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:14,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:14,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:14,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374991985] [2024-10-14 17:11:14,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374991985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:14,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:14,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:14,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804866472] [2024-10-14 17:11:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:14,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:14,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:14,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:14,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:14,499 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-14 17:11:14,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 373 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:14,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:14,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-14 17:11:14,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:14,611 INFO L124 PetriNetUnfolderBase]: 40/507 cut-off events. [2024-10-14 17:11:14,611 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:11:14,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 507 events. 40/507 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1725 event pairs, 20 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 569. Up to 68 conditions per place. [2024-10-14 17:11:14,619 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-14 17:11:14,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 808 flow [2024-10-14 17:11:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-14 17:11:14,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-14 17:11:14,623 INFO L175 Difference]: Start difference. First operand has 368 places, 373 transitions, 762 flow. Second operand 3 states and 1165 transitions. [2024-10-14 17:11:14,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 808 flow [2024-10-14 17:11:14,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:14,630 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 760 flow [2024-10-14 17:11:14,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2024-10-14 17:11:14,631 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -13 predicate places. [2024-10-14 17:11:14,632 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 760 flow [2024-10-14 17:11:14,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:14,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:14,633 INFO L204 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, 1, 1] [2024-10-14 17:11:14,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:11:14,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:14,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1441696400, now seen corresponding path program 1 times [2024-10-14 17:11:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4775377] [2024-10-14 17:11:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:14,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:14,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4775377] [2024-10-14 17:11:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4775377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:14,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:14,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:14,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958866038] [2024-10-14 17:11:14,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:14,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:14,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:14,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:14,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:14,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-14 17:11:14,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:14,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:14,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-14 17:11:14,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:14,827 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2024-10-14 17:11:14,828 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-14 17:11:14,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 488 events. 40/488 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1570 event pairs, 20 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 539. Up to 68 conditions per place. [2024-10-14 17:11:14,836 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-10-14 17:11:14,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 371 transitions, 806 flow [2024-10-14 17:11:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-14 17:11:14,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-14 17:11:14,840 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 760 flow. Second operand 3 states and 1165 transitions. [2024-10-14 17:11:14,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 371 transitions, 806 flow [2024-10-14 17:11:14,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:14,847 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 758 flow [2024-10-14 17:11:14,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2024-10-14 17:11:14,849 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -14 predicate places. [2024-10-14 17:11:14,849 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 758 flow [2024-10-14 17:11:14,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:14,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:14,850 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:14,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:11:14,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:14,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1104223108, now seen corresponding path program 1 times [2024-10-14 17:11:14,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:14,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001252383] [2024-10-14 17:11:14,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:14,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:14,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:14,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001252383] [2024-10-14 17:11:14,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001252383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:14,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612251943] [2024-10-14 17:11:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:14,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:14,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-14 17:11:14,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:14,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:14,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-14 17:11:14,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:15,042 INFO L124 PetriNetUnfolderBase]: 40/469 cut-off events. [2024-10-14 17:11:15,042 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-14 17:11:15,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 469 events. 40/469 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1389 event pairs, 20 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 509. Up to 68 conditions per place. [2024-10-14 17:11:15,050 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2024-10-14 17:11:15,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 370 transitions, 804 flow [2024-10-14 17:11:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-14 17:11:15,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-14 17:11:15,054 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 758 flow. Second operand 3 states and 1165 transitions. [2024-10-14 17:11:15,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 370 transitions, 804 flow [2024-10-14 17:11:15,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 370 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:15,060 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 756 flow [2024-10-14 17:11:15,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2024-10-14 17:11:15,064 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -15 predicate places. [2024-10-14 17:11:15,065 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 756 flow [2024-10-14 17:11:15,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:15,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:15,066 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:15,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:11:15,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash -514687363, now seen corresponding path program 1 times [2024-10-14 17:11:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:15,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575298500] [2024-10-14 17:11:15,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:15,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575298500] [2024-10-14 17:11:15,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575298500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:15,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:15,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:15,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782247887] [2024-10-14 17:11:15,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:15,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:15,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-14 17:11:15,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:15,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:15,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-14 17:11:15,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:15,266 INFO L124 PetriNetUnfolderBase]: 40/450 cut-off events. [2024-10-14 17:11:15,267 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-14 17:11:15,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 450 events. 40/450 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1208 event pairs, 20 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 479. Up to 68 conditions per place. [2024-10-14 17:11:15,275 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-10-14 17:11:15,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 369 transitions, 802 flow [2024-10-14 17:11:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-14 17:11:15,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-14 17:11:15,279 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 756 flow. Second operand 3 states and 1165 transitions. [2024-10-14 17:11:15,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 369 transitions, 802 flow [2024-10-14 17:11:15,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 369 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:15,286 INFO L231 Difference]: Finished difference. Result has 363 places, 369 transitions, 754 flow [2024-10-14 17:11:15,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=363, PETRI_TRANSITIONS=369} [2024-10-14 17:11:15,290 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -16 predicate places. [2024-10-14 17:11:15,290 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 369 transitions, 754 flow [2024-10-14 17:11:15,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:15,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:15,292 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:15,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:11:15,293 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:15,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1371466741, now seen corresponding path program 1 times [2024-10-14 17:11:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223189348] [2024-10-14 17:11:15,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:15,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:15,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223189348] [2024-10-14 17:11:15,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223189348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:15,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:15,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748800461] [2024-10-14 17:11:15,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:15,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:15,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:15,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:15,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-14 17:11:15,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 369 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:15,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:15,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-14 17:11:15,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:15,501 INFO L124 PetriNetUnfolderBase]: 40/431 cut-off events. [2024-10-14 17:11:15,501 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-14 17:11:15,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 431 events. 40/431 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1039 event pairs, 20 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 449. Up to 68 conditions per place. [2024-10-14 17:11:15,506 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-10-14 17:11:15,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 368 transitions, 800 flow [2024-10-14 17:11:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-14 17:11:15,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-14 17:11:15,510 INFO L175 Difference]: Start difference. First operand has 363 places, 369 transitions, 754 flow. Second operand 3 states and 1165 transitions. [2024-10-14 17:11:15,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 368 transitions, 800 flow [2024-10-14 17:11:15,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 368 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:15,517 INFO L231 Difference]: Finished difference. Result has 362 places, 368 transitions, 752 flow [2024-10-14 17:11:15,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=362, PETRI_TRANSITIONS=368} [2024-10-14 17:11:15,518 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -17 predicate places. [2024-10-14 17:11:15,518 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 368 transitions, 752 flow [2024-10-14 17:11:15,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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) [2024-10-14 17:11:15,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:15,520 INFO L204 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, 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] [2024-10-14 17:11:15,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:11:15,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:15,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:15,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1950963730, now seen corresponding path program 1 times [2024-10-14 17:11:15,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:15,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081409931] [2024-10-14 17:11:15,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:15,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:15,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:15,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081409931] [2024-10-14 17:11:15,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081409931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:15,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:15,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198407149] [2024-10-14 17:11:15,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:15,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:15,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:15,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:15,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 415 [2024-10-14 17:11:15,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 368 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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) [2024-10-14 17:11:15,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:15,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 415 [2024-10-14 17:11:15,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:16,453 INFO L124 PetriNetUnfolderBase]: 758/4767 cut-off events. [2024-10-14 17:11:16,454 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-14 17:11:16,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 4767 events. 758/4767 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 46256 event pairs, 387 based on Foata normal form. 0/3500 useless extension candidates. Maximal degree in co-relation 5709. Up to 942 conditions per place. [2024-10-14 17:11:16,530 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 27 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-10-14 17:11:16,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 367 transitions, 808 flow [2024-10-14 17:11:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2024-10-14 17:11:16,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.927710843373494 [2024-10-14 17:11:16,534 INFO L175 Difference]: Start difference. First operand has 362 places, 368 transitions, 752 flow. Second operand 3 states and 1155 transitions. [2024-10-14 17:11:16,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 367 transitions, 808 flow [2024-10-14 17:11:16,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 367 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:16,541 INFO L231 Difference]: Finished difference. Result has 361 places, 367 transitions, 750 flow [2024-10-14 17:11:16,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=361, PETRI_TRANSITIONS=367} [2024-10-14 17:11:16,542 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -18 predicate places. [2024-10-14 17:11:16,542 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 367 transitions, 750 flow [2024-10-14 17:11:16,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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) [2024-10-14 17:11:16,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:16,544 INFO L204 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, 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] [2024-10-14 17:11:16,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:11:16,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:16,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash 41775280, now seen corresponding path program 1 times [2024-10-14 17:11:16,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:16,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822615962] [2024-10-14 17:11:16,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:16,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:16,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822615962] [2024-10-14 17:11:16,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822615962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:16,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:16,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:16,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002869891] [2024-10-14 17:11:16,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:16,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:16,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:16,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:16,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-14 17:11:16,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 367 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:16,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:16,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-14 17:11:16,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:16,761 INFO L124 PetriNetUnfolderBase]: 55/497 cut-off events. [2024-10-14 17:11:16,761 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:11:16,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 497 events. 55/497 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1863 event pairs, 30 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 569. Up to 90 conditions per place. [2024-10-14 17:11:16,767 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/367 dead transitions. [2024-10-14 17:11:16,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 819 flow [2024-10-14 17:11:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-10-14 17:11:16,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2024-10-14 17:11:16,771 INFO L175 Difference]: Start difference. First operand has 361 places, 367 transitions, 750 flow. Second operand 3 states and 1160 transitions. [2024-10-14 17:11:16,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 819 flow [2024-10-14 17:11:16,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:16,778 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 747 flow [2024-10-14 17:11:16,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=356, PETRI_TRANSITIONS=362} [2024-10-14 17:11:16,779 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -23 predicate places. [2024-10-14 17:11:16,780 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 747 flow [2024-10-14 17:11:16,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:16,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:16,781 INFO L204 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, 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] [2024-10-14 17:11:16,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:11:16,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:16,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:16,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1491364395, now seen corresponding path program 1 times [2024-10-14 17:11:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:16,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263450591] [2024-10-14 17:11:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:16,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263450591] [2024-10-14 17:11:16,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263450591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:16,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:16,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:16,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118243004] [2024-10-14 17:11:16,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:16,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:16,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:16,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:16,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:16,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-14 17:11:16,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 362 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:16,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:16,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-14 17:11:16,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:16,923 INFO L124 PetriNetUnfolderBase]: 55/492 cut-off events. [2024-10-14 17:11:16,924 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-14 17:11:16,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 492 events. 55/492 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1805 event pairs, 30 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 552. Up to 90 conditions per place. [2024-10-14 17:11:16,930 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/362 dead transitions. [2024-10-14 17:11:16,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 362 transitions, 816 flow [2024-10-14 17:11:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-10-14 17:11:16,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2024-10-14 17:11:16,934 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 747 flow. Second operand 3 states and 1160 transitions. [2024-10-14 17:11:16,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 362 transitions, 816 flow [2024-10-14 17:11:16,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 362 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:11:16,940 INFO L231 Difference]: Finished difference. Result has 352 places, 357 transitions, 745 flow [2024-10-14 17:11:16,941 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=352, PETRI_TRANSITIONS=357} [2024-10-14 17:11:16,941 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -27 predicate places. [2024-10-14 17:11:16,941 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 357 transitions, 745 flow [2024-10-14 17:11:16,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:16,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:16,943 INFO L204 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, 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, 1, 1] [2024-10-14 17:11:16,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:11:16,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:16,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash 543420411, now seen corresponding path program 1 times [2024-10-14 17:11:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:16,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397279718] [2024-10-14 17:11:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:16,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:16,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:16,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397279718] [2024-10-14 17:11:16,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397279718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:16,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:16,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905834714] [2024-10-14 17:11:16,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:16,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:16,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:16,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:17,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-14 17:11:17,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 357 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:17,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:17,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-14 17:11:17,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:17,170 INFO L124 PetriNetUnfolderBase]: 66/657 cut-off events. [2024-10-14 17:11:17,170 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-14 17:11:17,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 657 events. 66/657 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2897 event pairs, 5 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 729. Up to 95 conditions per place. [2024-10-14 17:11:17,180 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 32 selfloop transitions, 3 changer transitions 0/360 dead transitions. [2024-10-14 17:11:17,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 360 transitions, 829 flow [2024-10-14 17:11:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-10-14 17:11:17,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934136546184739 [2024-10-14 17:11:17,184 INFO L175 Difference]: Start difference. First operand has 352 places, 357 transitions, 745 flow. Second operand 3 states and 1163 transitions. [2024-10-14 17:11:17,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 360 transitions, 829 flow [2024-10-14 17:11:17,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 360 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:11:17,191 INFO L231 Difference]: Finished difference. Result has 348 places, 352 transitions, 743 flow [2024-10-14 17:11:17,192 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=348, PETRI_TRANSITIONS=352} [2024-10-14 17:11:17,194 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -31 predicate places. [2024-10-14 17:11:17,194 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 352 transitions, 743 flow [2024-10-14 17:11:17,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:17,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:17,195 INFO L204 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, 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, 1, 1, 1, 1] [2024-10-14 17:11:17,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:11:17,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:17,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:17,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1758969797, now seen corresponding path program 1 times [2024-10-14 17:11:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:17,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842787905] [2024-10-14 17:11:17,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:17,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:17,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842787905] [2024-10-14 17:11:17,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842787905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:17,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:17,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:17,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832465256] [2024-10-14 17:11:17,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:17,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:17,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:17,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:17,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-14 17:11:17,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 352 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:17,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:17,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-14 17:11:17,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:17,460 INFO L124 PetriNetUnfolderBase]: 105/838 cut-off events. [2024-10-14 17:11:17,460 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-14 17:11:17,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 838 events. 105/838 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4298 event pairs, 49 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 766. Up to 155 conditions per place. [2024-10-14 17:11:17,476 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 0/356 dead transitions. [2024-10-14 17:11:17,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 356 transitions, 832 flow [2024-10-14 17:11:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2024-10-14 17:11:17,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9349397590361446 [2024-10-14 17:11:17,480 INFO L175 Difference]: Start difference. First operand has 348 places, 352 transitions, 743 flow. Second operand 3 states and 1164 transitions. [2024-10-14 17:11:17,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 356 transitions, 832 flow [2024-10-14 17:11:17,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 356 transitions, 829 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:11:17,487 INFO L231 Difference]: Finished difference. Result has 344 places, 347 transitions, 741 flow [2024-10-14 17:11:17,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=344, PETRI_TRANSITIONS=347} [2024-10-14 17:11:17,488 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -35 predicate places. [2024-10-14 17:11:17,488 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 347 transitions, 741 flow [2024-10-14 17:11:17,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:17,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:17,489 INFO L204 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, 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, 1, 1, 1, 1] [2024-10-14 17:11:17,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:11:17,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:17,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1762512143, now seen corresponding path program 1 times [2024-10-14 17:11:17,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:17,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292882107] [2024-10-14 17:11:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:17,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:17,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:17,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292882107] [2024-10-14 17:11:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292882107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:17,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:17,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873735895] [2024-10-14 17:11:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:17,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:17,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:17,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:17,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-14 17:11:17,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 347 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:17,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:17,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-14 17:11:17,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:17,802 INFO L124 PetriNetUnfolderBase]: 123/1078 cut-off events. [2024-10-14 17:11:17,802 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-14 17:11:17,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 1078 events. 123/1078 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6159 event pairs, 45 based on Foata normal form. 0/955 useless extension candidates. Maximal degree in co-relation 940. Up to 176 conditions per place. [2024-10-14 17:11:17,816 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 34 selfloop transitions, 3 changer transitions 0/352 dead transitions. [2024-10-14 17:11:17,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 352 transitions, 835 flow [2024-10-14 17:11:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-14 17:11:17,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-14 17:11:17,820 INFO L175 Difference]: Start difference. First operand has 344 places, 347 transitions, 741 flow. Second operand 3 states and 1165 transitions. [2024-10-14 17:11:17,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 352 transitions, 835 flow [2024-10-14 17:11:17,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 352 transitions, 832 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:11:17,826 INFO L231 Difference]: Finished difference. Result has 340 places, 342 transitions, 739 flow [2024-10-14 17:11:17,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=340, PETRI_TRANSITIONS=342} [2024-10-14 17:11:17,827 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -39 predicate places. [2024-10-14 17:11:17,827 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 342 transitions, 739 flow [2024-10-14 17:11:17,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:17,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:17,828 INFO L204 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, 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, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:17,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:11:17,829 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:17,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1557032482, now seen corresponding path program 1 times [2024-10-14 17:11:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:17,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114850775] [2024-10-14 17:11:17,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:17,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:17,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:17,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114850775] [2024-10-14 17:11:17,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114850775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:17,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:17,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150735141] [2024-10-14 17:11:17,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:17,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:17,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:17,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:17,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:17,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-14 17:11:17,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 342 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:17,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:17,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-14 17:11:17,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:18,085 INFO L124 PetriNetUnfolderBase]: 175/1203 cut-off events. [2024-10-14 17:11:18,085 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2024-10-14 17:11:18,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 1203 events. 175/1203 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7241 event pairs, 50 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 921. Up to 269 conditions per place. [2024-10-14 17:11:18,103 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 8/348 dead transitions. [2024-10-14 17:11:18,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 348 transitions, 836 flow [2024-10-14 17:11:18,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-14 17:11:18,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-14 17:11:18,107 INFO L175 Difference]: Start difference. First operand has 340 places, 342 transitions, 739 flow. Second operand 3 states and 1165 transitions. [2024-10-14 17:11:18,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 348 transitions, 836 flow [2024-10-14 17:11:18,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 348 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:11:18,113 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 721 flow [2024-10-14 17:11:18,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2024-10-14 17:11:18,115 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -43 predicate places. [2024-10-14 17:11:18,115 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 721 flow [2024-10-14 17:11:18,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2024-10-14 17:11:18,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:18,116 INFO L204 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:18,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:11:18,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:18,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1701355753, now seen corresponding path program 1 times [2024-10-14 17:11:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:18,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190776060] [2024-10-14 17:11:18,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190776060] [2024-10-14 17:11:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190776060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:18,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:18,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627464619] [2024-10-14 17:11:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:18,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:18,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:18,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 415 [2024-10-14 17:11:18,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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) [2024-10-14 17:11:18,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:18,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 415 [2024-10-14 17:11:18,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:26,656 INFO L124 PetriNetUnfolderBase]: 17906/60994 cut-off events. [2024-10-14 17:11:26,656 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2024-10-14 17:11:27,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89458 conditions, 60994 events. 17906/60994 cut-off events. For 1608/1608 co-relation queries the response was YES. Maximal size of possible extension queue 2244. Compared 866440 event pairs, 8762 based on Foata normal form. 1/52712 useless extension candidates. Maximal degree in co-relation 34103. Up to 21614 conditions per place. [2024-10-14 17:11:27,884 INFO L140 encePairwiseOnDemand]: 397/415 looper letters, 29 selfloop transitions, 6 changer transitions 58/328 dead transitions. [2024-10-14 17:11:27,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 328 transitions, 818 flow [2024-10-14 17:11:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2024-10-14 17:11:27,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9076305220883534 [2024-10-14 17:11:27,888 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 721 flow. Second operand 3 states and 1130 transitions. [2024-10-14 17:11:27,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 328 transitions, 818 flow [2024-10-14 17:11:28,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 328 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:11:28,019 INFO L231 Difference]: Finished difference. Result has 319 places, 265 transitions, 619 flow [2024-10-14 17:11:28,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=319, PETRI_TRANSITIONS=265} [2024-10-14 17:11:28,021 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -60 predicate places. [2024-10-14 17:11:28,021 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 265 transitions, 619 flow [2024-10-14 17:11:28,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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) [2024-10-14 17:11:28,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:28,022 INFO L204 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, 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, 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] [2024-10-14 17:11:28,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:11:28,023 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:28,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash -816999710, now seen corresponding path program 1 times [2024-10-14 17:11:28,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:28,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924801862] [2024-10-14 17:11:28,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:28,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924801862] [2024-10-14 17:11:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924801862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447082834] [2024-10-14 17:11:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:28,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:28,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:28,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:28,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-14 17:11:28,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 265 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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) [2024-10-14 17:11:28,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:28,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-14 17:11:28,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:29,116 INFO L124 PetriNetUnfolderBase]: 1604/7454 cut-off events. [2024-10-14 17:11:29,117 INFO L125 PetriNetUnfolderBase]: For 33/49 co-relation queries the response was YES. [2024-10-14 17:11:29,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10493 conditions, 7454 events. 1604/7454 cut-off events. For 33/49 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 81669 event pairs, 362 based on Foata normal form. 0/6272 useless extension candidates. Maximal degree in co-relation 5435. Up to 1748 conditions per place. [2024-10-14 17:11:29,204 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-10-14 17:11:29,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 269 transitions, 684 flow [2024-10-14 17:11:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-14 17:11:29,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-14 17:11:29,208 INFO L175 Difference]: Start difference. First operand has 319 places, 265 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2024-10-14 17:11:29,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 269 transitions, 684 flow [2024-10-14 17:11:29,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 269 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:11:29,215 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 621 flow [2024-10-14 17:11:29,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=268, PETRI_TRANSITIONS=264} [2024-10-14 17:11:29,216 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -111 predicate places. [2024-10-14 17:11:29,216 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 621 flow [2024-10-14 17:11:29,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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) [2024-10-14 17:11:29,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:29,218 INFO L204 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, 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, 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] [2024-10-14 17:11:29,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:11:29,218 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:29,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 445304005, now seen corresponding path program 1 times [2024-10-14 17:11:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626236287] [2024-10-14 17:11:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:29,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:29,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626236287] [2024-10-14 17:11:29,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626236287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:29,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834374383] [2024-10-14 17:11:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:29,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:29,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:29,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:29,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-14 17:11:29,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 264 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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) [2024-10-14 17:11:29,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:29,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-14 17:11:29,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:31,105 INFO L124 PetriNetUnfolderBase]: 3074/12904 cut-off events. [2024-10-14 17:11:31,105 INFO L125 PetriNetUnfolderBase]: For 257/273 co-relation queries the response was YES. [2024-10-14 17:11:31,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19339 conditions, 12904 events. 3074/12904 cut-off events. For 257/273 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 155225 event pairs, 939 based on Foata normal form. 0/11311 useless extension candidates. Maximal degree in co-relation 18739. Up to 2739 conditions per place. [2024-10-14 17:11:31,297 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-10-14 17:11:31,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 268 transitions, 686 flow [2024-10-14 17:11:31,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-14 17:11:31,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-14 17:11:31,300 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 621 flow. Second operand 3 states and 1172 transitions. [2024-10-14 17:11:31,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 268 transitions, 686 flow [2024-10-14 17:11:31,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:31,311 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 619 flow [2024-10-14 17:11:31,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2024-10-14 17:11:31,311 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -112 predicate places. [2024-10-14 17:11:31,312 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 619 flow [2024-10-14 17:11:31,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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) [2024-10-14 17:11:31,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:31,313 INFO L204 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, 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, 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, 1, 1] [2024-10-14 17:11:31,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:11:31,313 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:31,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1136544773, now seen corresponding path program 1 times [2024-10-14 17:11:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:31,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209305694] [2024-10-14 17:11:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:31,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:31,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209305694] [2024-10-14 17:11:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209305694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:31,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:31,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532150204] [2024-10-14 17:11:31,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:31,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-14 17:11:31,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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) [2024-10-14 17:11:31,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:31,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-14 17:11:31,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:32,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 243#L107-4true, 465#true, 454#true, Black: 458#true, 341#L41-3true, 343#$Ultimate##0true, 460#(= |#race~n~0| 0), 450#true, 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,169 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 17:11:32,169 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:32,169 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:11:32,170 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 17:11:32,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, 243#L107-4true, 465#true, 454#true, Black: 458#true, 341#L41-3true, 343#$Ultimate##0true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,170 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-14 17:11:32,170 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:11:32,170 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:11:32,171 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:11:32,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 189#$Ultimate##0true, 243#L107-4true, 465#true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 450#true, 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 380#L49-3true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,182 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 17:11:32,182 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 17:11:32,182 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:11:32,182 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:32,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 243#L107-4true, 465#true, 454#true, 341#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 450#true, 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 380#L49-3true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,404 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-14 17:11:32,404 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:11:32,404 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:11:32,404 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:11:32,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, 243#L107-4true, 465#true, 454#true, 341#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 380#L49-3true, Black: 438#true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,405 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-10-14 17:11:32,405 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-14 17:11:32,405 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-14 17:11:32,405 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-14 17:11:32,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, 243#L107-4true, Black: 454#true, 465#true, Black: 458#true, 343#$Ultimate##0true, 341#L41-3true, 460#(= |#race~n~0| 0), 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,451 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-14 17:11:32,451 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:11:32,451 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:11:32,451 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:32,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, 243#L107-4true, Black: 454#true, 465#true, Black: 458#true, 343#$Ultimate##0true, 341#L41-3true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,452 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-14 17:11:32,452 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-14 17:11:32,452 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:11:32,452 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:32,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 189#$Ultimate##0true, Black: 450#true, 243#L107-4true, Black: 454#true, 465#true, Black: 458#true, 460#(= |#race~n~0| 0), 25#$Ultimate##0true, Black: 434#true, 380#L49-3true, Black: 438#true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,458 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-14 17:11:32,458 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:11:32,458 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:32,458 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:11:32,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, 465#true, 454#true, 341#L41-3true, Black: 458#true, 343#$Ultimate##0true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:32,535 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-14 17:11:32,535 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:11:32,536 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:11:32,536 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:11:32,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 465#true, 454#true, 341#L41-3true, Black: 458#true, 343#$Ultimate##0true, 460#(= |#race~n~0| 0), 450#true, 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:32,536 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-14 17:11:32,536 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:11:32,536 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:11:32,536 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:11:32,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 378#L81-3true, Black: 454#true, 465#true, 341#L41-3true, Black: 458#true, 343#$Ultimate##0true, 460#(= |#race~n~0| 0), 450#true, 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 342#L65-3true]) [2024-10-14 17:11:32,537 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-14 17:11:32,537 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:11:32,537 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:11:32,537 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:11:32,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 189#$Ultimate##0true, 465#true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 450#true, 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 380#L49-3true, 468#true, 272#L108-4true, 313#$Ultimate##0true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,544 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-14 17:11:32,544 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:11:32,544 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:11:32,544 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:11:32,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, 243#L107-4true, Black: 454#true, 465#true, Black: 458#true, 341#L41-3true, 460#(= |#race~n~0| 0), 25#$Ultimate##0true, Black: 434#true, 380#L49-3true, Black: 438#true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,687 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-14 17:11:32,687 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:11:32,687 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:32,687 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-14 17:11:32,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, 243#L107-4true, Black: 454#true, 465#true, Black: 458#true, 341#L41-3true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 380#L49-3true, Black: 438#true, 468#true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:32,688 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-14 17:11:32,688 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 17:11:32,689 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:11:32,689 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-14 17:11:32,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 378#L81-3true, 189#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 343#$Ultimate##0true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 342#L65-3true]) [2024-10-14 17:11:32,950 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-14 17:11:32,950 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:11:32,950 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:11:32,950 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:11:32,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, 465#true, 454#true, 341#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, Black: 438#true, 380#L49-3true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:32,983 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:11:32,983 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:11:32,983 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:32,983 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:32,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 465#true, 454#true, 341#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 450#true, 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 380#L49-3true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:32,983 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-14 17:11:32,983 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:11:32,983 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:11:32,983 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:11:32,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 378#L81-3true, Black: 454#true, 465#true, 341#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 450#true, 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 380#L49-3true, 468#true, Black: 442#true, 272#L108-4true, 342#L65-3true]) [2024-10-14 17:11:32,984 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:11:32,984 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:32,984 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:32,984 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:11:33,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 343#$Ultimate##0true, 341#L41-3true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:33,013 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-14 17:11:33,013 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:11:33,014 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:11:33,014 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:11:33,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 343#$Ultimate##0true, 341#L41-3true, 460#(= |#race~n~0| 0), 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:33,014 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-14 17:11:33,014 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:11:33,014 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-14 17:11:33,014 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:11:33,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 378#L81-3true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 343#$Ultimate##0true, 341#L41-3true, 460#(= |#race~n~0| 0), 25#$Ultimate##0true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 342#L65-3true]) [2024-10-14 17:11:33,014 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-14 17:11:33,014 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:11:33,015 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:11:33,015 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:11:33,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 189#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 460#(= |#race~n~0| 0), 25#$Ultimate##0true, Black: 434#true, 380#L49-3true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:33,018 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-14 17:11:33,018 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:11:33,018 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-14 17:11:33,018 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:11:33,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 378#L81-3true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 341#L41-3true, 343#$Ultimate##0true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 342#L65-3true]) [2024-10-14 17:11:33,088 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:11:33,088 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:11:33,088 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:33,088 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:33,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 378#L81-3true, 189#$Ultimate##0true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, Black: 438#true, 380#L49-3true, 468#true, 272#L108-4true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:33,090 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:11:33,090 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:33,090 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:33,090 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:11:33,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 341#L41-3true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 380#L49-3true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:33,136 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-14 17:11:33,136 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:11:33,136 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:11:33,136 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:33,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 341#L41-3true, 460#(= |#race~n~0| 0), 25#$Ultimate##0true, Black: 434#true, 380#L49-3true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:33,136 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-14 17:11:33,136 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:11:33,136 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:11:33,136 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:11:33,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 378#L81-3true, Black: 450#true, Black: 454#true, 465#true, Black: 458#true, 341#L41-3true, 460#(= |#race~n~0| 0), 25#$Ultimate##0true, Black: 434#true, 380#L49-3true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 342#L65-3true]) [2024-10-14 17:11:33,137 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-14 17:11:33,137 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:33,137 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:11:33,137 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:11:33,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([977] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][154], [Black: 446#true, 24#L57-3true, 378#L81-3true, Black: 450#true, Black: 454#true, 465#true, 341#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 380#L49-3true, Black: 438#true, 468#true, 272#L108-4true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:33,191 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-14 17:11:33,191 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-14 17:11:33,192 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-14 17:11:33,192 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:11:33,317 INFO L124 PetriNetUnfolderBase]: 2742/11065 cut-off events. [2024-10-14 17:11:33,317 INFO L125 PetriNetUnfolderBase]: For 467/483 co-relation queries the response was YES. [2024-10-14 17:11:33,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16991 conditions, 11065 events. 2742/11065 cut-off events. For 467/483 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 129579 event pairs, 823 based on Foata normal form. 0/9761 useless extension candidates. Maximal degree in co-relation 15815. Up to 2363 conditions per place. [2024-10-14 17:11:33,446 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2024-10-14 17:11:33,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 267 transitions, 684 flow [2024-10-14 17:11:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-14 17:11:33,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-14 17:11:33,449 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2024-10-14 17:11:33,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 267 transitions, 684 flow [2024-10-14 17:11:33,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:33,460 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 617 flow [2024-10-14 17:11:33,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2024-10-14 17:11:33,461 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -113 predicate places. [2024-10-14 17:11:33,461 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 617 flow [2024-10-14 17:11:33,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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) [2024-10-14 17:11:33,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:33,462 INFO L204 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:33,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:11:33,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:33,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 989406512, now seen corresponding path program 1 times [2024-10-14 17:11:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134217874] [2024-10-14 17:11:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:33,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:33,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134217874] [2024-10-14 17:11:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134217874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727244192] [2024-10-14 17:11:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:33,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:33,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:33,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:33,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-14 17:11:33,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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) [2024-10-14 17:11:33,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:33,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-14 17:11:33,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:34,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, 24#L57-3true, Black: 450#true, 454#true, Black: 458#true, 341#L41-3true, 343#$Ultimate##0true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 272#L108-4true, 313#$Ultimate##0true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:34,549 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-14 17:11:34,549 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:11:34,549 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:11:34,549 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:11:34,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, 24#L57-3true, 378#L81-3true, Black: 450#true, Black: 454#true, 341#L41-3true, Black: 458#true, 343#$Ultimate##0true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, 272#L108-4true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:34,550 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:11:34,550 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:34,550 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:11:34,550 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:34,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, 24#L57-3true, Black: 450#true, 454#true, 341#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 471#true, Black: 438#true, 380#L49-3true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:34,654 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:11:34,654 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:11:34,654 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:34,654 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:11:34,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, 24#L57-3true, 378#L81-3true, Black: 450#true, Black: 454#true, 341#L41-3true, Black: 458#true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 471#true, 380#L49-3true, Black: 438#true, 468#true, 272#L108-4true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:34,654 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-14 17:11:34,654 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-14 17:11:34,655 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:11:34,655 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-14 17:11:34,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, 24#L57-3true, Black: 450#true, Black: 454#true, Black: 458#true, 343#$Ultimate##0true, 341#L41-3true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 471#true, Black: 438#true, 468#true, Black: 442#true, 272#L108-4true, 313#$Ultimate##0true, 342#L65-3true]) [2024-10-14 17:11:34,672 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-14 17:11:34,673 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:11:34,673 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:11:34,673 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:11:34,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L65-2-->L65-3: Formula: (= |v_#race~n~0_31| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_31|} AuxVars[] AssignedVars[#race~n~0][180], [Black: 446#true, 24#L57-3true, Black: 450#true, Black: 454#true, Black: 458#true, 341#L41-3true, 460#(= |#race~n~0| 0), 40#L73-3true, Black: 434#true, 471#true, 380#L49-3true, Black: 438#true, 468#true, 272#L108-4true, 313#$Ultimate##0true, Black: 442#true, 342#L65-3true]) [2024-10-14 17:11:34,741 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-14 17:11:34,741 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:11:34,741 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:11:34,741 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:11:34,816 INFO L124 PetriNetUnfolderBase]: 2274/8999 cut-off events. [2024-10-14 17:11:34,816 INFO L125 PetriNetUnfolderBase]: For 515/537 co-relation queries the response was YES. [2024-10-14 17:11:34,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13701 conditions, 8999 events. 2274/8999 cut-off events. For 515/537 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 100544 event pairs, 686 based on Foata normal form. 2/7854 useless extension candidates. Maximal degree in co-relation 12799. Up to 1997 conditions per place. [2024-10-14 17:11:34,939 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-10-14 17:11:34,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 266 transitions, 682 flow [2024-10-14 17:11:34,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-14 17:11:34,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-14 17:11:34,942 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 617 flow. Second operand 3 states and 1172 transitions. [2024-10-14 17:11:34,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 266 transitions, 682 flow [2024-10-14 17:11:34,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:34,951 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 615 flow [2024-10-14 17:11:34,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2024-10-14 17:11:34,952 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -114 predicate places. [2024-10-14 17:11:34,952 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 615 flow [2024-10-14 17:11:34,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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) [2024-10-14 17:11:34,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:34,953 INFO L204 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:34,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:11:34,954 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:34,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1766928833, now seen corresponding path program 1 times [2024-10-14 17:11:34,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:34,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351246733] [2024-10-14 17:11:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:34,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:34,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351246733] [2024-10-14 17:11:34,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351246733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:34,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:34,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:34,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87290637] [2024-10-14 17:11:34,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:34,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:35,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-14 17:11:35,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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) [2024-10-14 17:11:35,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:35,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-14 17:11:35,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:36,194 INFO L124 PetriNetUnfolderBase]: 1885/7637 cut-off events. [2024-10-14 17:11:36,194 INFO L125 PetriNetUnfolderBase]: For 416/459 co-relation queries the response was YES. [2024-10-14 17:11:36,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11549 conditions, 7637 events. 1885/7637 cut-off events. For 416/459 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 82451 event pairs, 568 based on Foata normal form. 5/6733 useless extension candidates. Maximal degree in co-relation 10750. Up to 1778 conditions per place. [2024-10-14 17:11:36,285 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-10-14 17:11:36,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 680 flow [2024-10-14 17:11:36,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-14 17:11:36,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-14 17:11:36,288 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 615 flow. Second operand 3 states and 1172 transitions. [2024-10-14 17:11:36,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 680 flow [2024-10-14 17:11:36,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:36,298 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 613 flow [2024-10-14 17:11:36,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2024-10-14 17:11:36,299 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -115 predicate places. [2024-10-14 17:11:36,300 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 613 flow [2024-10-14 17:11:36,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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) [2024-10-14 17:11:36,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:11:36,301 INFO L204 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:11:36,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-10-14 17:11:36,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:11:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1484148536, now seen corresponding path program 1 times [2024-10-14 17:11:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:11:36,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061936901] [2024-10-14 17:11:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:11:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:11:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:11:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:11:36,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:11:36,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061936901] [2024-10-14 17:11:36,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061936901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:11:36,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:11:36,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:11:36,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220660420] [2024-10-14 17:11:36,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:11:36,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:11:36,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:11:36,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:11:36,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:11:36,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-14 17:11:36,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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) [2024-10-14 17:11:36,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:11:36,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-14 17:11:36,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:11:37,338 INFO L124 PetriNetUnfolderBase]: 1313/5788 cut-off events. [2024-10-14 17:11:37,338 INFO L125 PetriNetUnfolderBase]: For 224/252 co-relation queries the response was YES. [2024-10-14 17:11:37,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8341 conditions, 5788 events. 1313/5788 cut-off events. For 224/252 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 58572 event pairs, 333 based on Foata normal form. 4/5079 useless extension candidates. Maximal degree in co-relation 7649. Up to 1400 conditions per place. [2024-10-14 17:11:37,391 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 0 selfloop transitions, 0 changer transitions 264/264 dead transitions. [2024-10-14 17:11:37,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 678 flow [2024-10-14 17:11:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:11:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:11:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-14 17:11:37,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-14 17:11:37,394 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 613 flow. Second operand 3 states and 1172 transitions. [2024-10-14 17:11:37,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 678 flow [2024-10-14 17:11:37,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:11:37,399 INFO L231 Difference]: Finished difference. Result has 263 places, 0 transitions, 0 flow [2024-10-14 17:11:37,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=263, PETRI_TRANSITIONS=0} [2024-10-14 17:11:37,400 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -116 predicate places. [2024-10-14 17:11:37,400 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 0 transitions, 0 flow [2024-10-14 17:11:37,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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) [2024-10-14 17:11:37,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (96 of 97 remaining) [2024-10-14 17:11:37,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (95 of 97 remaining) [2024-10-14 17:11:37,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (94 of 97 remaining) [2024-10-14 17:11:37,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (93 of 97 remaining) [2024-10-14 17:11:37,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (92 of 97 remaining) [2024-10-14 17:11:37,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (91 of 97 remaining) [2024-10-14 17:11:37,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (90 of 97 remaining) [2024-10-14 17:11:37,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (89 of 97 remaining) [2024-10-14 17:11:37,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (88 of 97 remaining) [2024-10-14 17:11:37,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (87 of 97 remaining) [2024-10-14 17:11:37,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 97 remaining) [2024-10-14 17:11:37,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (85 of 97 remaining) [2024-10-14 17:11:37,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (84 of 97 remaining) [2024-10-14 17:11:37,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (83 of 97 remaining) [2024-10-14 17:11:37,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (82 of 97 remaining) [2024-10-14 17:11:37,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (81 of 97 remaining) [2024-10-14 17:11:37,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (80 of 97 remaining) [2024-10-14 17:11:37,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (79 of 97 remaining) [2024-10-14 17:11:37,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (78 of 97 remaining) [2024-10-14 17:11:37,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (77 of 97 remaining) [2024-10-14 17:11:37,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (76 of 97 remaining) [2024-10-14 17:11:37,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (75 of 97 remaining) [2024-10-14 17:11:37,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (74 of 97 remaining) [2024-10-14 17:11:37,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (73 of 97 remaining) [2024-10-14 17:11:37,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (72 of 97 remaining) [2024-10-14 17:11:37,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (71 of 97 remaining) [2024-10-14 17:11:37,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (70 of 97 remaining) [2024-10-14 17:11:37,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (69 of 97 remaining) [2024-10-14 17:11:37,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (68 of 97 remaining) [2024-10-14 17:11:37,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (67 of 97 remaining) [2024-10-14 17:11:37,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 97 remaining) [2024-10-14 17:11:37,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (65 of 97 remaining) [2024-10-14 17:11:37,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (64 of 97 remaining) [2024-10-14 17:11:37,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (63 of 97 remaining) [2024-10-14 17:11:37,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (62 of 97 remaining) [2024-10-14 17:11:37,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (61 of 97 remaining) [2024-10-14 17:11:37,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (60 of 97 remaining) [2024-10-14 17:11:37,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (59 of 97 remaining) [2024-10-14 17:11:37,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (58 of 97 remaining) [2024-10-14 17:11:37,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (57 of 97 remaining) [2024-10-14 17:11:37,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (56 of 97 remaining) [2024-10-14 17:11:37,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (55 of 97 remaining) [2024-10-14 17:11:37,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (54 of 97 remaining) [2024-10-14 17:11:37,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (53 of 97 remaining) [2024-10-14 17:11:37,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (52 of 97 remaining) [2024-10-14 17:11:37,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (51 of 97 remaining) [2024-10-14 17:11:37,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 97 remaining) [2024-10-14 17:11:37,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 97 remaining) [2024-10-14 17:11:37,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 97 remaining) [2024-10-14 17:11:37,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 97 remaining) [2024-10-14 17:11:37,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 97 remaining) [2024-10-14 17:11:37,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 97 remaining) [2024-10-14 17:11:37,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 97 remaining) [2024-10-14 17:11:37,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 97 remaining) [2024-10-14 17:11:37,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 97 remaining) [2024-10-14 17:11:37,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 97 remaining) [2024-10-14 17:11:37,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 97 remaining) [2024-10-14 17:11:37,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 97 remaining) [2024-10-14 17:11:37,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 97 remaining) [2024-10-14 17:11:37,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 97 remaining) [2024-10-14 17:11:37,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 97 remaining) [2024-10-14 17:11:37,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 97 remaining) [2024-10-14 17:11:37,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 97 remaining) [2024-10-14 17:11:37,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 97 remaining) [2024-10-14 17:11:37,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 97 remaining) [2024-10-14 17:11:37,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 97 remaining) [2024-10-14 17:11:37,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 97 remaining) [2024-10-14 17:11:37,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 97 remaining) [2024-10-14 17:11:37,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 97 remaining) [2024-10-14 17:11:37,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 97 remaining) [2024-10-14 17:11:37,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 97 remaining) [2024-10-14 17:11:37,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 97 remaining) [2024-10-14 17:11:37,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 97 remaining) [2024-10-14 17:11:37,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 97 remaining) [2024-10-14 17:11:37,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 97 remaining) [2024-10-14 17:11:37,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 97 remaining) [2024-10-14 17:11:37,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 97 remaining) [2024-10-14 17:11:37,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 97 remaining) [2024-10-14 17:11:37,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 97 remaining) [2024-10-14 17:11:37,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 97 remaining) [2024-10-14 17:11:37,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 97 remaining) [2024-10-14 17:11:37,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 97 remaining) [2024-10-14 17:11:37,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 97 remaining) [2024-10-14 17:11:37,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 97 remaining) [2024-10-14 17:11:37,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 97 remaining) [2024-10-14 17:11:37,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 97 remaining) [2024-10-14 17:11:37,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 97 remaining) [2024-10-14 17:11:37,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 97 remaining) [2024-10-14 17:11:37,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 97 remaining) [2024-10-14 17:11:37,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 97 remaining) [2024-10-14 17:11:37,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 97 remaining) [2024-10-14 17:11:37,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 97 remaining) [2024-10-14 17:11:37,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 97 remaining) [2024-10-14 17:11:37,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 97 remaining) [2024-10-14 17:11:37,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 97 remaining) [2024-10-14 17:11:37,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 97 remaining) [2024-10-14 17:11:37,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 97 remaining) [2024-10-14 17:11:37,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:11:37,420 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:11:37,426 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:11:37,426 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:11:37,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:11:37 BasicIcfg [2024-10-14 17:11:37,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:11:37,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:11:37,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:11:37,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:11:37,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:13" (3/4) ... [2024-10-14 17:11:37,434 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:11:37,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:11:37,438 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:11:37,438 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-14 17:11:37,438 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-10-14 17:11:37,438 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-10-14 17:11:37,439 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-10-14 17:11:37,446 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-14 17:11:37,446 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 17:11:37,446 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 17:11:37,447 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:11:37,551 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:11:37,552 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:11:37,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:11:37,553 INFO L158 Benchmark]: Toolchain (without parser) took 25392.94ms. Allocated memory was 146.8MB in the beginning and 12.3GB in the end (delta: 12.2GB). Free memory was 114.8MB in the beginning and 10.8GB in the end (delta: -10.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-10-14 17:11:37,553 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:11:37,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.69ms. Allocated memory is still 146.8MB. Free memory was 114.8MB in the beginning and 101.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:11:37,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.57ms. Allocated memory is still 146.8MB. Free memory was 101.5MB in the beginning and 98.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:11:37,554 INFO L158 Benchmark]: Boogie Preprocessor took 42.15ms. Allocated memory is still 146.8MB. Free memory was 98.9MB in the beginning and 97.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:11:37,554 INFO L158 Benchmark]: RCFGBuilder took 737.14ms. Allocated memory is still 146.8MB. Free memory was 97.3MB in the beginning and 66.6MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-14 17:11:37,555 INFO L158 Benchmark]: TraceAbstraction took 24162.83ms. Allocated memory was 146.8MB in the beginning and 12.3GB in the end (delta: 12.2GB). Free memory was 66.1MB in the beginning and 10.8GB in the end (delta: -10.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-10-14 17:11:37,555 INFO L158 Benchmark]: Witness Printer took 120.50ms. Allocated memory is still 12.3GB. Free memory was 10.8GB in the beginning and 10.8GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 17:11:37,557 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.69ms. Allocated memory is still 146.8MB. Free memory was 114.8MB in the beginning and 101.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.57ms. Allocated memory is still 146.8MB. Free memory was 101.5MB in the beginning and 98.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.15ms. Allocated memory is still 146.8MB. Free memory was 98.9MB in the beginning and 97.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 737.14ms. Allocated memory is still 146.8MB. Free memory was 97.3MB in the beginning and 66.6MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24162.83ms. Allocated memory was 146.8MB in the beginning and 12.3GB in the end (delta: 12.2GB). Free memory was 66.1MB in the beginning and 10.8GB in the end (delta: -10.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 120.50ms. Allocated memory is still 12.3GB. Free memory was 10.8GB in the beginning and 10.8GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 536 locations, 97 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.0s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1246 IncrementalHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 209 mSDtfsCounter, 1246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1604 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 61 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:11:37,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE