./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:56:30,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:56:30,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:56:30,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:56:30,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:56:30,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:56:30,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:56:30,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:56:30,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:56:30,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:56:30,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:56:30,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:56:30,877 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:56:30,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:56:30,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:56:30,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:56:30,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:56:30,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:56:30,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:56:30,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:56:30,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:56:30,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:56:30,892 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:56:30,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:56:30,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:56:30,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:56:30,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:56:30,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:56:30,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:56:30,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:56:30,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:56:30,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:56:30,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:56:30,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:56:30,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:56:30,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:56:30,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:56:30,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:56:30,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:56:30,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:56:30,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:56:30,899 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-13 09:56:31,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:56:31,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:56:31,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:56:31,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:56:31,200 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:56:31,201 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-13 09:56:32,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:56:32,886 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:56:32,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2024-10-13 09:56:32,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9f3ec81/6c5e1a41fd5b4699b80861cb34d692f6/FLAGe02ff2eaf [2024-10-13 09:56:32,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9f3ec81/6c5e1a41fd5b4699b80861cb34d692f6 [2024-10-13 09:56:32,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:56:32,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:56:32,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:56:32,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:56:32,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:56:32,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:56:32" (1/1) ... [2024-10-13 09:56:32,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7252c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:32, skipping insertion in model container [2024-10-13 09:56:32,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:56:32" (1/1) ... [2024-10-13 09:56:33,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:56:33,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:56:33,229 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:56:33,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:56:33,282 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:56:33,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33 WrapperNode [2024-10-13 09:56:33,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:56:33,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:56:33,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:56:33,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:56:33,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,327 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 213 [2024-10-13 09:56:33,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:56:33,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:56:33,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:56:33,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:56:33,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:56:33,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:56:33,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:56:33,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:56:33,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (1/1) ... [2024-10-13 09:56:33,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:56:33,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:56:33,426 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-13 09:56:33,429 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-13 09:56:33,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:56:33,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:56:33,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:56:33,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:56:33,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:56:33,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:56:33,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:56:33,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-13 09:56:33,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-13 09:56:33,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:56:33,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-10-13 09:56:33,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-10-13 09:56:33,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-10-13 09:56:33,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-10-13 09:56:33,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:56:33,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:56:33,473 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:56:33,583 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:56:33,585 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:56:34,075 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:56:34,075 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:56:34,112 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:56:34,112 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 09:56:34,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:56:34 BoogieIcfgContainer [2024-10-13 09:56:34,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:56:34,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:56:34,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:56:34,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:56:34,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:56:32" (1/3) ... [2024-10-13 09:56:34,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f872440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:56:34, skipping insertion in model container [2024-10-13 09:56:34,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:33" (2/3) ... [2024-10-13 09:56:34,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f872440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:56:34, skipping insertion in model container [2024-10-13 09:56:34,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:56:34" (3/3) ... [2024-10-13 09:56:34,126 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-10-13 09:56:34,143 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:56:34,144 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2024-10-13 09:56:34,144 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:56:34,301 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-10-13 09:56:34,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 415 transitions, 872 flow [2024-10-13 09:56:34,503 INFO L124 PetriNetUnfolderBase]: 24/409 cut-off events. [2024-10-13 09:56:34,503 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 09:56:34,513 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-13 09:56:34,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 415 transitions, 872 flow [2024-10-13 09:56:34,529 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 382 transitions, 800 flow [2024-10-13 09:56:34,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:56:34,551 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;@584694f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:56:34,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2024-10-13 09:56:34,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:56:34,558 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-13 09:56:34,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:56:34,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:34,559 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-13 09:56:34,559 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-13 09:56:34,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1565727841, now seen corresponding path program 1 times [2024-10-13 09:56:34,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924331181] [2024-10-13 09:56:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:34,774 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-13 09:56:34,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:34,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924331181] [2024-10-13 09:56:34,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924331181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:34,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:34,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203085117] [2024-10-13 09:56:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:34,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:34,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:34,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-13 09:56:34,910 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-13 09:56:34,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:34,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-13 09:56:34,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:35,086 INFO L124 PetriNetUnfolderBase]: 40/509 cut-off events. [2024-10-13 09:56:35,086 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-13 09:56:35,093 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-13 09:56:35,098 INFO L140 encePairwiseOnDemand]: 405/415 looper letters, 22 selfloop transitions, 2 changer transitions 1/374 dead transitions. [2024-10-13 09:56:35,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 374 transitions, 832 flow [2024-10-13 09:56:35,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-13 09:56:35,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-13 09:56:35,125 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 800 flow. Second operand 3 states and 1172 transitions. [2024-10-13 09:56:35,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 374 transitions, 832 flow [2024-10-13 09:56:35,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 808 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-10-13 09:56:35,143 INFO L231 Difference]: Finished difference. Result has 368 places, 373 transitions, 762 flow [2024-10-13 09:56:35,147 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-13 09:56:35,152 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -11 predicate places. [2024-10-13 09:56:35,152 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 373 transitions, 762 flow [2024-10-13 09:56:35,156 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-13 09:56:35,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:35,157 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-13 09:56:35,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:56:35,158 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-13 09:56:35,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1180634064, now seen corresponding path program 1 times [2024-10-13 09:56:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:35,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787070785] [2024-10-13 09:56:35,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:35,242 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-13 09:56:35,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:35,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787070785] [2024-10-13 09:56:35,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787070785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:35,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:35,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968432719] [2024-10-13 09:56:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:35,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:35,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:35,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:35,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-13 09:56:35,290 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-13 09:56:35,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:35,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-13 09:56:35,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:35,396 INFO L124 PetriNetUnfolderBase]: 40/507 cut-off events. [2024-10-13 09:56:35,397 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 09:56:35,401 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-13 09:56:35,406 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-13 09:56:35,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 808 flow [2024-10-13 09:56:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-13 09:56:35,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-13 09:56:35,410 INFO L175 Difference]: Start difference. First operand has 368 places, 373 transitions, 762 flow. Second operand 3 states and 1165 transitions. [2024-10-13 09:56:35,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 808 flow [2024-10-13 09:56:35,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:35,418 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 760 flow [2024-10-13 09:56:35,419 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-13 09:56:35,419 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -13 predicate places. [2024-10-13 09:56:35,420 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 760 flow [2024-10-13 09:56:35,421 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-13 09:56:35,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:35,421 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-13 09:56:35,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:56:35,421 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-13 09:56:35,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:35,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1441696400, now seen corresponding path program 1 times [2024-10-13 09:56:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:35,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498585300] [2024-10-13 09:56:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:35,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:35,502 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-13 09:56:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498585300] [2024-10-13 09:56:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498585300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:35,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405363241] [2024-10-13 09:56:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:35,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:35,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:35,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:35,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-13 09:56:35,552 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-13 09:56:35,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:35,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-13 09:56:35,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:35,652 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2024-10-13 09:56:35,652 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 09:56:35,657 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-13 09:56:35,663 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-10-13 09:56:35,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 371 transitions, 806 flow [2024-10-13 09:56:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-13 09:56:35,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-13 09:56:35,667 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 760 flow. Second operand 3 states and 1165 transitions. [2024-10-13 09:56:35,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 371 transitions, 806 flow [2024-10-13 09:56:35,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:35,691 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 758 flow [2024-10-13 09:56:35,692 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-13 09:56:35,694 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -14 predicate places. [2024-10-13 09:56:35,694 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 758 flow [2024-10-13 09:56:35,695 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-13 09:56:35,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:35,696 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-13 09:56:35,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:56:35,696 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-13 09:56:35,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1104223108, now seen corresponding path program 1 times [2024-10-13 09:56:35,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:35,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014907374] [2024-10-13 09:56:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:35,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:35,759 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-13 09:56:35,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:35,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014907374] [2024-10-13 09:56:35,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014907374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:35,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:35,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:35,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511454791] [2024-10-13 09:56:35,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:35,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:35,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:35,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:35,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:35,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-13 09:56:35,807 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-13 09:56:35,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:35,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-13 09:56:35,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:35,899 INFO L124 PetriNetUnfolderBase]: 40/469 cut-off events. [2024-10-13 09:56:35,900 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 09:56:35,904 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-13 09:56:35,909 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2024-10-13 09:56:35,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 370 transitions, 804 flow [2024-10-13 09:56:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-13 09:56:35,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-13 09:56:35,912 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 758 flow. Second operand 3 states and 1165 transitions. [2024-10-13 09:56:35,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 370 transitions, 804 flow [2024-10-13 09:56:35,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 370 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:35,918 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 756 flow [2024-10-13 09:56:35,918 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-13 09:56:35,919 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -15 predicate places. [2024-10-13 09:56:35,921 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 756 flow [2024-10-13 09:56:35,922 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-13 09:56:35,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:35,922 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-13 09:56:35,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:56:35,922 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-13 09:56:35,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash -514687363, now seen corresponding path program 1 times [2024-10-13 09:56:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:35,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994325424] [2024-10-13 09:56:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:35,977 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-13 09:56:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:35,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994325424] [2024-10-13 09:56:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994325424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:35,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:35,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252507530] [2024-10-13 09:56:35,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:35,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:35,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:35,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:36,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-13 09:56:36,023 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-13 09:56:36,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:36,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-13 09:56:36,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:36,115 INFO L124 PetriNetUnfolderBase]: 40/450 cut-off events. [2024-10-13 09:56:36,115 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 09:56:36,119 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-13 09:56:36,125 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-10-13 09:56:36,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 369 transitions, 802 flow [2024-10-13 09:56:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-13 09:56:36,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-13 09:56:36,128 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 756 flow. Second operand 3 states and 1165 transitions. [2024-10-13 09:56:36,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 369 transitions, 802 flow [2024-10-13 09:56:36,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 369 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:36,136 INFO L231 Difference]: Finished difference. Result has 363 places, 369 transitions, 754 flow [2024-10-13 09:56:36,137 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-13 09:56:36,139 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -16 predicate places. [2024-10-13 09:56:36,140 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 369 transitions, 754 flow [2024-10-13 09:56:36,141 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-13 09:56:36,142 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:36,143 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-13 09:56:36,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:56:36,143 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-13 09:56:36,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:36,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1371466741, now seen corresponding path program 1 times [2024-10-13 09:56:36,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:36,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508085079] [2024-10-13 09:56:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:36,202 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-13 09:56:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508085079] [2024-10-13 09:56:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508085079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:36,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083851788] [2024-10-13 09:56:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:36,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:36,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:36,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-10-13 09:56:36,261 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-13 09:56:36,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:36,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-10-13 09:56:36,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:36,351 INFO L124 PetriNetUnfolderBase]: 40/431 cut-off events. [2024-10-13 09:56:36,351 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 09:56:36,355 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-13 09:56:36,359 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-10-13 09:56:36,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 368 transitions, 800 flow [2024-10-13 09:56:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-13 09:56:36,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-13 09:56:36,362 INFO L175 Difference]: Start difference. First operand has 363 places, 369 transitions, 754 flow. Second operand 3 states and 1165 transitions. [2024-10-13 09:56:36,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 368 transitions, 800 flow [2024-10-13 09:56:36,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 368 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:36,369 INFO L231 Difference]: Finished difference. Result has 362 places, 368 transitions, 752 flow [2024-10-13 09:56:36,369 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-13 09:56:36,372 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -17 predicate places. [2024-10-13 09:56:36,373 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 368 transitions, 752 flow [2024-10-13 09:56:36,373 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-13 09:56:36,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:36,374 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-13 09:56:36,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:56:36,374 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-13 09:56:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1950963730, now seen corresponding path program 1 times [2024-10-13 09:56:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835642357] [2024-10-13 09:56:36,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:36,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:36,422 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-13 09:56:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835642357] [2024-10-13 09:56:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835642357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:36,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:36,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:36,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502028130] [2024-10-13 09:56:36,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:36,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:36,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:36,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:36,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 415 [2024-10-13 09:56:36,486 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-13 09:56:36,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:36,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 415 [2024-10-13 09:56:36,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:37,295 INFO L124 PetriNetUnfolderBase]: 758/4767 cut-off events. [2024-10-13 09:56:37,297 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-13 09:56:37,351 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-13 09:56:37,413 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 27 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-10-13 09:56:37,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 367 transitions, 808 flow [2024-10-13 09:56:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2024-10-13 09:56:37,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.927710843373494 [2024-10-13 09:56:37,518 INFO L175 Difference]: Start difference. First operand has 362 places, 368 transitions, 752 flow. Second operand 3 states and 1155 transitions. [2024-10-13 09:56:37,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 367 transitions, 808 flow [2024-10-13 09:56:37,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 367 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:37,528 INFO L231 Difference]: Finished difference. Result has 361 places, 367 transitions, 750 flow [2024-10-13 09:56:37,533 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-13 09:56:37,534 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -18 predicate places. [2024-10-13 09:56:37,534 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 367 transitions, 750 flow [2024-10-13 09:56:37,535 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-13 09:56:37,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:37,535 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-13 09:56:37,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:56:37,536 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-13 09:56:37,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 41775280, now seen corresponding path program 1 times [2024-10-13 09:56:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:37,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984156289] [2024-10-13 09:56:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:37,582 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-13 09:56:37,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:37,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984156289] [2024-10-13 09:56:37,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984156289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:37,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:37,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145016359] [2024-10-13 09:56:37,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:37,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:37,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:37,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:37,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-13 09:56:37,615 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-13 09:56:37,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:37,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-13 09:56:37,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:37,705 INFO L124 PetriNetUnfolderBase]: 55/497 cut-off events. [2024-10-13 09:56:37,706 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 09:56:37,711 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-13 09:56:37,715 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/367 dead transitions. [2024-10-13 09:56:37,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 819 flow [2024-10-13 09:56:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-10-13 09:56:37,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2024-10-13 09:56:37,718 INFO L175 Difference]: Start difference. First operand has 361 places, 367 transitions, 750 flow. Second operand 3 states and 1160 transitions. [2024-10-13 09:56:37,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 819 flow [2024-10-13 09:56:37,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:37,728 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 747 flow [2024-10-13 09:56:37,728 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-13 09:56:37,731 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -23 predicate places. [2024-10-13 09:56:37,731 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 747 flow [2024-10-13 09:56:37,733 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-13 09:56:37,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:37,735 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-13 09:56:37,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:56:37,735 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-13 09:56:37,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1491364395, now seen corresponding path program 1 times [2024-10-13 09:56:37,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:37,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690456438] [2024-10-13 09:56:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:37,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:37,783 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-13 09:56:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690456438] [2024-10-13 09:56:37,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690456438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:37,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:37,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614276794] [2024-10-13 09:56:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:37,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:37,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:37,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:37,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:37,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-13 09:56:37,826 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-13 09:56:37,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:37,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-13 09:56:37,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:37,916 INFO L124 PetriNetUnfolderBase]: 55/492 cut-off events. [2024-10-13 09:56:37,917 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:56:37,921 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-13 09:56:37,968 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/362 dead transitions. [2024-10-13 09:56:37,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 362 transitions, 816 flow [2024-10-13 09:56:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-10-13 09:56:37,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2024-10-13 09:56:37,972 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 747 flow. Second operand 3 states and 1160 transitions. [2024-10-13 09:56:37,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 362 transitions, 816 flow [2024-10-13 09:56:37,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 362 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:56:37,980 INFO L231 Difference]: Finished difference. Result has 352 places, 357 transitions, 745 flow [2024-10-13 09:56:37,981 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-13 09:56:37,982 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -27 predicate places. [2024-10-13 09:56:37,982 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 357 transitions, 745 flow [2024-10-13 09:56:37,983 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-13 09:56:37,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:37,983 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-13 09:56:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:56:37,983 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-13 09:56:37,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash 543420411, now seen corresponding path program 1 times [2024-10-13 09:56:37,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:37,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863393323] [2024-10-13 09:56:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:37,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:38,036 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-13 09:56:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863393323] [2024-10-13 09:56:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863393323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:38,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198101773] [2024-10-13 09:56:38,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:38,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:38,073 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-13 09:56:38,078 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-13 09:56:38,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:38,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-13 09:56:38,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:38,195 INFO L124 PetriNetUnfolderBase]: 66/657 cut-off events. [2024-10-13 09:56:38,196 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-13 09:56:38,203 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-13 09:56:38,208 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 32 selfloop transitions, 3 changer transitions 0/360 dead transitions. [2024-10-13 09:56:38,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 360 transitions, 829 flow [2024-10-13 09:56:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-10-13 09:56:38,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934136546184739 [2024-10-13 09:56:38,212 INFO L175 Difference]: Start difference. First operand has 352 places, 357 transitions, 745 flow. Second operand 3 states and 1163 transitions. [2024-10-13 09:56:38,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 360 transitions, 829 flow [2024-10-13 09:56:38,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 360 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:56:38,218 INFO L231 Difference]: Finished difference. Result has 348 places, 352 transitions, 743 flow [2024-10-13 09:56:38,220 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-13 09:56:38,220 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -31 predicate places. [2024-10-13 09:56:38,221 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 352 transitions, 743 flow [2024-10-13 09:56:38,222 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-13 09:56:38,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:38,222 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-13 09:56:38,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:56:38,222 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-13 09:56:38,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1758969797, now seen corresponding path program 1 times [2024-10-13 09:56:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:38,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547040288] [2024-10-13 09:56:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:38,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:38,262 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-13 09:56:38,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:38,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547040288] [2024-10-13 09:56:38,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547040288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:38,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:38,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:38,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091048491] [2024-10-13 09:56:38,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:38,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:38,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:38,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:38,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:38,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-13 09:56:38,295 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-13 09:56:38,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:38,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-13 09:56:38,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:38,483 INFO L124 PetriNetUnfolderBase]: 105/838 cut-off events. [2024-10-13 09:56:38,483 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-13 09:56:38,495 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-13 09:56:38,503 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 0/356 dead transitions. [2024-10-13 09:56:38,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 356 transitions, 832 flow [2024-10-13 09:56:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2024-10-13 09:56:38,507 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9349397590361446 [2024-10-13 09:56:38,508 INFO L175 Difference]: Start difference. First operand has 348 places, 352 transitions, 743 flow. Second operand 3 states and 1164 transitions. [2024-10-13 09:56:38,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 356 transitions, 832 flow [2024-10-13 09:56:38,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 356 transitions, 829 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:56:38,517 INFO L231 Difference]: Finished difference. Result has 344 places, 347 transitions, 741 flow [2024-10-13 09:56:38,518 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-13 09:56:38,518 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -35 predicate places. [2024-10-13 09:56:38,519 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 347 transitions, 741 flow [2024-10-13 09:56:38,519 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-13 09:56:38,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:56:38,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:56:38,520 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-13 09:56:38,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:38,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1762512143, now seen corresponding path program 1 times [2024-10-13 09:56:38,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:38,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433508875] [2024-10-13 09:56:38,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:38,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:38,561 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-13 09:56:38,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:38,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433508875] [2024-10-13 09:56:38,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433508875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:38,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:38,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292211316] [2024-10-13 09:56:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:38,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-13 09:56:38,595 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-13 09:56:38,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:38,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-13 09:56:38,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:38,859 INFO L124 PetriNetUnfolderBase]: 123/1078 cut-off events. [2024-10-13 09:56:38,859 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-13 09:56:38,877 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-13 09:56:38,886 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 34 selfloop transitions, 3 changer transitions 0/352 dead transitions. [2024-10-13 09:56:38,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 352 transitions, 835 flow [2024-10-13 09:56:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-13 09:56:38,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-13 09:56:38,891 INFO L175 Difference]: Start difference. First operand has 344 places, 347 transitions, 741 flow. Second operand 3 states and 1165 transitions. [2024-10-13 09:56:38,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 352 transitions, 835 flow [2024-10-13 09:56:38,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 352 transitions, 832 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:56:38,900 INFO L231 Difference]: Finished difference. Result has 340 places, 342 transitions, 739 flow [2024-10-13 09:56:38,901 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-13 09:56:38,902 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -39 predicate places. [2024-10-13 09:56:38,902 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 342 transitions, 739 flow [2024-10-13 09:56:38,903 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-13 09:56:38,903 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:38,904 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-13 09:56:38,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:56:38,904 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-13 09:56:38,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1557032482, now seen corresponding path program 1 times [2024-10-13 09:56:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:38,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035821269] [2024-10-13 09:56:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:38,938 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-13 09:56:38,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:38,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035821269] [2024-10-13 09:56:38,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035821269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:38,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:38,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553253055] [2024-10-13 09:56:38,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:38,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:38,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:38,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:38,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:38,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-10-13 09:56:38,977 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-13 09:56:38,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:38,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-10-13 09:56:38,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:39,223 INFO L124 PetriNetUnfolderBase]: 175/1203 cut-off events. [2024-10-13 09:56:39,224 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2024-10-13 09:56:39,239 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-13 09:56:39,246 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 8/348 dead transitions. [2024-10-13 09:56:39,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 348 transitions, 836 flow [2024-10-13 09:56:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-13 09:56:39,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-10-13 09:56:39,249 INFO L175 Difference]: Start difference. First operand has 340 places, 342 transitions, 739 flow. Second operand 3 states and 1165 transitions. [2024-10-13 09:56:39,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 348 transitions, 836 flow [2024-10-13 09:56:39,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 348 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:56:39,255 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 721 flow [2024-10-13 09:56:39,256 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-13 09:56:39,256 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -43 predicate places. [2024-10-13 09:56:39,256 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 721 flow [2024-10-13 09:56:39,257 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-13 09:56:39,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:39,258 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-13 09:56:39,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:56:39,258 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-13 09:56:39,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:39,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1701355753, now seen corresponding path program 1 times [2024-10-13 09:56:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556009858] [2024-10-13 09:56:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:39,302 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-13 09:56:39,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:39,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556009858] [2024-10-13 09:56:39,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556009858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:39,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:39,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834531715] [2024-10-13 09:56:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:39,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:39,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:39,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:39,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 415 [2024-10-13 09:56:39,350 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-13 09:56:39,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:39,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 415 [2024-10-13 09:56:39,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:47,949 INFO L124 PetriNetUnfolderBase]: 17906/60994 cut-off events. [2024-10-13 09:56:47,949 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2024-10-13 09:56:48,633 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-13 09:56:49,518 INFO L140 encePairwiseOnDemand]: 397/415 looper letters, 29 selfloop transitions, 6 changer transitions 58/328 dead transitions. [2024-10-13 09:56:49,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 328 transitions, 818 flow [2024-10-13 09:56:49,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2024-10-13 09:56:49,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9076305220883534 [2024-10-13 09:56:49,522 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 721 flow. Second operand 3 states and 1130 transitions. [2024-10-13 09:56:49,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 328 transitions, 818 flow [2024-10-13 09:56:49,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 328 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:56:49,672 INFO L231 Difference]: Finished difference. Result has 319 places, 265 transitions, 619 flow [2024-10-13 09:56:49,672 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-13 09:56:49,673 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -60 predicate places. [2024-10-13 09:56:49,673 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 265 transitions, 619 flow [2024-10-13 09:56:49,674 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-13 09:56:49,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:49,675 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-13 09:56:49,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:56:49,675 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-13 09:56:49,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash -816999710, now seen corresponding path program 1 times [2024-10-13 09:56:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:49,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940350846] [2024-10-13 09:56:49,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:49,713 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-13 09:56:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940350846] [2024-10-13 09:56:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940350846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:49,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:49,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793016782] [2024-10-13 09:56:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:49,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:49,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:49,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:49,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-13 09:56:49,753 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-13 09:56:49,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:49,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-13 09:56:49,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:50,700 INFO L124 PetriNetUnfolderBase]: 1604/7454 cut-off events. [2024-10-13 09:56:50,700 INFO L125 PetriNetUnfolderBase]: For 33/49 co-relation queries the response was YES. [2024-10-13 09:56:50,754 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-13 09:56:50,796 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-10-13 09:56:50,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 269 transitions, 684 flow [2024-10-13 09:56:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-13 09:56:50,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-13 09:56:50,801 INFO L175 Difference]: Start difference. First operand has 319 places, 265 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2024-10-13 09:56:50,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 269 transitions, 684 flow [2024-10-13 09:56:50,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 269 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:56:50,811 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 621 flow [2024-10-13 09:56:50,812 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-13 09:56:50,813 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -111 predicate places. [2024-10-13 09:56:50,813 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 621 flow [2024-10-13 09:56:50,814 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-13 09:56:50,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:50,814 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-13 09:56:50,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:56:50,814 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-13 09:56:50,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash 445304005, now seen corresponding path program 1 times [2024-10-13 09:56:50,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:50,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360200826] [2024-10-13 09:56:50,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:50,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:50,855 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-13 09:56:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360200826] [2024-10-13 09:56:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360200826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190777444] [2024-10-13 09:56:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:50,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:50,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:50,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:50,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-13 09:56:50,898 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-13 09:56:50,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:50,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-13 09:56:50,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:52,666 INFO L124 PetriNetUnfolderBase]: 3074/12904 cut-off events. [2024-10-13 09:56:52,667 INFO L125 PetriNetUnfolderBase]: For 257/273 co-relation queries the response was YES. [2024-10-13 09:56:52,783 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-13 09:56:52,839 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-10-13 09:56:52,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 268 transitions, 686 flow [2024-10-13 09:56:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-13 09:56:52,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-13 09:56:52,842 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 621 flow. Second operand 3 states and 1172 transitions. [2024-10-13 09:56:52,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 268 transitions, 686 flow [2024-10-13 09:56:52,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:52,852 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 619 flow [2024-10-13 09:56:52,853 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-13 09:56:52,853 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -112 predicate places. [2024-10-13 09:56:52,853 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 619 flow [2024-10-13 09:56:52,854 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-13 09:56:52,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:52,855 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-13 09:56:52,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:56:52,855 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-13 09:56:52,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1136544773, now seen corresponding path program 1 times [2024-10-13 09:56:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:52,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568138050] [2024-10-13 09:56:52,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:52,896 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-13 09:56:52,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568138050] [2024-10-13 09:56:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568138050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:52,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:52,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499839166] [2024-10-13 09:56:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:52,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:52,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-13 09:56:52,930 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-13 09:56:52,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:52,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-13 09:56:52,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:53,731 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-13 09:56:53,731 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-13 09:56:53,731 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:53,731 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 09:56:53,731 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-13 09:56:53,732 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-13 09:56:53,732 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-13 09:56:53,732 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-13 09:56:53,732 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:56:53,733 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:56:53,744 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-13 09:56:53,744 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-13 09:56:53,744 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-13 09:56:53,744 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 09:56:53,744 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:53,978 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-13 09:56:53,978 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-13 09:56:53,978 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:56:53,978 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-13 09:56:53,978 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:56:53,979 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-13 09:56:53,979 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-10-13 09:56:53,979 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-13 09:56:53,979 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-13 09:56:53,979 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 09:56:54,027 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-13 09:56:54,027 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,027 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 09:56:54,027 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-13 09:56:54,027 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,028 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-13 09:56:54,028 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-13 09:56:54,028 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-13 09:56:54,028 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-13 09:56:54,028 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:54,035 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-13 09:56:54,035 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,035 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 09:56:54,035 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,035 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-13 09:56:54,114 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-13 09:56:54,115 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,115 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:56:54,115 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,115 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-13 09:56:54,115 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-13 09:56:54,115 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-13 09:56:54,115 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:56:54,115 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-13 09:56:54,115 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:56:54,116 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-13 09:56:54,116 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,116 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-13 09:56:54,116 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,116 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:56:54,124 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-13 09:56:54,124 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-13 09:56:54,124 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-13 09:56:54,124 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:56:54,124 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:56:54,267 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-13 09:56:54,268 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-13 09:56:54,268 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-13 09:56:54,268 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:54,268 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-13 09:56:54,269 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-13 09:56:54,269 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-13 09:56:54,269 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:56:54,269 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:56:54,269 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 09:56:54,303 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-13 09:56:54,303 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,303 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-13 09:56:54,303 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:56:54,303 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,347 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-13 09:56:54,348 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:56:54,348 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:56:54,348 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:54,348 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,348 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-13 09:56:54,348 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,348 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,348 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:56:54,348 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-13 09:56:54,349 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-13 09:56:54,349 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:56:54,349 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:54,349 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,349 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:56:54,393 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-13 09:56:54,393 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-13 09:56:54,393 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:56:54,393 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:56:54,394 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:56:54,394 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-13 09:56:54,394 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-13 09:56:54,394 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:56:54,394 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-13 09:56:54,394 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:56:54,394 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-13 09:56:54,395 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-13 09:56:54,395 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:56:54,395 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:56:54,395 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:56:54,399 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-13 09:56:54,399 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-13 09:56:54,399 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:56:54,399 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-13 09:56:54,399 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:56:54,748 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-13 09:56:54,748 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:56:54,748 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:56:54,748 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,748 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:54,751 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-13 09:56:54,751 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:56:54,751 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:54,751 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,751 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:56:54,803 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-13 09:56:54,803 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-13 09:56:54,803 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,803 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:56:54,803 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,804 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-13 09:56:54,804 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-13 09:56:54,804 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:56:54,804 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:56:54,804 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:56:54,805 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-13 09:56:54,805 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-13 09:56:54,805 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:54,805 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:56:54,805 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:56:54,880 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-13 09:56:54,880 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-13 09:56:54,880 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-13 09:56:54,880 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-13 09:56:54,880 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:56:55,028 INFO L124 PetriNetUnfolderBase]: 2742/11065 cut-off events. [2024-10-13 09:56:55,028 INFO L125 PetriNetUnfolderBase]: For 467/483 co-relation queries the response was YES. [2024-10-13 09:56:55,129 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-13 09:56:55,178 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2024-10-13 09:56:55,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 267 transitions, 684 flow [2024-10-13 09:56:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-13 09:56:55,181 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-13 09:56:55,181 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2024-10-13 09:56:55,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 267 transitions, 684 flow [2024-10-13 09:56:55,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:55,192 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 617 flow [2024-10-13 09:56:55,193 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-13 09:56:55,193 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -113 predicate places. [2024-10-13 09:56:55,193 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 617 flow [2024-10-13 09:56:55,194 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-13 09:56:55,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:56:55,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:56:55,195 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-13 09:56:55,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:55,196 INFO L85 PathProgramCache]: Analyzing trace with hash 989406512, now seen corresponding path program 1 times [2024-10-13 09:56:55,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:55,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145436553] [2024-10-13 09:56:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:55,243 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-13 09:56:55,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:55,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145436553] [2024-10-13 09:56:55,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145436553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:55,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:55,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:55,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324514105] [2024-10-13 09:56:55,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:55,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:55,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:55,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-13 09:56:55,285 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-13 09:56:55,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:55,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-13 09:56:55,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:56,368 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-13 09:56:56,369 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:56:56,369 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-13 09:56:56,369 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:56:56,369 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:56:56,369 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-13 09:56:56,369 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:56:56,369 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:56,369 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:56:56,369 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:56,467 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-13 09:56:56,467 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:56:56,467 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:56:56,467 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:56,468 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:56:56,468 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-13 09:56:56,468 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-13 09:56:56,468 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-13 09:56:56,468 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:56:56,468 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-13 09:56:56,485 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-13 09:56:56,486 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-13 09:56:56,486 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:56:56,486 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:56:56,486 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:56:56,577 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-13 09:56:56,578 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-13 09:56:56,578 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:56:56,578 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:56:56,578 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:56:56,648 INFO L124 PetriNetUnfolderBase]: 2274/8999 cut-off events. [2024-10-13 09:56:56,648 INFO L125 PetriNetUnfolderBase]: For 515/537 co-relation queries the response was YES. [2024-10-13 09:56:56,733 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-13 09:56:56,775 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-10-13 09:56:56,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 266 transitions, 682 flow [2024-10-13 09:56:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-13 09:56:56,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-13 09:56:56,778 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 617 flow. Second operand 3 states and 1172 transitions. [2024-10-13 09:56:56,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 266 transitions, 682 flow [2024-10-13 09:56:56,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:56,787 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 615 flow [2024-10-13 09:56:56,788 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-13 09:56:56,788 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -114 predicate places. [2024-10-13 09:56:56,788 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 615 flow [2024-10-13 09:56:56,789 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-13 09:56:56,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:56,789 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-13 09:56:56,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:56:56,790 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-13 09:56:56,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1766928833, now seen corresponding path program 1 times [2024-10-13 09:56:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266527892] [2024-10-13 09:56:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:56,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:56,829 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-13 09:56:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:56,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266527892] [2024-10-13 09:56:56,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266527892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:56,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:56,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591721329] [2024-10-13 09:56:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:56,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:56,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:56,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:56,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:56,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-13 09:56:56,869 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-13 09:56:56,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:56,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-13 09:56:56,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:57,936 INFO L124 PetriNetUnfolderBase]: 1885/7637 cut-off events. [2024-10-13 09:56:57,936 INFO L125 PetriNetUnfolderBase]: For 416/459 co-relation queries the response was YES. [2024-10-13 09:56:58,025 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-13 09:56:58,062 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-10-13 09:56:58,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 680 flow [2024-10-13 09:56:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-13 09:56:58,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-13 09:56:58,065 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 615 flow. Second operand 3 states and 1172 transitions. [2024-10-13 09:56:58,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 680 flow [2024-10-13 09:56:58,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:58,076 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 613 flow [2024-10-13 09:56:58,077 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-13 09:56:58,078 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -115 predicate places. [2024-10-13 09:56:58,078 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 613 flow [2024-10-13 09:56:58,078 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-13 09:56:58,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:56:58,079 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-13 09:56:58,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:56:58,079 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-13 09:56:58,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:56:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1484148536, now seen corresponding path program 1 times [2024-10-13 09:56:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:56:58,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603281865] [2024-10-13 09:56:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:56:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:56:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:56:58,127 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-13 09:56:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:56:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603281865] [2024-10-13 09:56:58,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603281865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:56:58,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:56:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:56:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621534550] [2024-10-13 09:56:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:56:58,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:56:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:56:58,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:56:58,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:56:58,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-10-13 09:56:58,174 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-13 09:56:58,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:56:58,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-10-13 09:56:58,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:56:59,139 INFO L124 PetriNetUnfolderBase]: 1313/5788 cut-off events. [2024-10-13 09:56:59,139 INFO L125 PetriNetUnfolderBase]: For 224/252 co-relation queries the response was YES. [2024-10-13 09:56:59,198 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-13 09:56:59,201 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 0 selfloop transitions, 0 changer transitions 264/264 dead transitions. [2024-10-13 09:56:59,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 678 flow [2024-10-13 09:56:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:56:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:56:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-10-13 09:56:59,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-10-13 09:56:59,205 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 613 flow. Second operand 3 states and 1172 transitions. [2024-10-13 09:56:59,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 678 flow [2024-10-13 09:56:59,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:56:59,212 INFO L231 Difference]: Finished difference. Result has 263 places, 0 transitions, 0 flow [2024-10-13 09:56:59,212 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-13 09:56:59,213 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -116 predicate places. [2024-10-13 09:56:59,213 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 0 transitions, 0 flow [2024-10-13 09:56:59,213 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-13 09:56:59,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (96 of 97 remaining) [2024-10-13 09:56:59,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (95 of 97 remaining) [2024-10-13 09:56:59,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (94 of 97 remaining) [2024-10-13 09:56:59,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (93 of 97 remaining) [2024-10-13 09:56:59,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (92 of 97 remaining) [2024-10-13 09:56:59,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (91 of 97 remaining) [2024-10-13 09:56:59,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (90 of 97 remaining) [2024-10-13 09:56:59,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (89 of 97 remaining) [2024-10-13 09:56:59,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (88 of 97 remaining) [2024-10-13 09:56:59,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (87 of 97 remaining) [2024-10-13 09:56:59,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 97 remaining) [2024-10-13 09:56:59,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (85 of 97 remaining) [2024-10-13 09:56:59,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (84 of 97 remaining) [2024-10-13 09:56:59,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (83 of 97 remaining) [2024-10-13 09:56:59,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (82 of 97 remaining) [2024-10-13 09:56:59,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (81 of 97 remaining) [2024-10-13 09:56:59,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (80 of 97 remaining) [2024-10-13 09:56:59,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (79 of 97 remaining) [2024-10-13 09:56:59,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (78 of 97 remaining) [2024-10-13 09:56:59,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (77 of 97 remaining) [2024-10-13 09:56:59,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (76 of 97 remaining) [2024-10-13 09:56:59,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (75 of 97 remaining) [2024-10-13 09:56:59,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (74 of 97 remaining) [2024-10-13 09:56:59,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (73 of 97 remaining) [2024-10-13 09:56:59,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (72 of 97 remaining) [2024-10-13 09:56:59,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (71 of 97 remaining) [2024-10-13 09:56:59,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (70 of 97 remaining) [2024-10-13 09:56:59,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (69 of 97 remaining) [2024-10-13 09:56:59,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (68 of 97 remaining) [2024-10-13 09:56:59,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (67 of 97 remaining) [2024-10-13 09:56:59,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 97 remaining) [2024-10-13 09:56:59,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (65 of 97 remaining) [2024-10-13 09:56:59,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (64 of 97 remaining) [2024-10-13 09:56:59,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (63 of 97 remaining) [2024-10-13 09:56:59,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (62 of 97 remaining) [2024-10-13 09:56:59,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (61 of 97 remaining) [2024-10-13 09:56:59,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (60 of 97 remaining) [2024-10-13 09:56:59,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (59 of 97 remaining) [2024-10-13 09:56:59,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (58 of 97 remaining) [2024-10-13 09:56:59,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (57 of 97 remaining) [2024-10-13 09:56:59,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (56 of 97 remaining) [2024-10-13 09:56:59,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (55 of 97 remaining) [2024-10-13 09:56:59,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (54 of 97 remaining) [2024-10-13 09:56:59,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (53 of 97 remaining) [2024-10-13 09:56:59,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (52 of 97 remaining) [2024-10-13 09:56:59,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (51 of 97 remaining) [2024-10-13 09:56:59,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 97 remaining) [2024-10-13 09:56:59,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 97 remaining) [2024-10-13 09:56:59,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 97 remaining) [2024-10-13 09:56:59,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 97 remaining) [2024-10-13 09:56:59,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 97 remaining) [2024-10-13 09:56:59,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 97 remaining) [2024-10-13 09:56:59,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 97 remaining) [2024-10-13 09:56:59,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 97 remaining) [2024-10-13 09:56:59,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 97 remaining) [2024-10-13 09:56:59,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 97 remaining) [2024-10-13 09:56:59,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 97 remaining) [2024-10-13 09:56:59,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 97 remaining) [2024-10-13 09:56:59,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 97 remaining) [2024-10-13 09:56:59,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 97 remaining) [2024-10-13 09:56:59,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 97 remaining) [2024-10-13 09:56:59,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 97 remaining) [2024-10-13 09:56:59,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 97 remaining) [2024-10-13 09:56:59,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 97 remaining) [2024-10-13 09:56:59,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 97 remaining) [2024-10-13 09:56:59,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 97 remaining) [2024-10-13 09:56:59,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 97 remaining) [2024-10-13 09:56:59,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 97 remaining) [2024-10-13 09:56:59,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 97 remaining) [2024-10-13 09:56:59,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 97 remaining) [2024-10-13 09:56:59,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 97 remaining) [2024-10-13 09:56:59,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 97 remaining) [2024-10-13 09:56:59,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 97 remaining) [2024-10-13 09:56:59,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 97 remaining) [2024-10-13 09:56:59,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 97 remaining) [2024-10-13 09:56:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 97 remaining) [2024-10-13 09:56:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 97 remaining) [2024-10-13 09:56:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 97 remaining) [2024-10-13 09:56:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 97 remaining) [2024-10-13 09:56:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 97 remaining) [2024-10-13 09:56:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 97 remaining) [2024-10-13 09:56:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 97 remaining) [2024-10-13 09:56:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 97 remaining) [2024-10-13 09:56:59,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 97 remaining) [2024-10-13 09:56:59,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 97 remaining) [2024-10-13 09:56:59,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 97 remaining) [2024-10-13 09:56:59,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 97 remaining) [2024-10-13 09:56:59,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 97 remaining) [2024-10-13 09:56:59,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 97 remaining) [2024-10-13 09:56:59,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 97 remaining) [2024-10-13 09:56:59,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 97 remaining) [2024-10-13 09:56:59,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 97 remaining) [2024-10-13 09:56:59,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 97 remaining) [2024-10-13 09:56:59,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 97 remaining) [2024-10-13 09:56:59,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 97 remaining) [2024-10-13 09:56:59,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 97 remaining) [2024-10-13 09:56:59,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 97 remaining) [2024-10-13 09:56:59,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:56:59,232 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-13 09:56:59,239 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:56:59,239 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:56:59,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:56:59 BasicIcfg [2024-10-13 09:56:59,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:56:59,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:56:59,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:56:59,246 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:56:59,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:56:34" (3/4) ... [2024-10-13 09:56:59,249 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:56:59,253 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:56:59,253 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:56:59,253 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-13 09:56:59,254 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-10-13 09:56:59,254 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-10-13 09:56:59,254 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-10-13 09:56:59,268 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-13 09:56:59,268 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 09:56:59,269 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 09:56:59,269 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:56:59,380 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:56:59,380 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:56:59,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:56:59,381 INFO L158 Benchmark]: Toolchain (without parser) took 26396.20ms. Allocated memory was 140.5MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 112.0MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-13 09:56:59,381 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 140.5MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:56:59,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.83ms. Allocated memory is still 140.5MB. Free memory was 111.5MB in the beginning and 97.1MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 09:56:59,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.53ms. Allocated memory is still 140.5MB. Free memory was 97.1MB in the beginning and 95.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:56:59,383 INFO L158 Benchmark]: Boogie Preprocessor took 48.71ms. Allocated memory is still 140.5MB. Free memory was 95.1MB in the beginning and 93.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:56:59,383 INFO L158 Benchmark]: RCFGBuilder took 735.04ms. Allocated memory is still 140.5MB. Free memory was 93.0MB in the beginning and 63.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 09:56:59,383 INFO L158 Benchmark]: TraceAbstraction took 25126.33ms. Allocated memory was 140.5MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 63.1MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-10-13 09:56:59,384 INFO L158 Benchmark]: Witness Printer took 134.70ms. Allocated memory is still 12.9GB. Free memory was 11.6GB in the beginning and 11.6GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 09:56:59,385 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.21ms. Allocated memory is still 140.5MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.83ms. Allocated memory is still 140.5MB. Free memory was 111.5MB in the beginning and 97.1MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.53ms. Allocated memory is still 140.5MB. Free memory was 97.1MB in the beginning and 95.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.71ms. Allocated memory is still 140.5MB. Free memory was 95.1MB in the beginning and 93.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 735.04ms. Allocated memory is still 140.5MB. Free memory was 93.0MB in the beginning and 63.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25126.33ms. Allocated memory was 140.5MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 63.1MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 134.70ms. Allocated memory is still 12.9GB. Free memory was 11.6GB in the beginning and 11.6GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 1.3s 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.1s 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-13 09:56:59,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE