./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:36:46,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:36:46,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:36:46,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:36:46,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:36:46,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:36:46,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:36:46,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:36:46,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:36:46,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:36:46,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:36:46,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:36:46,930 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:36:46,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:36:46,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:36:46,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:36:46,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:36:46,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:36:46,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:36:46,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:36:46,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:36:46,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:46,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:36:46,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:36:46,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:36:46,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:46,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:36:46,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:36:46,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:36:46,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:36:46,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:36:46,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:36:46,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:36:46,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:36:46,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:36:46,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:36:46,934 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2025-01-09 21:36:47,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:36:47,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:36:47,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:36:47,236 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:36:47,237 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:36:47,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-01-09 21:36:48,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0367bd5b1/71989593dcfc48eeb1c5fb1e30797072/FLAG11d260a6f [2025-01-09 21:36:48,841 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:36:48,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-01-09 21:36:48,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0367bd5b1/71989593dcfc48eeb1c5fb1e30797072/FLAG11d260a6f [2025-01-09 21:36:48,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0367bd5b1/71989593dcfc48eeb1c5fb1e30797072 [2025-01-09 21:36:48,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:36:48,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:36:48,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:36:48,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:36:48,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:36:48,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:48" (1/1) ... [2025-01-09 21:36:48,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bea0c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:48, skipping insertion in model container [2025-01-09 21:36:48,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:48" (1/1) ... [2025-01-09 21:36:48,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:36:49,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:36:49,275 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:36:49,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:36:49,366 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:36:49,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49 WrapperNode [2025-01-09 21:36:49,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:36:49,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:36:49,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:36:49,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:36:49,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,409 INFO L138 Inliner]: procedures = 273, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 126 [2025-01-09 21:36:49,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:36:49,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:36:49,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:36:49,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:36:49,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:36:49,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:36:49,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:36:49,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:36:49,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (1/1) ... [2025-01-09 21:36:49,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:49,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:36:49,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:36:49,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:36:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:36:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:36:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:36:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:36:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:36:49,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:36:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:36:49,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:36:49,512 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:36:49,638 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:36:49,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:36:49,967 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:36:49,967 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:36:50,000 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:36:50,000 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:36:50,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:50 BoogieIcfgContainer [2025-01-09 21:36:50,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:36:50,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:36:50,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:36:50,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:36:50,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:36:48" (1/3) ... [2025-01-09 21:36:50,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fab60e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:50, skipping insertion in model container [2025-01-09 21:36:50,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:49" (2/3) ... [2025-01-09 21:36:50,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fab60e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:50, skipping insertion in model container [2025-01-09 21:36:50,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:50" (3/3) ... [2025-01-09 21:36:50,011 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2025-01-09 21:36:50,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:36:50,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-bitmask-race.i that has 2 procedures, 169 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-01-09 21:36:50,023 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:36:50,091 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:36:50,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 185 transitions, 377 flow [2025-01-09 21:36:50,245 INFO L124 PetriNetUnfolderBase]: 26/277 cut-off events. [2025-01-09 21:36:50,247 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:36:50,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 277 events. 26/277 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 609 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 140. Up to 6 conditions per place. [2025-01-09 21:36:50,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 185 transitions, 377 flow [2025-01-09 21:36:50,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 185 transitions, 377 flow [2025-01-09 21:36:50,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:36:50,282 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;@1c4b2e70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:36:50,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:36:50,292 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:36:50,292 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-01-09 21:36:50,293 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:36:50,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:50,294 INFO L206 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] [2025-01-09 21:36:50,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash 924976729, now seen corresponding path program 1 times [2025-01-09 21:36:50,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:50,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150928210] [2025-01-09 21:36:50,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:50,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:50,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:36:50,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:36:50,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:50,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:50,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:50,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150928210] [2025-01-09 21:36:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150928210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:50,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:50,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071073310] [2025-01-09 21:36:50,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:50,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:50,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:50,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:50,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2025-01-09 21:36:50,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 185 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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) [2025-01-09 21:36:50,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:50,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2025-01-09 21:36:50,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:50,699 INFO L124 PetriNetUnfolderBase]: 59/540 cut-off events. [2025-01-09 21:36:50,701 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:36:50,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 540 events. 59/540 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2181 event pairs, 2 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 448. Up to 57 conditions per place. [2025-01-09 21:36:50,709 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 15 selfloop transitions, 2 changer transitions 2/182 dead transitions. [2025-01-09 21:36:50,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 182 transitions, 405 flow [2025-01-09 21:36:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2025-01-09 21:36:50,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279279279279279 [2025-01-09 21:36:50,726 INFO L175 Difference]: Start difference. First operand has 172 places, 185 transitions, 377 flow. Second operand 3 states and 515 transitions. [2025-01-09 21:36:50,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 182 transitions, 405 flow [2025-01-09 21:36:50,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 182 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:50,735 INFO L231 Difference]: Finished difference. Result has 173 places, 180 transitions, 371 flow [2025-01-09 21:36:50,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=173, PETRI_TRANSITIONS=180} [2025-01-09 21:36:50,742 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2025-01-09 21:36:50,743 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 180 transitions, 371 flow [2025-01-09 21:36:50,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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) [2025-01-09 21:36:50,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:50,743 INFO L206 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] [2025-01-09 21:36:50,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:36:50,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:50,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash -239964512, now seen corresponding path program 1 times [2025-01-09 21:36:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:50,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329448356] [2025-01-09 21:36:50,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:50,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:36:50,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:36:50,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:50,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:50,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:50,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329448356] [2025-01-09 21:36:50,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329448356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:50,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:50,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:50,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783058823] [2025-01-09 21:36:50,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:50,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:50,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:50,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:50,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:50,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2025-01-09 21:36:50,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 180 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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) [2025-01-09 21:36:50,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:50,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2025-01-09 21:36:50,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:50,994 INFO L124 PetriNetUnfolderBase]: 128/705 cut-off events. [2025-01-09 21:36:50,994 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:36:50,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 705 events. 128/705 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3408 event pairs, 6 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 819. Up to 96 conditions per place. [2025-01-09 21:36:50,999 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 27 selfloop transitions, 8 changer transitions 0/195 dead transitions. [2025-01-09 21:36:50,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 195 transitions, 471 flow [2025-01-09 21:36:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-01-09 21:36:51,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9495495495495495 [2025-01-09 21:36:51,002 INFO L175 Difference]: Start difference. First operand has 173 places, 180 transitions, 371 flow. Second operand 3 states and 527 transitions. [2025-01-09 21:36:51,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 195 transitions, 471 flow [2025-01-09 21:36:51,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 195 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:51,007 INFO L231 Difference]: Finished difference. Result has 173 places, 188 transitions, 437 flow [2025-01-09 21:36:51,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=173, PETRI_TRANSITIONS=188} [2025-01-09 21:36:51,008 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2025-01-09 21:36:51,008 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 188 transitions, 437 flow [2025-01-09 21:36:51,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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) [2025-01-09 21:36:51,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:51,009 INFO L206 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] [2025-01-09 21:36:51,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:36:51,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:51,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash -513946552, now seen corresponding path program 1 times [2025-01-09 21:36:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579620601] [2025-01-09 21:36:51,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:51,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:36:51,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:36:51,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:51,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:51,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:51,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579620601] [2025-01-09 21:36:51,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579620601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:51,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:51,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:51,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147496810] [2025-01-09 21:36:51,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:51,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:51,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:51,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:51,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:51,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 185 [2025-01-09 21:36:51,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 188 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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) [2025-01-09 21:36:51,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:51,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 185 [2025-01-09 21:36:51,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:51,224 INFO L124 PetriNetUnfolderBase]: 116/769 cut-off events. [2025-01-09 21:36:51,224 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-09 21:36:51,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 769 events. 116/769 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3981 event pairs, 10 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 782. Up to 64 conditions per place. [2025-01-09 21:36:51,228 INFO L140 encePairwiseOnDemand]: 181/185 looper letters, 19 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-01-09 21:36:51,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 193 transitions, 489 flow [2025-01-09 21:36:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2025-01-09 21:36:51,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441441441441442 [2025-01-09 21:36:51,230 INFO L175 Difference]: Start difference. First operand has 173 places, 188 transitions, 437 flow. Second operand 3 states and 524 transitions. [2025-01-09 21:36:51,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 193 transitions, 489 flow [2025-01-09 21:36:51,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 193 transitions, 473 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:51,235 INFO L231 Difference]: Finished difference. Result has 172 places, 188 transitions, 431 flow [2025-01-09 21:36:51,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=172, PETRI_TRANSITIONS=188} [2025-01-09 21:36:51,236 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 0 predicate places. [2025-01-09 21:36:51,236 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 188 transitions, 431 flow [2025-01-09 21:36:51,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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) [2025-01-09 21:36:51,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:51,237 INFO L206 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] [2025-01-09 21:36:51,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:36:51,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:51,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:51,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1374447586, now seen corresponding path program 1 times [2025-01-09 21:36:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276853223] [2025-01-09 21:36:51,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:51,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:36:51,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:36:51,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:51,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:51,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:51,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276853223] [2025-01-09 21:36:51,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276853223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:51,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870250273] [2025-01-09 21:36:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:51,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:36:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:51,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:36:51,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:36:51,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2025-01-09 21:36:51,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 188 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 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) [2025-01-09 21:36:51,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:51,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2025-01-09 21:36:51,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:51,667 INFO L124 PetriNetUnfolderBase]: 103/671 cut-off events. [2025-01-09 21:36:51,667 INFO L125 PetriNetUnfolderBase]: For 25/40 co-relation queries the response was YES. [2025-01-09 21:36:51,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 671 events. 103/671 cut-off events. For 25/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3311 event pairs, 15 based on Foata normal form. 2/565 useless extension candidates. Maximal degree in co-relation 657. Up to 75 conditions per place. [2025-01-09 21:36:51,671 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 25 selfloop transitions, 2 changer transitions 5/200 dead transitions. [2025-01-09 21:36:51,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 200 transitions, 519 flow [2025-01-09 21:36:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1011 transitions. [2025-01-09 21:36:51,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9108108108108108 [2025-01-09 21:36:51,675 INFO L175 Difference]: Start difference. First operand has 172 places, 188 transitions, 431 flow. Second operand 6 states and 1011 transitions. [2025-01-09 21:36:51,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 200 transitions, 519 flow [2025-01-09 21:36:51,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 200 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:51,681 INFO L231 Difference]: Finished difference. Result has 181 places, 188 transitions, 449 flow [2025-01-09 21:36:51,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=181, PETRI_TRANSITIONS=188} [2025-01-09 21:36:51,683 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2025-01-09 21:36:51,683 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 188 transitions, 449 flow [2025-01-09 21:36:51,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 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) [2025-01-09 21:36:51,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:51,684 INFO L206 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] [2025-01-09 21:36:51,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:36:51,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:51,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash 75235441, now seen corresponding path program 1 times [2025-01-09 21:36:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:51,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442822029] [2025-01-09 21:36:51,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:51,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:51,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:36:51,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:36:51,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:51,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442822029] [2025-01-09 21:36:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442822029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:51,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:51,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:36:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439276516] [2025-01-09 21:36:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:51,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:51,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:51,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:51,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 185 [2025-01-09 21:36:51,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 188 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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) [2025-01-09 21:36:51,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:51,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 185 [2025-01-09 21:36:51,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:51,898 INFO L124 PetriNetUnfolderBase]: 104/631 cut-off events. [2025-01-09 21:36:51,899 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:36:51,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 631 events. 104/631 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2775 event pairs, 11 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 725. Up to 74 conditions per place. [2025-01-09 21:36:51,902 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 17 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-01-09 21:36:51,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 194 transitions, 499 flow [2025-01-09 21:36:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2025-01-09 21:36:51,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.954954954954955 [2025-01-09 21:36:51,904 INFO L175 Difference]: Start difference. First operand has 181 places, 188 transitions, 449 flow. Second operand 3 states and 530 transitions. [2025-01-09 21:36:51,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 194 transitions, 499 flow [2025-01-09 21:36:51,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 485 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-09 21:36:51,908 INFO L231 Difference]: Finished difference. Result has 176 places, 189 transitions, 447 flow [2025-01-09 21:36:51,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=176, PETRI_TRANSITIONS=189} [2025-01-09 21:36:51,909 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2025-01-09 21:36:51,910 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 189 transitions, 447 flow [2025-01-09 21:36:51,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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) [2025-01-09 21:36:51,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:51,912 INFO L206 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] [2025-01-09 21:36:51,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:36:51,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:51,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -947545353, now seen corresponding path program 1 times [2025-01-09 21:36:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149055268] [2025-01-09 21:36:51,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:51,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:36:51,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:36:51,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:51,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149055268] [2025-01-09 21:36:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149055268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:51,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:36:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092811880] [2025-01-09 21:36:51,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:51,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:36:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:51,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:36:51,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:36:52,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 185 [2025-01-09 21:36:52,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 189 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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) [2025-01-09 21:36:52,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:52,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 185 [2025-01-09 21:36:52,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:52,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [113#L1058-11true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 198#true, Black: 183#true, 173#true, 202#true]) [2025-01-09 21:36:52,125 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2025-01-09 21:36:52,125 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-01-09 21:36:52,125 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-01-09 21:36:52,125 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-01-09 21:36:52,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 114#L1058-14true, 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 198#true, Black: 183#true, 173#true, 202#true]) [2025-01-09 21:36:52,131 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2025-01-09 21:36:52,131 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2025-01-09 21:36:52,132 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2025-01-09 21:36:52,132 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-01-09 21:36:52,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), 99#L1058-27true, Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, 148#L1048-16true, Black: 183#true, 173#true, 202#true]) [2025-01-09 21:36:52,172 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2025-01-09 21:36:52,172 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-01-09 21:36:52,172 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2025-01-09 21:36:52,173 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2025-01-09 21:36:52,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][168], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 67#L1059-10true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 148#L1048-16true, 173#true, 202#true]) [2025-01-09 21:36:52,185 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2025-01-09 21:36:52,185 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-01-09 21:36:52,185 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-01-09 21:36:52,185 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-01-09 21:36:52,207 INFO L124 PetriNetUnfolderBase]: 211/1003 cut-off events. [2025-01-09 21:36:52,207 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:36:52,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1003 events. 211/1003 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5778 event pairs, 22 based on Foata normal form. 1/884 useless extension candidates. Maximal degree in co-relation 1275. Up to 105 conditions per place. [2025-01-09 21:36:52,212 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 36 selfloop transitions, 13 changer transitions 0/214 dead transitions. [2025-01-09 21:36:52,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 214 transitions, 597 flow [2025-01-09 21:36:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:36:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:36:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 690 transitions. [2025-01-09 21:36:52,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9324324324324325 [2025-01-09 21:36:52,214 INFO L175 Difference]: Start difference. First operand has 176 places, 189 transitions, 447 flow. Second operand 4 states and 690 transitions. [2025-01-09 21:36:52,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 214 transitions, 597 flow [2025-01-09 21:36:52,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 214 transitions, 595 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:52,218 INFO L231 Difference]: Finished difference. Result has 181 places, 200 transitions, 545 flow [2025-01-09 21:36:52,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=545, PETRI_PLACES=181, PETRI_TRANSITIONS=200} [2025-01-09 21:36:52,219 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2025-01-09 21:36:52,219 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 200 transitions, 545 flow [2025-01-09 21:36:52,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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) [2025-01-09 21:36:52,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:52,220 INFO L206 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] [2025-01-09 21:36:52,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:36:52,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:52,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1072095183, now seen corresponding path program 1 times [2025-01-09 21:36:52,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:52,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228849508] [2025-01-09 21:36:52,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:52,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:52,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:36:52,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:36:52,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:52,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228849508] [2025-01-09 21:36:52,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228849508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:52,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:52,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:36:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570388853] [2025-01-09 21:36:52,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:52,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:36:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:52,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:36:52,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:36:52,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2025-01-09 21:36:52,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 200 transitions, 545 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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) [2025-01-09 21:36:52,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:52,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2025-01-09 21:36:52,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:52,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][194], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 67#L1059-10true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, Black: 183#true, 173#true, 202#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0)))]) [2025-01-09 21:36:52,591 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2025-01-09 21:36:52,591 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-01-09 21:36:52,591 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-01-09 21:36:52,591 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-01-09 21:36:52,626 INFO L124 PetriNetUnfolderBase]: 228/1120 cut-off events. [2025-01-09 21:36:52,626 INFO L125 PetriNetUnfolderBase]: For 411/435 co-relation queries the response was YES. [2025-01-09 21:36:52,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 1120 events. 228/1120 cut-off events. For 411/435 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6879 event pairs, 18 based on Foata normal form. 5/991 useless extension candidates. Maximal degree in co-relation 1632. Up to 189 conditions per place. [2025-01-09 21:36:52,634 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 34 selfloop transitions, 9 changer transitions 0/218 dead transitions. [2025-01-09 21:36:52,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 218 transitions, 701 flow [2025-01-09 21:36:52,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:36:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:36:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2025-01-09 21:36:52,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9378378378378378 [2025-01-09 21:36:52,637 INFO L175 Difference]: Start difference. First operand has 181 places, 200 transitions, 545 flow. Second operand 4 states and 694 transitions. [2025-01-09 21:36:52,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 218 transitions, 701 flow [2025-01-09 21:36:52,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 218 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:52,644 INFO L231 Difference]: Finished difference. Result has 186 places, 206 transitions, 624 flow [2025-01-09 21:36:52,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=186, PETRI_TRANSITIONS=206} [2025-01-09 21:36:52,645 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 14 predicate places. [2025-01-09 21:36:52,645 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 206 transitions, 624 flow [2025-01-09 21:36:52,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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) [2025-01-09 21:36:52,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:52,646 INFO L206 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] [2025-01-09 21:36:52,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:36:52,646 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:52,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash -835858364, now seen corresponding path program 1 times [2025-01-09 21:36:52,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:52,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021402881] [2025-01-09 21:36:52,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:52,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:52,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:36:52,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:36:52,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:52,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:52,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:52,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021402881] [2025-01-09 21:36:52,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021402881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:52,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:52,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:36:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576328753] [2025-01-09 21:36:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:52,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:36:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:52,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:36:52,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:36:52,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 185 [2025-01-09 21:36:52,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 206 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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) [2025-01-09 21:36:52,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:52,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 185 [2025-01-09 21:36:52,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:52,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][189], [113#L1058-11true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2025-01-09 21:36:52,919 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2025-01-09 21:36:52,920 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-01-09 21:36:52,920 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-01-09 21:36:52,920 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-01-09 21:36:52,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 67#L1059-10true, Black: 183#true, 202#true]) [2025-01-09 21:36:52,983 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2025-01-09 21:36:52,983 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-01-09 21:36:52,983 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-01-09 21:36:52,983 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-01-09 21:36:52,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][175], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 47#L1058-36true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, 202#true]) [2025-01-09 21:36:52,987 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-01-09 21:36:52,987 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:52,987 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:52,987 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:52,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][169], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, 95#L1059-16true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2025-01-09 21:36:52,994 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is not cut-off event [2025-01-09 21:36:52,994 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2025-01-09 21:36:52,994 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-01-09 21:36:52,994 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2025-01-09 21:36:53,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][169], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 162#L1059-20true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 180#(= |#race~threads_mask~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2025-01-09 21:36:53,013 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2025-01-09 21:36:53,013 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2025-01-09 21:36:53,014 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2025-01-09 21:36:53,014 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2025-01-09 21:36:53,041 INFO L124 PetriNetUnfolderBase]: 289/1275 cut-off events. [2025-01-09 21:36:53,041 INFO L125 PetriNetUnfolderBase]: For 921/1011 co-relation queries the response was YES. [2025-01-09 21:36:53,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 1275 events. 289/1275 cut-off events. For 921/1011 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7906 event pairs, 26 based on Foata normal form. 27/1151 useless extension candidates. Maximal degree in co-relation 2184. Up to 181 conditions per place. [2025-01-09 21:36:53,050 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 39 selfloop transitions, 18 changer transitions 0/226 dead transitions. [2025-01-09 21:36:53,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 226 transitions, 821 flow [2025-01-09 21:36:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:36:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:36:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2025-01-09 21:36:53,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9310810810810811 [2025-01-09 21:36:53,052 INFO L175 Difference]: Start difference. First operand has 186 places, 206 transitions, 624 flow. Second operand 4 states and 689 transitions. [2025-01-09 21:36:53,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 226 transitions, 821 flow [2025-01-09 21:36:53,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 226 transitions, 821 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:53,059 INFO L231 Difference]: Finished difference. Result has 191 places, 212 transitions, 734 flow [2025-01-09 21:36:53,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=191, PETRI_TRANSITIONS=212} [2025-01-09 21:36:53,062 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 19 predicate places. [2025-01-09 21:36:53,062 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 212 transitions, 734 flow [2025-01-09 21:36:53,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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) [2025-01-09 21:36:53,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:53,063 INFO L206 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] [2025-01-09 21:36:53,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:36:53,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:53,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash 796597889, now seen corresponding path program 1 times [2025-01-09 21:36:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:53,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843897935] [2025-01-09 21:36:53,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:53,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:53,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:36:53,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:36:53,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:53,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843897935] [2025-01-09 21:36:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843897935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:53,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:36:53,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971827831] [2025-01-09 21:36:53,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:53,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:36:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:53,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:36:53,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:36:53,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 185 [2025-01-09 21:36:53,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 212 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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) [2025-01-09 21:36:53,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:53,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 185 [2025-01-09 21:36:53,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:53,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [113#L1058-11true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-01-09 21:36:53,320 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2025-01-09 21:36:53,320 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-01-09 21:36:53,320 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-01-09 21:36:53,320 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2025-01-09 21:36:53,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, 67#L1059-10true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-01-09 21:36:53,367 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-01-09 21:36:53,367 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-01-09 21:36:53,367 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-01-09 21:36:53,367 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-01-09 21:36:53,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][173], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 47#L1058-36true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-01-09 21:36:53,373 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-01-09 21:36:53,373 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:36:53,373 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:53,373 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:36:53,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][167], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-01-09 21:36:53,380 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-01-09 21:36:53,380 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:53,380 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:53,380 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:53,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][167], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 162#L1059-20true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 180#(= |#race~threads_mask~0| 0), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-01-09 21:36:53,396 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-01-09 21:36:53,396 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:36:53,396 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:36:53,396 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:36:53,434 INFO L124 PetriNetUnfolderBase]: 287/1265 cut-off events. [2025-01-09 21:36:53,434 INFO L125 PetriNetUnfolderBase]: For 1605/1711 co-relation queries the response was YES. [2025-01-09 21:36:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 1265 events. 287/1265 cut-off events. For 1605/1711 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7838 event pairs, 27 based on Foata normal form. 29/1145 useless extension candidates. Maximal degree in co-relation 2466. Up to 188 conditions per place. [2025-01-09 21:36:53,441 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 39 selfloop transitions, 22 changer transitions 0/230 dead transitions. [2025-01-09 21:36:53,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 230 transitions, 940 flow [2025-01-09 21:36:53,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:36:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:36:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2025-01-09 21:36:53,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9310810810810811 [2025-01-09 21:36:53,443 INFO L175 Difference]: Start difference. First operand has 191 places, 212 transitions, 734 flow. Second operand 4 states and 689 transitions. [2025-01-09 21:36:53,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 230 transitions, 940 flow [2025-01-09 21:36:53,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 230 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:53,450 INFO L231 Difference]: Finished difference. Result has 195 places, 217 transitions, 836 flow [2025-01-09 21:36:53,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=836, PETRI_PLACES=195, PETRI_TRANSITIONS=217} [2025-01-09 21:36:53,450 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 23 predicate places. [2025-01-09 21:36:53,450 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 217 transitions, 836 flow [2025-01-09 21:36:53,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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) [2025-01-09 21:36:53,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:53,451 INFO L206 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] [2025-01-09 21:36:53,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:36:53,451 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:53,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2072502184, now seen corresponding path program 1 times [2025-01-09 21:36:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:53,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851801659] [2025-01-09 21:36:53,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:53,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:53,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:36:53,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:36:53,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:53,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:53,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:53,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851801659] [2025-01-09 21:36:53,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851801659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:53,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:53,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:36:53,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853431067] [2025-01-09 21:36:53,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:53,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:36:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:53,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:36:53,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:36:53,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-01-09 21:36:53,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 217 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 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) [2025-01-09 21:36:53,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:53,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-01-09 21:36:53,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:53,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][175], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 47#L1058-36true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-01-09 21:36:53,745 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-01-09 21:36:53,746 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:53,746 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:36:53,746 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:36:53,811 INFO L124 PetriNetUnfolderBase]: 324/1351 cut-off events. [2025-01-09 21:36:53,811 INFO L125 PetriNetUnfolderBase]: For 2684/2842 co-relation queries the response was YES. [2025-01-09 21:36:53,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 1351 events. 324/1351 cut-off events. For 2684/2842 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8525 event pairs, 28 based on Foata normal form. 27/1227 useless extension candidates. Maximal degree in co-relation 2960. Up to 288 conditions per place. [2025-01-09 21:36:53,819 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 41 selfloop transitions, 18 changer transitions 0/237 dead transitions. [2025-01-09 21:36:53,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 237 transitions, 1056 flow [2025-01-09 21:36:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:36:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:36:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2025-01-09 21:36:53,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9378378378378378 [2025-01-09 21:36:53,822 INFO L175 Difference]: Start difference. First operand has 195 places, 217 transitions, 836 flow. Second operand 4 states and 694 transitions. [2025-01-09 21:36:53,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 237 transitions, 1056 flow [2025-01-09 21:36:53,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 237 transitions, 1033 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:53,830 INFO L231 Difference]: Finished difference. Result has 199 places, 223 transitions, 931 flow [2025-01-09 21:36:53,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=931, PETRI_PLACES=199, PETRI_TRANSITIONS=223} [2025-01-09 21:36:53,832 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 27 predicate places. [2025-01-09 21:36:53,832 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 223 transitions, 931 flow [2025-01-09 21:36:53,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 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) [2025-01-09 21:36:53,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:53,833 INFO L206 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] [2025-01-09 21:36:53,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:36:53,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:53,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2041102470, now seen corresponding path program 1 times [2025-01-09 21:36:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:53,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380206978] [2025-01-09 21:36:53,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:53,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:36:53,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:36:53,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:53,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:53,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:53,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380206978] [2025-01-09 21:36:53,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380206978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:53,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:53,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:53,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672281598] [2025-01-09 21:36:53,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:53,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:53,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:53,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:53,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:53,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2025-01-09 21:36:53,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 223 transitions, 931 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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) [2025-01-09 21:36:53,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:53,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2025-01-09 21:36:53,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:54,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][169], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 223#(not (= ~threads_mask~0 0)), 235#true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 200#(<= (+ ~threads_mask~0 1) 0), 47#L1058-36true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-01-09 21:36:54,004 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-01-09 21:36:54,004 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:36:54,004 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:54,004 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:36:54,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][205], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 235#true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-01-09 21:36:54,013 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-01-09 21:36:54,013 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:54,013 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:54,013 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:54,068 INFO L124 PetriNetUnfolderBase]: 323/1495 cut-off events. [2025-01-09 21:36:54,068 INFO L125 PetriNetUnfolderBase]: For 1851/1901 co-relation queries the response was YES. [2025-01-09 21:36:54,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1495 events. 323/1495 cut-off events. For 1851/1901 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10537 event pairs, 40 based on Foata normal form. 7/1339 useless extension candidates. Maximal degree in co-relation 2849. Up to 266 conditions per place. [2025-01-09 21:36:54,080 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 29 selfloop transitions, 7 changer transitions 0/230 dead transitions. [2025-01-09 21:36:54,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 230 transitions, 1023 flow [2025-01-09 21:36:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2025-01-09 21:36:54,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9297297297297298 [2025-01-09 21:36:54,082 INFO L175 Difference]: Start difference. First operand has 199 places, 223 transitions, 931 flow. Second operand 3 states and 516 transitions. [2025-01-09 21:36:54,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 230 transitions, 1023 flow [2025-01-09 21:36:54,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 230 transitions, 1007 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:54,092 INFO L231 Difference]: Finished difference. Result has 202 places, 228 transitions, 971 flow [2025-01-09 21:36:54,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=971, PETRI_PLACES=202, PETRI_TRANSITIONS=228} [2025-01-09 21:36:54,093 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 30 predicate places. [2025-01-09 21:36:54,093 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 228 transitions, 971 flow [2025-01-09 21:36:54,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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) [2025-01-09 21:36:54,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:54,093 INFO L206 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] [2025-01-09 21:36:54,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:36:54,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:54,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1948401372, now seen corresponding path program 1 times [2025-01-09 21:36:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:54,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318307526] [2025-01-09 21:36:54,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:54,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:36:54,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:36:54,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:54,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318307526] [2025-01-09 21:36:54,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318307526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:54,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336533957] [2025-01-09 21:36:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:54,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:54,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:54,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:54,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 185 [2025-01-09 21:36:54,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 228 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 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) [2025-01-09 21:36:54,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:54,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 185 [2025-01-09 21:36:54,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:55,014 INFO L124 PetriNetUnfolderBase]: 463/2077 cut-off events. [2025-01-09 21:36:55,014 INFO L125 PetriNetUnfolderBase]: For 2035/2056 co-relation queries the response was YES. [2025-01-09 21:36:55,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4082 conditions, 2077 events. 463/2077 cut-off events. For 2035/2056 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 15361 event pairs, 84 based on Foata normal form. 6/1838 useless extension candidates. Maximal degree in co-relation 3846. Up to 375 conditions per place. [2025-01-09 21:36:55,025 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 42 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2025-01-09 21:36:55,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 257 transitions, 1157 flow [2025-01-09 21:36:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 973 transitions. [2025-01-09 21:36:55,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8765765765765766 [2025-01-09 21:36:55,028 INFO L175 Difference]: Start difference. First operand has 202 places, 228 transitions, 971 flow. Second operand 6 states and 973 transitions. [2025-01-09 21:36:55,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 257 transitions, 1157 flow [2025-01-09 21:36:55,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 257 transitions, 1143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:55,037 INFO L231 Difference]: Finished difference. Result has 210 places, 249 transitions, 1107 flow [2025-01-09 21:36:55,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1107, PETRI_PLACES=210, PETRI_TRANSITIONS=249} [2025-01-09 21:36:55,038 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 38 predicate places. [2025-01-09 21:36:55,038 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 249 transitions, 1107 flow [2025-01-09 21:36:55,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 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) [2025-01-09 21:36:55,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:55,039 INFO L206 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] [2025-01-09 21:36:55,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:36:55,039 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:55,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:55,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1218120089, now seen corresponding path program 1 times [2025-01-09 21:36:55,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:55,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537486055] [2025-01-09 21:36:55,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:55,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:55,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:36:55,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:36:55,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:55,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537486055] [2025-01-09 21:36:55,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537486055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:55,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901030383] [2025-01-09 21:36:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:55,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:55,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:55,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:55,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:55,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 185 [2025-01-09 21:36:55,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 249 transitions, 1107 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 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) [2025-01-09 21:36:55,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:55,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 185 [2025-01-09 21:36:55,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:55,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([473] L1048-7-->L1048-10: Formula: (and (not (= |v_threadThread1of1ForFork0_#t~bitwise5_7| v_~threads_mask~0_24)) (not (= v_~threads_mask~0_24 0))) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_24} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_24} AuxVars[] AssignedVars[][169], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 202#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 223#(not (= ~threads_mask~0 0)), 204#(not (= ~threads_mask~0 0)), Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 83#L1048-10true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, 217#(not (= ~threads_mask~0 0)), Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2025-01-09 21:36:55,719 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-01-09 21:36:55,719 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-01-09 21:36:55,719 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-01-09 21:36:55,719 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-01-09 21:36:55,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2025-01-09 21:36:55,727 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-01-09 21:36:55,727 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:55,727 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:55,727 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:55,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][248], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2025-01-09 21:36:55,738 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-01-09 21:36:55,738 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:55,738 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:55,738 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:55,764 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), 148#L1048-16true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2025-01-09 21:36:55,765 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2025-01-09 21:36:55,765 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-01-09 21:36:55,765 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-01-09 21:36:55,765 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-01-09 21:36:55,765 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2025-01-09 21:36:55,859 INFO L124 PetriNetUnfolderBase]: 560/2229 cut-off events. [2025-01-09 21:36:55,859 INFO L125 PetriNetUnfolderBase]: For 2215/2286 co-relation queries the response was YES. [2025-01-09 21:36:55,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4781 conditions, 2229 events. 560/2229 cut-off events. For 2215/2286 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 16886 event pairs, 74 based on Foata normal form. 13/2016 useless extension candidates. Maximal degree in co-relation 4506. Up to 491 conditions per place. [2025-01-09 21:36:55,874 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 70 selfloop transitions, 48 changer transitions 0/316 dead transitions. [2025-01-09 21:36:55,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 316 transitions, 1611 flow [2025-01-09 21:36:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1016 transitions. [2025-01-09 21:36:55,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9153153153153153 [2025-01-09 21:36:55,878 INFO L175 Difference]: Start difference. First operand has 210 places, 249 transitions, 1107 flow. Second operand 6 states and 1016 transitions. [2025-01-09 21:36:55,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 316 transitions, 1611 flow [2025-01-09 21:36:55,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 316 transitions, 1611 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:55,891 INFO L231 Difference]: Finished difference. Result has 220 places, 292 transitions, 1495 flow [2025-01-09 21:36:55,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=220, PETRI_TRANSITIONS=292} [2025-01-09 21:36:55,893 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 48 predicate places. [2025-01-09 21:36:55,893 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 292 transitions, 1495 flow [2025-01-09 21:36:55,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 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) [2025-01-09 21:36:55,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:55,894 INFO L206 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] [2025-01-09 21:36:55,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:36:55,894 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:55,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:55,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1598167477, now seen corresponding path program 1 times [2025-01-09 21:36:55,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387544946] [2025-01-09 21:36:55,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:55,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:55,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:36:55,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:36:55,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:55,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:56,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:56,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387544946] [2025-01-09 21:36:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387544946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:56,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234272906] [2025-01-09 21:36:56,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:56,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:56,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:56,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:56,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 185 [2025-01-09 21:36:56,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 292 transitions, 1495 flow. Second operand has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 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) [2025-01-09 21:36:56,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:56,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 185 [2025-01-09 21:36:56,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:56,700 INFO L124 PetriNetUnfolderBase]: 548/2322 cut-off events. [2025-01-09 21:36:56,701 INFO L125 PetriNetUnfolderBase]: For 2686/2783 co-relation queries the response was YES. [2025-01-09 21:36:56,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5453 conditions, 2322 events. 548/2322 cut-off events. For 2686/2783 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 18026 event pairs, 80 based on Foata normal form. 17/2121 useless extension candidates. Maximal degree in co-relation 5200. Up to 534 conditions per place. [2025-01-09 21:36:56,716 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 94 selfloop transitions, 31 changer transitions 7/328 dead transitions. [2025-01-09 21:36:56,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 328 transitions, 1936 flow [2025-01-09 21:36:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2025-01-09 21:36:56,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8864864864864865 [2025-01-09 21:36:56,719 INFO L175 Difference]: Start difference. First operand has 220 places, 292 transitions, 1495 flow. Second operand 6 states and 984 transitions. [2025-01-09 21:36:56,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 328 transitions, 1936 flow [2025-01-09 21:36:56,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 328 transitions, 1918 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:56,735 INFO L231 Difference]: Finished difference. Result has 230 places, 313 transitions, 1778 flow [2025-01-09 21:36:56,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1778, PETRI_PLACES=230, PETRI_TRANSITIONS=313} [2025-01-09 21:36:56,736 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2025-01-09 21:36:56,736 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 313 transitions, 1778 flow [2025-01-09 21:36:56,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 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) [2025-01-09 21:36:56,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:56,736 INFO L206 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] [2025-01-09 21:36:56,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:36:56,737 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:56,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1880074907, now seen corresponding path program 1 times [2025-01-09 21:36:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:56,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726072191] [2025-01-09 21:36:56,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:56,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:36:56,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:36:56,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:56,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:56,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726072191] [2025-01-09 21:36:56,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726072191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:56,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:56,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:56,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766519678] [2025-01-09 21:36:56,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:56,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:56,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:56,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:56,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2025-01-09 21:36:56,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 313 transitions, 1778 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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) [2025-01-09 21:36:56,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:56,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2025-01-09 21:36:56,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:57,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][178], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 47#L1058-36true, Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 204#(not (= ~threads_mask~0 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), 148#L1048-16true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2025-01-09 21:36:57,018 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-01-09 21:36:57,018 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:57,018 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:36:57,018 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:36:57,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([297] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][266], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, 95#L1059-16true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true]) [2025-01-09 21:36:57,039 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-01-09 21:36:57,039 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:57,039 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:36:57,039 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:36:57,170 INFO L124 PetriNetUnfolderBase]: 655/2555 cut-off events. [2025-01-09 21:36:57,171 INFO L125 PetriNetUnfolderBase]: For 3196/3307 co-relation queries the response was YES. [2025-01-09 21:36:57,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6118 conditions, 2555 events. 655/2555 cut-off events. For 3196/3307 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 20329 event pairs, 77 based on Foata normal form. 15/2355 useless extension candidates. Maximal degree in co-relation 5864. Up to 451 conditions per place. [2025-01-09 21:36:57,190 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 33 selfloop transitions, 11 changer transitions 3/328 dead transitions. [2025-01-09 21:36:57,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 328 transitions, 1932 flow [2025-01-09 21:36:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2025-01-09 21:36:57,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423423423423424 [2025-01-09 21:36:57,192 INFO L175 Difference]: Start difference. First operand has 230 places, 313 transitions, 1778 flow. Second operand 3 states and 523 transitions. [2025-01-09 21:36:57,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 328 transitions, 1932 flow [2025-01-09 21:36:57,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 328 transitions, 1876 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:57,208 INFO L231 Difference]: Finished difference. Result has 230 places, 317 transitions, 1780 flow [2025-01-09 21:36:57,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1780, PETRI_PLACES=230, PETRI_TRANSITIONS=317} [2025-01-09 21:36:57,209 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2025-01-09 21:36:57,209 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 317 transitions, 1780 flow [2025-01-09 21:36:57,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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) [2025-01-09 21:36:57,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:57,209 INFO L206 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] [2025-01-09 21:36:57,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:36:57,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2131390540, now seen corresponding path program 1 times [2025-01-09 21:36:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:57,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17132217] [2025-01-09 21:36:57,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:57,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:36:57,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:36:57,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:57,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:57,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:57,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17132217] [2025-01-09 21:36:57,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17132217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:57,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:57,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 21:36:57,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089855802] [2025-01-09 21:36:57,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:57,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 21:36:57,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:57,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 21:36:57,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:36:58,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 185 [2025-01-09 21:36:58,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 317 transitions, 1780 flow. Second operand has 12 states, 12 states have (on average 145.25) internal successors, (1743), 12 states have internal predecessors, (1743), 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) [2025-01-09 21:36:58,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:58,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 185 [2025-01-09 21:36:58,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:58,930 INFO L124 PetriNetUnfolderBase]: 704/2826 cut-off events. [2025-01-09 21:36:58,930 INFO L125 PetriNetUnfolderBase]: For 4115/4267 co-relation queries the response was YES. [2025-01-09 21:36:58,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7377 conditions, 2826 events. 704/2826 cut-off events. For 4115/4267 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 23113 event pairs, 93 based on Foata normal form. 69/2709 useless extension candidates. Maximal degree in co-relation 7102. Up to 460 conditions per place. [2025-01-09 21:36:58,953 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 179 selfloop transitions, 67 changer transitions 4/435 dead transitions. [2025-01-09 21:36:58,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 435 transitions, 2952 flow [2025-01-09 21:36:58,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:36:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:36:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2710 transitions. [2025-01-09 21:36:58,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8138138138138138 [2025-01-09 21:36:58,961 INFO L175 Difference]: Start difference. First operand has 230 places, 317 transitions, 1780 flow. Second operand 18 states and 2710 transitions. [2025-01-09 21:36:58,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 435 transitions, 2952 flow [2025-01-09 21:36:58,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 435 transitions, 2930 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:58,987 INFO L231 Difference]: Finished difference. Result has 245 places, 335 transitions, 2017 flow [2025-01-09 21:36:58,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2017, PETRI_PLACES=245, PETRI_TRANSITIONS=335} [2025-01-09 21:36:58,988 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 73 predicate places. [2025-01-09 21:36:58,988 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 335 transitions, 2017 flow [2025-01-09 21:36:58,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 145.25) internal successors, (1743), 12 states have internal predecessors, (1743), 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) [2025-01-09 21:36:58,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:58,989 INFO L206 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] [2025-01-09 21:36:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:36:58,989 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:36:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash -386079407, now seen corresponding path program 1 times [2025-01-09 21:36:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418527684] [2025-01-09 21:36:58,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:59,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:36:59,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:36:59,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:59,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:59,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:59,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418527684] [2025-01-09 21:36:59,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418527684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:59,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:59,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 21:36:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526240013] [2025-01-09 21:36:59,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:59,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 21:36:59,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:59,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 21:36:59,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:36:59,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 185 [2025-01-09 21:36:59,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 335 transitions, 2017 flow. Second operand has 12 states, 12 states have (on average 145.16666666666666) internal successors, (1742), 12 states have internal predecessors, (1742), 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) [2025-01-09 21:36:59,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:59,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 185 [2025-01-09 21:36:59,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:00,592 INFO L124 PetriNetUnfolderBase]: 639/2696 cut-off events. [2025-01-09 21:37:00,592 INFO L125 PetriNetUnfolderBase]: For 4149/4255 co-relation queries the response was YES. [2025-01-09 21:37:00,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7146 conditions, 2696 events. 639/2696 cut-off events. For 4149/4255 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 21805 event pairs, 89 based on Foata normal form. 29/2548 useless extension candidates. Maximal degree in co-relation 6865. Up to 511 conditions per place. [2025-01-09 21:37:00,611 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 75 selfloop transitions, 6 changer transitions 112/369 dead transitions. [2025-01-09 21:37:00,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 369 transitions, 2651 flow [2025-01-09 21:37:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:37:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:37:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1933 transitions. [2025-01-09 21:37:00,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8037422037422037 [2025-01-09 21:37:00,616 INFO L175 Difference]: Start difference. First operand has 245 places, 335 transitions, 2017 flow. Second operand 13 states and 1933 transitions. [2025-01-09 21:37:00,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 369 transitions, 2651 flow [2025-01-09 21:37:00,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 369 transitions, 2495 flow, removed 16 selfloop flow, removed 8 redundant places. [2025-01-09 21:37:00,673 INFO L231 Difference]: Finished difference. Result has 248 places, 257 transitions, 1422 flow [2025-01-09 21:37:00,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1422, PETRI_PLACES=248, PETRI_TRANSITIONS=257} [2025-01-09 21:37:00,674 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 76 predicate places. [2025-01-09 21:37:00,674 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 257 transitions, 1422 flow [2025-01-09 21:37:00,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 145.16666666666666) internal successors, (1742), 12 states have internal predecessors, (1742), 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) [2025-01-09 21:37:00,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:00,675 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:00,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:37:00,675 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 774043879, now seen corresponding path program 1 times [2025-01-09 21:37:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681289759] [2025-01-09 21:37:00,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:00,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:37:00,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:37:00,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:00,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:00,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681289759] [2025-01-09 21:37:00,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681289759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:00,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:00,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:37:00,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890139066] [2025-01-09 21:37:00,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:00,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:37:00,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:00,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:37:00,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:37:01,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 185 [2025-01-09 21:37:01,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 257 transitions, 1422 flow. Second operand has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 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) [2025-01-09 21:37:01,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:01,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 185 [2025-01-09 21:37:01,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:01,690 INFO L124 PetriNetUnfolderBase]: 1270/4207 cut-off events. [2025-01-09 21:37:01,691 INFO L125 PetriNetUnfolderBase]: For 7031/7164 co-relation queries the response was YES. [2025-01-09 21:37:01,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11014 conditions, 4207 events. 1270/4207 cut-off events. For 7031/7164 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 34360 event pairs, 225 based on Foata normal form. 85/4022 useless extension candidates. Maximal degree in co-relation 10976. Up to 1165 conditions per place. [2025-01-09 21:37:01,719 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 96 selfloop transitions, 49 changer transitions 0/352 dead transitions. [2025-01-09 21:37:01,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 352 transitions, 2237 flow [2025-01-09 21:37:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:37:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:37:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2311 transitions. [2025-01-09 21:37:01,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8922779922779923 [2025-01-09 21:37:01,726 INFO L175 Difference]: Start difference. First operand has 248 places, 257 transitions, 1422 flow. Second operand 14 states and 2311 transitions. [2025-01-09 21:37:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 352 transitions, 2237 flow [2025-01-09 21:37:01,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 352 transitions, 2190 flow, removed 8 selfloop flow, removed 13 redundant places. [2025-01-09 21:37:01,749 INFO L231 Difference]: Finished difference. Result has 225 places, 303 transitions, 1954 flow [2025-01-09 21:37:01,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1954, PETRI_PLACES=225, PETRI_TRANSITIONS=303} [2025-01-09 21:37:01,750 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 53 predicate places. [2025-01-09 21:37:01,750 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 303 transitions, 1954 flow [2025-01-09 21:37:01,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 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) [2025-01-09 21:37:01,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:01,751 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:01,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:37:01,751 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:01,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -890609401, now seen corresponding path program 1 times [2025-01-09 21:37:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044499483] [2025-01-09 21:37:01,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:01,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:37:01,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:37:01,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:01,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:37:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:01,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044499483] [2025-01-09 21:37:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044499483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:01,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:37:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472418590] [2025-01-09 21:37:01,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:37:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:01,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:37:01,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:37:02,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185 [2025-01-09 21:37:02,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 303 transitions, 1954 flow. Second operand has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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) [2025-01-09 21:37:02,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:02,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185 [2025-01-09 21:37:02,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:02,751 INFO L124 PetriNetUnfolderBase]: 1184/4038 cut-off events. [2025-01-09 21:37:02,751 INFO L125 PetriNetUnfolderBase]: For 10190/10357 co-relation queries the response was YES. [2025-01-09 21:37:02,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12023 conditions, 4038 events. 1184/4038 cut-off events. For 10190/10357 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 32935 event pairs, 208 based on Foata normal form. 59/3834 useless extension candidates. Maximal degree in co-relation 11979. Up to 1072 conditions per place. [2025-01-09 21:37:02,784 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 88 selfloop transitions, 61 changer transitions 0/357 dead transitions. [2025-01-09 21:37:02,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 357 transitions, 2600 flow [2025-01-09 21:37:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:37:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:37:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2313 transitions. [2025-01-09 21:37:02,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8930501930501931 [2025-01-09 21:37:02,789 INFO L175 Difference]: Start difference. First operand has 225 places, 303 transitions, 1954 flow. Second operand 14 states and 2313 transitions. [2025-01-09 21:37:02,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 357 transitions, 2600 flow [2025-01-09 21:37:02,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 357 transitions, 2555 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-01-09 21:37:02,830 INFO L231 Difference]: Finished difference. Result has 241 places, 319 transitions, 2218 flow [2025-01-09 21:37:02,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1917, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2218, PETRI_PLACES=241, PETRI_TRANSITIONS=319} [2025-01-09 21:37:02,831 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 69 predicate places. [2025-01-09 21:37:02,831 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 319 transitions, 2218 flow [2025-01-09 21:37:02,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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) [2025-01-09 21:37:02,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:02,832 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:02,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:37:02,832 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:02,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1324179780, now seen corresponding path program 1 times [2025-01-09 21:37:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:02,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345295156] [2025-01-09 21:37:02,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:02,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:37:02,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:37:02,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:37:03,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345295156] [2025-01-09 21:37:03,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345295156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:03,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:03,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:37:03,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860029850] [2025-01-09 21:37:03,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:03,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:37:03,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:03,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:37:03,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:37:03,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185 [2025-01-09 21:37:03,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 319 transitions, 2218 flow. Second operand has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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) [2025-01-09 21:37:03,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:03,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185 [2025-01-09 21:37:03,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:03,972 INFO L124 PetriNetUnfolderBase]: 1399/4856 cut-off events. [2025-01-09 21:37:03,972 INFO L125 PetriNetUnfolderBase]: For 15105/15328 co-relation queries the response was YES. [2025-01-09 21:37:04,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15000 conditions, 4856 events. 1399/4856 cut-off events. For 15105/15328 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 42419 event pairs, 198 based on Foata normal form. 58/4613 useless extension candidates. Maximal degree in co-relation 14951. Up to 1180 conditions per place. [2025-01-09 21:37:04,123 INFO L140 encePairwiseOnDemand]: 173/185 looper letters, 139 selfloop transitions, 47 changer transitions 0/394 dead transitions. [2025-01-09 21:37:04,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 394 transitions, 3150 flow [2025-01-09 21:37:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:37:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:37:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2320 transitions. [2025-01-09 21:37:04,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8957528957528957 [2025-01-09 21:37:04,126 INFO L175 Difference]: Start difference. First operand has 241 places, 319 transitions, 2218 flow. Second operand 14 states and 2320 transitions. [2025-01-09 21:37:04,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 394 transitions, 3150 flow [2025-01-09 21:37:04,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 394 transitions, 3106 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-09 21:37:04,173 INFO L231 Difference]: Finished difference. Result has 259 places, 353 transitions, 2691 flow [2025-01-09 21:37:04,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2691, PETRI_PLACES=259, PETRI_TRANSITIONS=353} [2025-01-09 21:37:04,175 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 87 predicate places. [2025-01-09 21:37:04,175 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 353 transitions, 2691 flow [2025-01-09 21:37:04,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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) [2025-01-09 21:37:04,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:04,177 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:04,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:37:04,177 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:04,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1306134236, now seen corresponding path program 1 times [2025-01-09 21:37:04,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:04,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729718320] [2025-01-09 21:37:04,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:04,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:37:04,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:37:04,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:04,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:37:04,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:04,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729718320] [2025-01-09 21:37:04,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729718320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:04,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:04,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:37:04,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240808555] [2025-01-09 21:37:04,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:04,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:37:04,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:04,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:37:04,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:37:04,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185 [2025-01-09 21:37:04,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 353 transitions, 2691 flow. Second operand has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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) [2025-01-09 21:37:04,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:04,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185 [2025-01-09 21:37:04,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:05,498 INFO L124 PetriNetUnfolderBase]: 1367/5110 cut-off events. [2025-01-09 21:37:05,499 INFO L125 PetriNetUnfolderBase]: For 20282/20522 co-relation queries the response was YES. [2025-01-09 21:37:05,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16313 conditions, 5110 events. 1367/5110 cut-off events. For 20282/20522 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 46626 event pairs, 125 based on Foata normal form. 104/4937 useless extension candidates. Maximal degree in co-relation 16254. Up to 624 conditions per place. [2025-01-09 21:37:05,551 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 63 selfloop transitions, 165 changer transitions 0/436 dead transitions. [2025-01-09 21:37:05,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 436 transitions, 3993 flow [2025-01-09 21:37:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:37:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:37:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2296 transitions. [2025-01-09 21:37:05,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8864864864864865 [2025-01-09 21:37:05,556 INFO L175 Difference]: Start difference. First operand has 259 places, 353 transitions, 2691 flow. Second operand 14 states and 2296 transitions. [2025-01-09 21:37:05,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 436 transitions, 3993 flow [2025-01-09 21:37:05,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 436 transitions, 3867 flow, removed 63 selfloop flow, removed 0 redundant places. [2025-01-09 21:37:05,642 INFO L231 Difference]: Finished difference. Result has 278 places, 410 transitions, 3815 flow [2025-01-09 21:37:05,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=2597, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3815, PETRI_PLACES=278, PETRI_TRANSITIONS=410} [2025-01-09 21:37:05,642 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 106 predicate places. [2025-01-09 21:37:05,643 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 410 transitions, 3815 flow [2025-01-09 21:37:05,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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) [2025-01-09 21:37:05,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:05,643 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:05,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:37:05,643 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:05,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash -892562093, now seen corresponding path program 1 times [2025-01-09 21:37:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:05,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876801932] [2025-01-09 21:37:05,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:37:05,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:37:05,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:05,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:37:05,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876801932] [2025-01-09 21:37:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876801932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:37:05,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142003412] [2025-01-09 21:37:05,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:05,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:37:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:05,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:37:05,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:37:05,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 185 [2025-01-09 21:37:05,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 410 transitions, 3815 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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) [2025-01-09 21:37:05,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:05,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 185 [2025-01-09 21:37:05,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:07,158 INFO L124 PetriNetUnfolderBase]: 1684/7265 cut-off events. [2025-01-09 21:37:07,158 INFO L125 PetriNetUnfolderBase]: For 25604/26012 co-relation queries the response was YES. [2025-01-09 21:37:07,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22828 conditions, 7265 events. 1684/7265 cut-off events. For 25604/26012 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 76690 event pairs, 79 based on Foata normal form. 82/7024 useless extension candidates. Maximal degree in co-relation 22762. Up to 470 conditions per place. [2025-01-09 21:37:07,215 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 77 selfloop transitions, 7 changer transitions 0/441 dead transitions. [2025-01-09 21:37:07,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 441 transitions, 4192 flow [2025-01-09 21:37:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:37:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:37:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1011 transitions. [2025-01-09 21:37:07,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9108108108108108 [2025-01-09 21:37:07,217 INFO L175 Difference]: Start difference. First operand has 278 places, 410 transitions, 3815 flow. Second operand 6 states and 1011 transitions. [2025-01-09 21:37:07,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 441 transitions, 4192 flow [2025-01-09 21:37:07,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 441 transitions, 4047 flow, removed 59 selfloop flow, removed 6 redundant places. [2025-01-09 21:37:07,372 INFO L231 Difference]: Finished difference. Result has 280 places, 415 transitions, 3731 flow [2025-01-09 21:37:07,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=3686, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3731, PETRI_PLACES=280, PETRI_TRANSITIONS=415} [2025-01-09 21:37:07,374 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 108 predicate places. [2025-01-09 21:37:07,374 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 415 transitions, 3731 flow [2025-01-09 21:37:07,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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) [2025-01-09 21:37:07,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:07,376 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:07,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:37:07,376 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:07,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash -443152866, now seen corresponding path program 1 times [2025-01-09 21:37:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:07,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540740304] [2025-01-09 21:37:07,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:07,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:37:07,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:37:07,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:07,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:37:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:07,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540740304] [2025-01-09 21:37:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540740304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:07,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:07,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:37:07,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059022688] [2025-01-09 21:37:07,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:07,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:37:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:07,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:37:07,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:37:07,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-01-09 21:37:07,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 415 transitions, 3731 flow. Second operand has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 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) [2025-01-09 21:37:07,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:07,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-01-09 21:37:07,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:09,286 INFO L124 PetriNetUnfolderBase]: 1968/10406 cut-off events. [2025-01-09 21:37:09,286 INFO L125 PetriNetUnfolderBase]: For 27792/28258 co-relation queries the response was YES. [2025-01-09 21:37:09,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30676 conditions, 10406 events. 1968/10406 cut-off events. For 27792/28258 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 122789 event pairs, 122 based on Foata normal form. 86/10100 useless extension candidates. Maximal degree in co-relation 30610. Up to 682 conditions per place. [2025-01-09 21:37:09,375 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 106 selfloop transitions, 20 changer transitions 0/469 dead transitions. [2025-01-09 21:37:09,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 469 transitions, 4065 flow [2025-01-09 21:37:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:37:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:37:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1881 transitions. [2025-01-09 21:37:09,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243243243243243 [2025-01-09 21:37:09,378 INFO L175 Difference]: Start difference. First operand has 280 places, 415 transitions, 3731 flow. Second operand 11 states and 1881 transitions. [2025-01-09 21:37:09,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 469 transitions, 4065 flow [2025-01-09 21:37:09,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 469 transitions, 4037 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-01-09 21:37:09,632 INFO L231 Difference]: Finished difference. Result has 291 places, 406 transitions, 3491 flow [2025-01-09 21:37:09,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3491, PETRI_PLACES=291, PETRI_TRANSITIONS=406} [2025-01-09 21:37:09,633 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 119 predicate places. [2025-01-09 21:37:09,633 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 406 transitions, 3491 flow [2025-01-09 21:37:09,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 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) [2025-01-09 21:37:09,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:09,634 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:09,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:37:09,634 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:09,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2111532872, now seen corresponding path program 1 times [2025-01-09 21:37:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812593581] [2025-01-09 21:37:09,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:09,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:37:09,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:37:09,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:09,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:09,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:37:09,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:37:09,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:37:09,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:09,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:09,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:37:09,747 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:37:09,747 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2025-01-09 21:37:09,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-01-09 21:37:09,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-01-09 21:37:09,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-01-09 21:37:09,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-01-09 21:37:09,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-01-09 21:37:09,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-01-09 21:37:09,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2025-01-09 21:37:09,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-01-09 21:37:09,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-01-09 21:37:09,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-01-09 21:37:09,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-01-09 21:37:09,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-01-09 21:37:09,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-01-09 21:37:09,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-01-09 21:37:09,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-01-09 21:37:09,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:37:09,752 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 21:37:09,833 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:37:09,834 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:37:09,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:37:09 BasicIcfg [2025-01-09 21:37:09,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:37:09,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:37:09,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:37:09,842 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:37:09,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:50" (3/4) ... [2025-01-09 21:37:09,844 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 21:37:09,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:37:09,846 INFO L158 Benchmark]: Toolchain (without parser) took 20961.75ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 112.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 586.0MB. Max. memory is 16.1GB. [2025-01-09 21:37:09,847 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:37:09,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.31ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 84.5MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:37:09,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.99ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:37:09,847 INFO L158 Benchmark]: Boogie Preprocessor took 35.46ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 80.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:37:09,847 INFO L158 Benchmark]: RCFGBuilder took 550.23ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 58.4MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:37:09,847 INFO L158 Benchmark]: TraceAbstraction took 19839.23ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 57.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 527.3MB. Max. memory is 16.1GB. [2025-01-09 21:37:09,848 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:37:09,849 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.30ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.31ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 84.5MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.99ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.46ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 80.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 550.23ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 58.4MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19839.23ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 57.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 527.3MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: overapproximation of shiftLeft at line 1059, overapproximation of shiftLeft at line 1058, overapproximation of shiftLeft at line 1048, overapproximation of shiftRight at line 1058, overapproximation of bitwiseOr at line 1048, overapproximation of bitwiseAnd at line 1058, overapproximation of bitwiseAnd at line 1059. Possible FailurePath: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=31] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=31, tids={-2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-3:0}, threads_mask=-1, threads_total=31, tids={-2:0}] [L1057] 0 int i = 0; VAL [datas={-3:0}, i=0, threads_mask=-1, threads_total=31, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-3:0}, threads_mask=-1] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={-3:0}, i=0, threads_mask=-1, threads_total=31, tids={-2:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={-3:0}, i=0, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-3:0}, i=0, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] [L1059] EXPR 0 1 << j VAL [datas={-3:0}, i=0, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-3:0}, i=0, j=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={-3:0}, i=0, j=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:1}, datas={-3:0}, i=0, j=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1057] 0 i++ VAL [\old(arg)={0:1}, datas={-3:0}, i=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:1}, datas={-3:0}, threads_mask=-3] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1048] EXPR 1 1 << j VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, i=1, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 209 locations, 16 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: 19.6s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2472 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1750 mSDsluCounter, 1534 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1271 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5243 IncrementalHoareTripleChecker+Invalid, 5429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 263 mSDtfsCounter, 5243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3815occurred in iteration=21, InterpolantAutomatonStates: 166, 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.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1969 NumberOfCodeBlocks, 1969 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1832 ConstructedInterpolants, 0 QuantifiedInterpolants, 5690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 19/19 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 21:37:09,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:37:12,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:37:12,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf [2025-01-09 21:37:12,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:37:12,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:37:12,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:37:12,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:37:12,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:37:12,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:37:12,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:37:12,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:37:12,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:37:12,389 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:37:12,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:37:12,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:37:12,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:37:12,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:37:12,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:37:12,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:37:12,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:37:12,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:37:12,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:37:12,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:37:12,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:37:12,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:37:12,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:37:12,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:37:12,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:37:12,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:37:12,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:37:12,392 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 21:37:12,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 21:37:12,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:37:12,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:37:12,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:37:12,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:37:12,393 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2025-01-09 21:37:12,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:37:12,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:37:12,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:37:12,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:37:12,667 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:37:12,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-01-09 21:37:14,005 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa4b2f305/d9684dce711d454b96f1dd5fcdad756b/FLAG9ef454109 [2025-01-09 21:37:14,358 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:37:14,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-01-09 21:37:14,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa4b2f305/d9684dce711d454b96f1dd5fcdad756b/FLAG9ef454109 [2025-01-09 21:37:14,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa4b2f305/d9684dce711d454b96f1dd5fcdad756b [2025-01-09 21:37:14,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:37:14,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:37:14,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:37:14,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:37:14,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:37:14,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:37:14" (1/1) ... [2025-01-09 21:37:14,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b28c9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14, skipping insertion in model container [2025-01-09 21:37:14,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:37:14" (1/1) ... [2025-01-09 21:37:14,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:37:14,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:37:14,985 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:37:15,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:37:15,107 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:37:15,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15 WrapperNode [2025-01-09 21:37:15,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:37:15,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:37:15,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:37:15,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:37:15,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,158 INFO L138 Inliner]: procedures = 274, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2025-01-09 21:37:15,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:37:15,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:37:15,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:37:15,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:37:15,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:37:15,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:37:15,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:37:15,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:37:15,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (1/1) ... [2025-01-09 21:37:15,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:37:15,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:15,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:37:15,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:37:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-01-09 21:37:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:37:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-01-09 21:37:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:37:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:37:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:37:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:37:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:37:15,278 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:37:15,397 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:37:15,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:37:15,673 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:37:15,674 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:37:15,685 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:37:15,685 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:37:15,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:37:15 BoogieIcfgContainer [2025-01-09 21:37:15,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:37:15,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:37:15,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:37:15,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:37:15,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:37:14" (1/3) ... [2025-01-09 21:37:15,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170bee17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:37:15, skipping insertion in model container [2025-01-09 21:37:15,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:15" (2/3) ... [2025-01-09 21:37:15,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170bee17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:37:15, skipping insertion in model container [2025-01-09 21:37:15,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:37:15" (3/3) ... [2025-01-09 21:37:15,693 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2025-01-09 21:37:15,705 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:37:15,706 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-bitmask-race.i that has 2 procedures, 128 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-01-09 21:37:15,707 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:37:15,777 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:37:15,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 132 transitions, 271 flow [2025-01-09 21:37:15,889 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-01-09 21:37:15,893 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:37:15,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 185 events. 5/185 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 316 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2025-01-09 21:37:15,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 132 transitions, 271 flow [2025-01-09 21:37:15,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 132 transitions, 271 flow [2025-01-09 21:37:15,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:37:15,927 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;@516f9e75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:37:15,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:37:15,937 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:37:15,937 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-01-09 21:37:15,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:37:15,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:15,938 INFO L206 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] [2025-01-09 21:37:15,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:15,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash 60324300, now seen corresponding path program 1 times [2025-01-09 21:37:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120369018] [2025-01-09 21:37:15,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:15,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:15,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:15,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:15,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:37:16,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:37:16,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:37:16,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:16,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:16,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:37:16,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:16,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:16,107 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:16,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120369018] [2025-01-09 21:37:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120369018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:16,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:16,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438759339] [2025-01-09 21:37:16,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:16,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:16,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:16,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:16,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:16,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 132 [2025-01-09 21:37:16,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 132 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2025-01-09 21:37:16,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:16,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 132 [2025-01-09 21:37:16,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:16,262 INFO L124 PetriNetUnfolderBase]: 5/234 cut-off events. [2025-01-09 21:37:16,264 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:37:16,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 234 events. 5/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 540 event pairs, 2 based on Foata normal form. 2/202 useless extension candidates. Maximal degree in co-relation 146. Up to 15 conditions per place. [2025-01-09 21:37:16,269 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 8 selfloop transitions, 2 changer transitions 2/129 dead transitions. [2025-01-09 21:37:16,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 285 flow [2025-01-09 21:37:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-01-09 21:37:16,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9343434343434344 [2025-01-09 21:37:16,284 INFO L175 Difference]: Start difference. First operand has 131 places, 132 transitions, 271 flow. Second operand 3 states and 370 transitions. [2025-01-09 21:37:16,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 285 flow [2025-01-09 21:37:16,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 129 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:37:16,294 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 265 flow [2025-01-09 21:37:16,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2025-01-09 21:37:16,300 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-01-09 21:37:16,301 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 265 flow [2025-01-09 21:37:16,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2025-01-09 21:37:16,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:16,302 INFO L206 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] [2025-01-09 21:37:16,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:37:16,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:16,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:16,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1543417541, now seen corresponding path program 1 times [2025-01-09 21:37:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249370600] [2025-01-09 21:37:16,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:16,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:16,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:16,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:16,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:37:16,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:37:16,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:37:16,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:16,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:16,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:37:16,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:16,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:16,603 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:16,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249370600] [2025-01-09 21:37:16,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249370600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:16,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:16,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:16,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144095764] [2025-01-09 21:37:16,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:16,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:16,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:16,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:16,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2025-01-09 21:37:16,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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) [2025-01-09 21:37:16,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:16,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2025-01-09 21:37:16,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:16,695 INFO L124 PetriNetUnfolderBase]: 20/306 cut-off events. [2025-01-09 21:37:16,696 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:37:16,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 306 events. 20/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1041 event pairs, 7 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 331. Up to 36 conditions per place. [2025-01-09 21:37:16,698 INFO L140 encePairwiseOnDemand]: 121/132 looper letters, 13 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2025-01-09 21:37:16,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 323 flow [2025-01-09 21:37:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2025-01-09 21:37:16,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946969696969697 [2025-01-09 21:37:16,701 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 265 flow. Second operand 3 states and 375 transitions. [2025-01-09 21:37:16,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 323 flow [2025-01-09 21:37:16,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:16,709 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 331 flow [2025-01-09 21:37:16,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2025-01-09 21:37:16,711 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-01-09 21:37:16,712 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 331 flow [2025-01-09 21:37:16,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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) [2025-01-09 21:37:16,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:16,712 INFO L206 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] [2025-01-09 21:37:16,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:37:16,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:16,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:16,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:16,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2104407431, now seen corresponding path program 1 times [2025-01-09 21:37:16,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:16,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899256287] [2025-01-09 21:37:16,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:16,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:16,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:16,917 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:16,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:37:16,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:37:16,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:37:16,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:16,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:16,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:37:16,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:17,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:17,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:17,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899256287] [2025-01-09 21:37:17,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899256287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:17,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:17,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262512478] [2025-01-09 21:37:17,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:17,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:17,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:17,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:17,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 132 [2025-01-09 21:37:17,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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) [2025-01-09 21:37:17,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:17,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 132 [2025-01-09 21:37:17,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:17,085 INFO L124 PetriNetUnfolderBase]: 24/365 cut-off events. [2025-01-09 21:37:17,085 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:37:17,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 365 events. 24/365 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1400 event pairs, 9 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 347. Up to 40 conditions per place. [2025-01-09 21:37:17,087 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 7 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2025-01-09 21:37:17,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 349 flow [2025-01-09 21:37:17,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-01-09 21:37:17,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-01-09 21:37:17,089 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 331 flow. Second operand 3 states and 374 transitions. [2025-01-09 21:37:17,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 349 flow [2025-01-09 21:37:17,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:17,093 INFO L231 Difference]: Finished difference. Result has 131 places, 135 transitions, 325 flow [2025-01-09 21:37:17,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=131, PETRI_TRANSITIONS=135} [2025-01-09 21:37:17,094 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 0 predicate places. [2025-01-09 21:37:17,094 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 135 transitions, 325 flow [2025-01-09 21:37:17,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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) [2025-01-09 21:37:17,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:17,095 INFO L206 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] [2025-01-09 21:37:17,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:37:17,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:17,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:17,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:17,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1330386175, now seen corresponding path program 1 times [2025-01-09 21:37:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:17,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066892766] [2025-01-09 21:37:17,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:17,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:17,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:17,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:17,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:37:17,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:37:17,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:37:17,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:17,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:17,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 21:37:17,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:17,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:17,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:17,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066892766] [2025-01-09 21:37:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066892766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:37:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417866765] [2025-01-09 21:37:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:17,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:37:17,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:17,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:37:17,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:37:17,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2025-01-09 21:37:17,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 135 transitions, 325 flow. Second operand has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 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) [2025-01-09 21:37:17,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:17,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2025-01-09 21:37:17,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:18,087 INFO L124 PetriNetUnfolderBase]: 21/327 cut-off events. [2025-01-09 21:37:18,087 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-01-09 21:37:18,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 327 events. 21/327 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1155 event pairs, 6 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 289. Up to 38 conditions per place. [2025-01-09 21:37:18,090 INFO L140 encePairwiseOnDemand]: 119/132 looper letters, 17 selfloop transitions, 8 changer transitions 5/140 dead transitions. [2025-01-09 21:37:18,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 140 transitions, 395 flow [2025-01-09 21:37:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:37:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:37:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1186 transitions. [2025-01-09 21:37:18,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168044077134986 [2025-01-09 21:37:18,094 INFO L175 Difference]: Start difference. First operand has 131 places, 135 transitions, 325 flow. Second operand 11 states and 1186 transitions. [2025-01-09 21:37:18,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 140 transitions, 395 flow [2025-01-09 21:37:18,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 140 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:37:18,098 INFO L231 Difference]: Finished difference. Result has 145 places, 135 transitions, 353 flow [2025-01-09 21:37:18,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=353, PETRI_PLACES=145, PETRI_TRANSITIONS=135} [2025-01-09 21:37:18,099 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 14 predicate places. [2025-01-09 21:37:18,099 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 135 transitions, 353 flow [2025-01-09 21:37:18,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 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) [2025-01-09 21:37:18,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:18,100 INFO L206 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] [2025-01-09 21:37:18,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:37:18,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:18,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:18,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash 34068787, now seen corresponding path program 1 times [2025-01-09 21:37:18,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:18,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910176349] [2025-01-09 21:37:18,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:18,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:18,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:18,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:18,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:37:18,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:37:18,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:37:18,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:18,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:18,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:37:18,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:18,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:18,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:18,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910176349] [2025-01-09 21:37:18,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910176349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:18,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:18,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518661356] [2025-01-09 21:37:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:18,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:18,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:18,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:18,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2025-01-09 21:37:18,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 135 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2025-01-09 21:37:18,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:18,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2025-01-09 21:37:18,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:18,459 INFO L124 PetriNetUnfolderBase]: 34/348 cut-off events. [2025-01-09 21:37:18,460 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2025-01-09 21:37:18,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 348 events. 34/348 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1390 event pairs, 10 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 437. Up to 63 conditions per place. [2025-01-09 21:37:18,462 INFO L140 encePairwiseOnDemand]: 126/132 looper letters, 16 selfloop transitions, 7 changer transitions 0/140 dead transitions. [2025-01-09 21:37:18,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 415 flow [2025-01-09 21:37:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-01-09 21:37:18,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9318181818181818 [2025-01-09 21:37:18,464 INFO L175 Difference]: Start difference. First operand has 145 places, 135 transitions, 353 flow. Second operand 3 states and 369 transitions. [2025-01-09 21:37:18,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 415 flow [2025-01-09 21:37:18,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 140 transitions, 391 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-01-09 21:37:18,467 INFO L231 Difference]: Finished difference. Result has 136 places, 140 transitions, 385 flow [2025-01-09 21:37:18,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=136, PETRI_TRANSITIONS=140} [2025-01-09 21:37:18,468 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 5 predicate places. [2025-01-09 21:37:18,468 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 140 transitions, 385 flow [2025-01-09 21:37:18,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2025-01-09 21:37:18,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:18,469 INFO L206 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] [2025-01-09 21:37:18,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 21:37:18,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:18,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:18,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1453057958, now seen corresponding path program 1 times [2025-01-09 21:37:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:18,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450684808] [2025-01-09 21:37:18,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:18,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:18,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:18,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:18,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:37:18,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:37:18,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:37:18,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:18,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:18,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:37:18,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:18,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:18,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450684808] [2025-01-09 21:37:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450684808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:18,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:18,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:37:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280574801] [2025-01-09 21:37:18,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:18,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:18,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:18,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:18,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 132 [2025-01-09 21:37:18,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 140 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2025-01-09 21:37:18,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:18,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 132 [2025-01-09 21:37:18,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:18,867 INFO L124 PetriNetUnfolderBase]: 29/337 cut-off events. [2025-01-09 21:37:18,867 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:37:18,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 337 events. 29/337 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1257 event pairs, 7 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 397. Up to 40 conditions per place. [2025-01-09 21:37:18,869 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 4 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-01-09 21:37:18,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 141 transitions, 399 flow [2025-01-09 21:37:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-01-09 21:37:18,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646464646464646 [2025-01-09 21:37:18,871 INFO L175 Difference]: Start difference. First operand has 136 places, 140 transitions, 385 flow. Second operand 3 states and 382 transitions. [2025-01-09 21:37:18,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 141 transitions, 399 flow [2025-01-09 21:37:18,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 141 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:18,874 INFO L231 Difference]: Finished difference. Result has 137 places, 141 transitions, 383 flow [2025-01-09 21:37:18,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=137, PETRI_TRANSITIONS=141} [2025-01-09 21:37:18,875 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 6 predicate places. [2025-01-09 21:37:18,875 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 141 transitions, 383 flow [2025-01-09 21:37:18,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2025-01-09 21:37:18,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:18,876 INFO L206 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] [2025-01-09 21:37:18,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 21:37:19,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:19,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:19,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1583953233, now seen corresponding path program 1 times [2025-01-09 21:37:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:19,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64394611] [2025-01-09 21:37:19,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:19,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:19,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:19,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:19,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 21:37:19,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:37:19,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:37:19,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:19,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:19,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:37:19,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:19,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-01-09 21:37:19,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2025-01-09 21:37:19,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:37:19,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2025-01-09 21:37:19,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:37:19,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 52 [2025-01-09 21:37:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:19,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:19,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:19,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64394611] [2025-01-09 21:37:19,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64394611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:19,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:19,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:37:19,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108380725] [2025-01-09 21:37:19,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:19,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:37:19,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:19,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:37:19,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:37:19,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2025-01-09 21:37:19,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 141 transitions, 383 flow. Second operand has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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) [2025-01-09 21:37:19,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:19,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2025-01-09 21:37:19,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:20,150 INFO L124 PetriNetUnfolderBase]: 92/606 cut-off events. [2025-01-09 21:37:20,150 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:37:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 606 events. 92/606 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3283 event pairs, 8 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 905. Up to 137 conditions per place. [2025-01-09 21:37:20,153 INFO L140 encePairwiseOnDemand]: 111/132 looper letters, 32 selfloop transitions, 20 changer transitions 0/157 dead transitions. [2025-01-09 21:37:20,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 157 transitions, 519 flow [2025-01-09 21:37:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:37:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:37:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1157 transitions. [2025-01-09 21:37:20,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7304292929292929 [2025-01-09 21:37:20,157 INFO L175 Difference]: Start difference. First operand has 137 places, 141 transitions, 383 flow. Second operand 12 states and 1157 transitions. [2025-01-09 21:37:20,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 157 transitions, 519 flow [2025-01-09 21:37:20,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 157 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:37:20,161 INFO L231 Difference]: Finished difference. Result has 152 places, 147 transitions, 461 flow [2025-01-09 21:37:20,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=461, PETRI_PLACES=152, PETRI_TRANSITIONS=147} [2025-01-09 21:37:20,164 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 21 predicate places. [2025-01-09 21:37:20,164 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 147 transitions, 461 flow [2025-01-09 21:37:20,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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) [2025-01-09 21:37:20,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:20,166 INFO L206 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] [2025-01-09 21:37:20,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 21:37:20,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:20,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:20,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:20,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1033412013, now seen corresponding path program 1 times [2025-01-09 21:37:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:20,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50057029] [2025-01-09 21:37:20,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:20,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:20,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:20,371 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:20,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 21:37:20,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:37:20,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:37:20,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:20,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:20,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 21:37:20,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:20,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-01-09 21:37:20,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2025-01-09 21:37:20,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:37:20,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52 [2025-01-09 21:37:20,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:37:20,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71 [2025-01-09 21:37:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:20,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:20,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:20,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50057029] [2025-01-09 21:37:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50057029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:20,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:20,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:37:20,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50650915] [2025-01-09 21:37:20,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:20,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:37:20,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:20,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:37:20,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:37:20,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2025-01-09 21:37:20,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 147 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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) [2025-01-09 21:37:20,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:20,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2025-01-09 21:37:20,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:21,048 INFO L124 PetriNetUnfolderBase]: 132/640 cut-off events. [2025-01-09 21:37:21,048 INFO L125 PetriNetUnfolderBase]: For 82/86 co-relation queries the response was YES. [2025-01-09 21:37:21,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 640 events. 132/640 cut-off events. For 82/86 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3433 event pairs, 36 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1018. Up to 198 conditions per place. [2025-01-09 21:37:21,052 INFO L140 encePairwiseOnDemand]: 117/132 looper letters, 24 selfloop transitions, 39 changer transitions 0/184 dead transitions. [2025-01-09 21:37:21,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 184 transitions, 693 flow [2025-01-09 21:37:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:37:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:37:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions. [2025-01-09 21:37:21,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9002525252525253 [2025-01-09 21:37:21,056 INFO L175 Difference]: Start difference. First operand has 152 places, 147 transitions, 461 flow. Second operand 6 states and 713 transitions. [2025-01-09 21:37:21,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 184 transitions, 693 flow [2025-01-09 21:37:21,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 184 transitions, 667 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:37:21,061 INFO L231 Difference]: Finished difference. Result has 156 places, 184 transitions, 725 flow [2025-01-09 21:37:21,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=725, PETRI_PLACES=156, PETRI_TRANSITIONS=184} [2025-01-09 21:37:21,062 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 25 predicate places. [2025-01-09 21:37:21,062 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 184 transitions, 725 flow [2025-01-09 21:37:21,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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) [2025-01-09 21:37:21,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:21,063 INFO L206 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] [2025-01-09 21:37:21,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 21:37:21,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:21,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:21,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1564119274, now seen corresponding path program 1 times [2025-01-09 21:37:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:21,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388832255] [2025-01-09 21:37:21,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:21,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:21,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:21,268 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:21,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 21:37:21,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:37:21,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:37:21,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:21,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:21,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 21:37:21,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:21,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:37:21,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2025-01-09 21:37:21,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:37:21,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2025-01-09 21:37:21,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:37:21,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2025-01-09 21:37:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:21,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:21,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388832255] [2025-01-09 21:37:21,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388832255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:21,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:21,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:37:21,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745068158] [2025-01-09 21:37:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:21,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:37:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:21,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:37:21,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:37:22,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 132 [2025-01-09 21:37:22,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 184 transitions, 725 flow. Second operand has 11 states, 11 states have (on average 96.36363636363636) internal successors, (1060), 11 states have internal predecessors, (1060), 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) [2025-01-09 21:37:22,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:22,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 132 [2025-01-09 21:37:22,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:22,321 INFO L124 PetriNetUnfolderBase]: 149/749 cut-off events. [2025-01-09 21:37:22,322 INFO L125 PetriNetUnfolderBase]: For 404/453 co-relation queries the response was YES. [2025-01-09 21:37:22,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 749 events. 149/749 cut-off events. For 404/453 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4457 event pairs, 20 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 1597. Up to 135 conditions per place. [2025-01-09 21:37:22,327 INFO L140 encePairwiseOnDemand]: 107/132 looper letters, 71 selfloop transitions, 47 changer transitions 2/230 dead transitions. [2025-01-09 21:37:22,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 230 transitions, 1188 flow [2025-01-09 21:37:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:37:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:37:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1200 transitions. [2025-01-09 21:37:22,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2025-01-09 21:37:22,331 INFO L175 Difference]: Start difference. First operand has 156 places, 184 transitions, 725 flow. Second operand 12 states and 1200 transitions. [2025-01-09 21:37:22,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 230 transitions, 1188 flow [2025-01-09 21:37:22,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 230 transitions, 1164 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-01-09 21:37:22,338 INFO L231 Difference]: Finished difference. Result has 172 places, 217 transitions, 1067 flow [2025-01-09 21:37:22,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1067, PETRI_PLACES=172, PETRI_TRANSITIONS=217} [2025-01-09 21:37:22,339 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 41 predicate places. [2025-01-09 21:37:22,340 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 217 transitions, 1067 flow [2025-01-09 21:37:22,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 96.36363636363636) internal successors, (1060), 11 states have internal predecessors, (1060), 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) [2025-01-09 21:37:22,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:22,340 INFO L206 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] [2025-01-09 21:37:22,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 21:37:22,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:22,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1437569933, now seen corresponding path program 1 times [2025-01-09 21:37:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162593047] [2025-01-09 21:37:22,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:22,544 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:22,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 21:37:22,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:37:22,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:37:22,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:22,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:22,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:37:22,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:37:22,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:22,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:22,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162593047] [2025-01-09 21:37:22,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162593047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:22,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341776691] [2025-01-09 21:37:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:22,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:22,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:22,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:22,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 132 [2025-01-09 21:37:22,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 217 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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) [2025-01-09 21:37:22,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:22,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 132 [2025-01-09 21:37:22,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:22,774 INFO L124 PetriNetUnfolderBase]: 150/783 cut-off events. [2025-01-09 21:37:22,775 INFO L125 PetriNetUnfolderBase]: For 458/491 co-relation queries the response was YES. [2025-01-09 21:37:22,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 783 events. 150/783 cut-off events. For 458/491 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4826 event pairs, 19 based on Foata normal form. 4/759 useless extension candidates. Maximal degree in co-relation 1768. Up to 143 conditions per place. [2025-01-09 21:37:22,780 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 15 selfloop transitions, 11 changer transitions 12/224 dead transitions. [2025-01-09 21:37:22,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 224 transitions, 1147 flow [2025-01-09 21:37:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-01-09 21:37:22,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-01-09 21:37:22,782 INFO L175 Difference]: Start difference. First operand has 172 places, 217 transitions, 1067 flow. Second operand 3 states and 374 transitions. [2025-01-09 21:37:22,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 224 transitions, 1147 flow [2025-01-09 21:37:22,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 224 transitions, 1101 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-01-09 21:37:22,793 INFO L231 Difference]: Finished difference. Result has 172 places, 212 transitions, 1067 flow [2025-01-09 21:37:22,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=172, PETRI_TRANSITIONS=212} [2025-01-09 21:37:22,794 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 41 predicate places. [2025-01-09 21:37:22,795 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 212 transitions, 1067 flow [2025-01-09 21:37:22,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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) [2025-01-09 21:37:22,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:22,795 INFO L206 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] [2025-01-09 21:37:22,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 21:37:22,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:22,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:22,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1778680790, now seen corresponding path program 1 times [2025-01-09 21:37:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633870228] [2025-01-09 21:37:22,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:22,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:22,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:22,999 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:23,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 21:37:23,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:37:23,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:37:23,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:23,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:23,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 21:37:23,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:23,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-01-09 21:37:23,224 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-09 21:37:23,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-01-09 21:37:24,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-01-09 21:37:24,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2025-01-09 21:37:24,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2025-01-09 21:37:24,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 66 [2025-01-09 21:37:24,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2025-01-09 21:37:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:25,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:37:25,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633870228] [2025-01-09 21:37:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633870228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 21:37:25,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423723885] [2025-01-09 21:37:25,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:25,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 21:37:25,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:25,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 21:37:25,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-01-09 21:37:27,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 132 [2025-01-09 21:37:27,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 212 transitions, 1067 flow. Second operand has 20 states, 20 states have (on average 79.05) internal successors, (1581), 20 states have internal predecessors, (1581), 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) [2025-01-09 21:37:27,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:27,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 132 [2025-01-09 21:37:27,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:31,241 INFO L124 PetriNetUnfolderBase]: 267/1078 cut-off events. [2025-01-09 21:37:31,241 INFO L125 PetriNetUnfolderBase]: For 988/1075 co-relation queries the response was YES. [2025-01-09 21:37:31,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3020 conditions, 1078 events. 267/1078 cut-off events. For 988/1075 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6894 event pairs, 18 based on Foata normal form. 52/1106 useless extension candidates. Maximal degree in co-relation 2825. Up to 176 conditions per place. [2025-01-09 21:37:31,248 INFO L140 encePairwiseOnDemand]: 102/132 looper letters, 169 selfloop transitions, 70 changer transitions 0/330 dead transitions. [2025-01-09 21:37:31,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 330 transitions, 2079 flow [2025-01-09 21:37:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:37:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:37:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2479 transitions. [2025-01-09 21:37:31,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626010101010101 [2025-01-09 21:37:31,257 INFO L175 Difference]: Start difference. First operand has 172 places, 212 transitions, 1067 flow. Second operand 30 states and 2479 transitions. [2025-01-09 21:37:31,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 330 transitions, 2079 flow [2025-01-09 21:37:31,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 330 transitions, 2051 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:37:31,272 INFO L231 Difference]: Finished difference. Result has 191 places, 228 transitions, 1255 flow [2025-01-09 21:37:31,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1255, PETRI_PLACES=191, PETRI_TRANSITIONS=228} [2025-01-09 21:37:31,273 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 60 predicate places. [2025-01-09 21:37:31,273 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 228 transitions, 1255 flow [2025-01-09 21:37:31,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 79.05) internal successors, (1581), 20 states have internal predecessors, (1581), 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) [2025-01-09 21:37:31,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:31,274 INFO L206 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] [2025-01-09 21:37:31,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 21:37:31,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:31,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:31,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:31,475 INFO L85 PathProgramCache]: Analyzing trace with hash 338127301, now seen corresponding path program 1 times [2025-01-09 21:37:31,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:31,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670322688] [2025-01-09 21:37:31,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:31,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:31,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:31,480 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:31,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 21:37:31,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:37:31,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:37:31,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:31,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:31,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 21:37:31,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:37:31,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-01-09 21:37:31,649 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-09 21:37:31,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-01-09 21:37:31,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:37:31,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2025-01-09 21:37:31,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2025-01-09 21:37:31,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2025-01-09 21:37:32,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-01-09 21:37:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:32,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:37:32,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)))) (and (forall ((v_ArrVal_212 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store |c_#race| c_~datas~0.base v_ArrVal_212) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| (_ bv3 32) .cse0)))) (forall ((v_ArrVal_212 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store |c_#race| c_~datas~0.base v_ArrVal_212) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| (_ bv2 32) .cse0)))) (forall ((v_ArrVal_212 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_212) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| (_ bv1 32) .cse0)) (_ bv0 1))) (forall ((v_ArrVal_212 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store |c_#race| c_~datas~0.base v_ArrVal_212) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))))) is different from false [2025-01-09 21:37:32,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| (_ bv3 32) .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 (_ bv0 1))))) (and (forall ((v_ArrVal_212 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_212) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) (_ bv0 1))) (forall ((v_ArrVal_212 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_212) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| (_ bv2 32) .cse1)) (_ bv0 1))) (forall ((v_ArrVal_212 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store .cse0 c_~datas~0.base v_ArrVal_212) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_212 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store .cse0 c_~datas~0.base v_ArrVal_212) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| (_ bv1 32) .cse1)))))))) is different from false [2025-01-09 21:37:32,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:37:32,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-01-09 21:37:32,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:37:32,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2025-01-09 21:37:32,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-01-09 21:37:32,791 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-01-09 21:37:32,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-01-09 21:37:32,800 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-01-09 21:37:32,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-01-09 21:37:32,808 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-01-09 21:37:32,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-01-09 21:37:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:37:32,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:37:32,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670322688] [2025-01-09 21:37:32,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670322688] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:37:32,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:37:32,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2025-01-09 21:37:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456630106] [2025-01-09 21:37:32,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 21:37:32,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:37:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:37:32,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:37:32,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=326, Unknown=23, NotChecked=78, Total=506 [2025-01-09 21:37:33,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 132 [2025-01-09 21:37:33,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 228 transitions, 1255 flow. Second operand has 23 states, 23 states have (on average 77.82608695652173) internal successors, (1790), 23 states have internal predecessors, (1790), 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) [2025-01-09 21:37:33,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:33,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 132 [2025-01-09 21:37:33,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:34,315 INFO L124 PetriNetUnfolderBase]: 227/969 cut-off events. [2025-01-09 21:37:34,316 INFO L125 PetriNetUnfolderBase]: For 961/964 co-relation queries the response was YES. [2025-01-09 21:37:34,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 969 events. 227/969 cut-off events. For 961/964 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5910 event pairs, 36 based on Foata normal form. 11/944 useless extension candidates. Maximal degree in co-relation 2799. Up to 218 conditions per place. [2025-01-09 21:37:34,320 INFO L140 encePairwiseOnDemand]: 111/132 looper letters, 54 selfloop transitions, 19 changer transitions 97/271 dead transitions. [2025-01-09 21:37:34,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 271 transitions, 1883 flow [2025-01-09 21:37:34,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:37:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:37:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1512 transitions. [2025-01-09 21:37:34,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6028708133971292 [2025-01-09 21:37:34,323 INFO L175 Difference]: Start difference. First operand has 191 places, 228 transitions, 1255 flow. Second operand 19 states and 1512 transitions. [2025-01-09 21:37:34,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 271 transitions, 1883 flow [2025-01-09 21:37:34,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 271 transitions, 1738 flow, removed 3 selfloop flow, removed 17 redundant places. [2025-01-09 21:37:34,335 INFO L231 Difference]: Finished difference. Result has 191 places, 174 transitions, 799 flow [2025-01-09 21:37:34,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=799, PETRI_PLACES=191, PETRI_TRANSITIONS=174} [2025-01-09 21:37:34,338 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 60 predicate places. [2025-01-09 21:37:34,338 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 174 transitions, 799 flow [2025-01-09 21:37:34,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 77.82608695652173) internal successors, (1790), 23 states have internal predecessors, (1790), 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) [2025-01-09 21:37:34,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:34,339 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:34,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 21:37:34,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:34,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:37:34,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash 571921525, now seen corresponding path program 1 times [2025-01-09 21:37:34,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:37:34,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688706534] [2025-01-09 21:37:34,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:34,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:34,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:37:34,543 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:37:34,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 21:37:34,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:37:34,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:37:34,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:34,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:34,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:37:34,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:37:34,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:37:34,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:34,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:34,734 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-09 21:37:34,734 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:37:34,735 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2025-01-09 21:37:34,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-01-09 21:37:34,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-01-09 21:37:34,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-01-09 21:37:34,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-01-09 21:37:34,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 21:37:34,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:37:34,938 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:34,988 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:37:34,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:37:34,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:37:34 BasicIcfg [2025-01-09 21:37:34,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:37:34,993 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:37:34,993 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:37:34,993 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:37:34,994 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:37:15" (3/4) ... [2025-01-09 21:37:34,995 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:37:35,052 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 21:37:35,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:37:35,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:37:35,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:37:35,104 INFO L158 Benchmark]: Toolchain (without parser) took 20700.28ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 57.6MB in the beginning and 72.1MB in the end (delta: -14.5MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2025-01-09 21:37:35,104 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 83.9MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:37:35,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.71ms. Allocated memory is still 83.9MB. Free memory was 57.4MB in the beginning and 48.0MB in the end (delta: 9.3MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-01-09 21:37:35,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.22ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 46.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:37:35,106 INFO L158 Benchmark]: Boogie Preprocessor took 50.17ms. Allocated memory is still 83.9MB. Free memory was 45.7MB in the beginning and 43.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:37:35,106 INFO L158 Benchmark]: RCFGBuilder took 475.86ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 43.9MB in the beginning and 65.8MB in the end (delta: -21.8MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2025-01-09 21:37:35,106 INFO L158 Benchmark]: TraceAbstraction took 19305.03ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 65.0MB in the beginning and 82.3MB in the end (delta: -17.3MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2025-01-09 21:37:35,107 INFO L158 Benchmark]: Witness Printer took 110.26ms. Allocated memory is still 184.5MB. Free memory was 82.3MB in the beginning and 72.1MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:37:35,108 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.37ms. Allocated memory is still 83.9MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 702.71ms. Allocated memory is still 83.9MB. Free memory was 57.4MB in the beginning and 48.0MB in the end (delta: 9.3MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.22ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 46.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.17ms. Allocated memory is still 83.9MB. Free memory was 45.7MB in the beginning and 43.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 475.86ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 43.9MB in the beginning and 65.8MB in the end (delta: -21.8MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19305.03ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 65.0MB in the beginning and 82.3MB in the end (delta: -17.3MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * Witness Printer took 110.26ms. Allocated memory is still 184.5MB. Free memory was 82.3MB in the beginning and 72.1MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1058]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=2] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=2, tids={1:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={4:0}, threads_mask=-1, threads_total=2, tids={1:0}] [L1057] 0 int i = 0; VAL [datas={4:0}, i=0, threads_mask=-1, threads_total=2, tids={1:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={4:0}, threads_mask=-1] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={4:0}, i=0, threads_mask=-1, threads_total=2, tids={1:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={4:0}, i=0, j=0, threads_mask=-1, threads_total=2, tids={1:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={4:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={1:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={4:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={1:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={4:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={1:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, i=1, j=0, threads_mask=-2, threads_total=2, tids={1:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, i=1, j=0, threads_mask=-1, threads_total=2, tids={1:0}] Now there is a data race on ~threads_mask~0 between C: threads_mask |= 1 << j [1048] and C: ffs(threads_mask) [1058] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 157 locations, 16 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: 19.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1657 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1381 mSDsluCounter, 3732 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 201 IncrementalHoareTripleChecker+Unchecked, 3596 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6019 IncrementalHoareTripleChecker+Invalid, 6371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 136 mSDtfsCounter, 6019 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 706 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1255occurred in iteration=11, InterpolantAutomatonStates: 108, 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.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 775 ConstructedInterpolants, 11 QuantifiedInterpolants, 5360 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1101 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 6/8 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:37:35,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)