./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --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/weaver/chl-node-symm.wvr.c -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 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:40,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:40,991 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:30:40,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:40,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:41,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:41,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:41,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:41,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:41,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:41,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:41,009 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:41,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:41,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:41,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:41,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:41,010 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:41,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:41,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:41,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:41,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:41,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:41,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:41,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:41,010 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-01-09 21:30:41,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:41,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:41,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:41,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:41,187 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:41,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-01-09 21:30:42,332 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/640d064d9/928b4d32499346f485d94bd9632c8c14/FLAGe07c2ec97 [2025-01-09 21:30:42,588 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:42,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-01-09 21:30:42,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/640d064d9/928b4d32499346f485d94bd9632c8c14/FLAGe07c2ec97 [2025-01-09 21:30:42,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/640d064d9/928b4d32499346f485d94bd9632c8c14 [2025-01-09 21:30:42,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:42,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:42,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:42,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:42,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:42,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:42,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7367a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42, skipping insertion in model container [2025-01-09 21:30:42,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:42,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:42,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:42,869 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:42,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:42,957 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:42,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42 WrapperNode [2025-01-09 21:30:42,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:42,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:42,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:42,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:42,971 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:30:42" (1/1) ... [2025-01-09 21:30:42,981 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:30:42" (1/1) ... [2025-01-09 21:30:43,028 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 529 [2025-01-09 21:30:43,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:43,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:43,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:43,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:43,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:43,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:43,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:43,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:43,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (1/1) ... [2025-01-09 21:30:43,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:43,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:43,124 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:30:43,139 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:30:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:43,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:43,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:43,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:43,166 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:30:43,244 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:43,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:43,721 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:43,721 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:43,735 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:43,735 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:43,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:43 BoogieIcfgContainer [2025-01-09 21:30:43,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:43,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:43,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:43,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:43,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:42" (1/3) ... [2025-01-09 21:30:43,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2273d3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:43, skipping insertion in model container [2025-01-09 21:30:43,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:42" (2/3) ... [2025-01-09 21:30:43,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2273d3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:43, skipping insertion in model container [2025-01-09 21:30:43,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:43" (3/3) ... [2025-01-09 21:30:43,741 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-01-09 21:30:43,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:43,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 685 locations, 1 initial locations, 4 loop locations, and 78 error locations. [2025-01-09 21:30:43,751 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:43,862 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:30:43,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 691 places, 713 transitions, 1440 flow [2025-01-09 21:30:44,102 INFO L124 PetriNetUnfolderBase]: 29/711 cut-off events. [2025-01-09 21:30:44,107 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:44,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 711 events. 29/711 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1123 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 517. Up to 2 conditions per place. [2025-01-09 21:30:44,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 691 places, 713 transitions, 1440 flow [2025-01-09 21:30:44,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 669 places, 689 transitions, 1390 flow [2025-01-09 21:30:44,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:44,165 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;@3a2d10ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:44,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2025-01-09 21:30:44,178 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:44,178 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-01-09 21:30:44,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:44,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:44,179 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] [2025-01-09 21:30:44,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:44,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1577956935, now seen corresponding path program 1 times [2025-01-09 21:30:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:44,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803628062] [2025-01-09 21:30:44,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:44,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:44,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:30:44,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:30:44,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:44,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:44,378 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:30:44,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:44,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803628062] [2025-01-09 21:30:44,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803628062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:44,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:44,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:44,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748825565] [2025-01-09 21:30:44,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:44,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:44,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:44,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:44,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 713 [2025-01-09 21:30:44,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 689 transitions, 1390 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:30:44,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:44,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 713 [2025-01-09 21:30:44,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:44,774 INFO L124 PetriNetUnfolderBase]: 39/1279 cut-off events. [2025-01-09 21:30:44,774 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-09 21:30:44,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1279 events. 39/1279 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5131 event pairs, 15 based on Foata normal form. 29/1085 useless extension candidates. Maximal degree in co-relation 949. Up to 48 conditions per place. [2025-01-09 21:30:44,787 INFO L140 encePairwiseOnDemand]: 695/713 looper letters, 17 selfloop transitions, 2 changer transitions 11/673 dead transitions. [2025-01-09 21:30:44,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 673 transitions, 1396 flow [2025-01-09 21:30:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2060 transitions. [2025-01-09 21:30:44,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630668536699393 [2025-01-09 21:30:44,810 INFO L175 Difference]: Start difference. First operand has 669 places, 689 transitions, 1390 flow. Second operand 3 states and 2060 transitions. [2025-01-09 21:30:44,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 673 transitions, 1396 flow [2025-01-09 21:30:44,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 673 transitions, 1388 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:30:44,833 INFO L231 Difference]: Finished difference. Result has 666 places, 662 transitions, 1332 flow [2025-01-09 21:30:44,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1332, PETRI_PLACES=666, PETRI_TRANSITIONS=662} [2025-01-09 21:30:44,840 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -3 predicate places. [2025-01-09 21:30:44,840 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 662 transitions, 1332 flow [2025-01-09 21:30:44,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:30:44,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:44,842 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] [2025-01-09 21:30:44,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:44,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1699496375, now seen corresponding path program 1 times [2025-01-09 21:30:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223109122] [2025-01-09 21:30:44,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:44,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:30:44,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:30:44,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:44,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:44,902 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:30:44,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223109122] [2025-01-09 21:30:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223109122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:44,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:44,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:44,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80881885] [2025-01-09 21:30:44,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:44,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:44,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:44,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:44,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 713 [2025-01-09 21:30:44,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 662 transitions, 1332 flow. Second operand has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 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:30:44,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:44,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 713 [2025-01-09 21:30:44,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:45,246 INFO L124 PetriNetUnfolderBase]: 97/2038 cut-off events. [2025-01-09 21:30:45,246 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-01-09 21:30:45,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 2038 events. 97/2038 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11657 event pairs, 48 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 2141. Up to 125 conditions per place. [2025-01-09 21:30:45,261 INFO L140 encePairwiseOnDemand]: 702/713 looper letters, 24 selfloop transitions, 1 changer transitions 0/652 dead transitions. [2025-01-09 21:30:45,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 652 transitions, 1362 flow [2025-01-09 21:30:45,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2025-01-09 21:30:45,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434315100514259 [2025-01-09 21:30:45,268 INFO L175 Difference]: Start difference. First operand has 666 places, 662 transitions, 1332 flow. Second operand 3 states and 2018 transitions. [2025-01-09 21:30:45,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 652 transitions, 1362 flow [2025-01-09 21:30:45,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 652 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:45,278 INFO L231 Difference]: Finished difference. Result has 645 places, 652 transitions, 1310 flow [2025-01-09 21:30:45,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=645, PETRI_TRANSITIONS=652} [2025-01-09 21:30:45,279 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -24 predicate places. [2025-01-09 21:30:45,280 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 652 transitions, 1310 flow [2025-01-09 21:30:45,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 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:30:45,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:45,281 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] [2025-01-09 21:30:45,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:45,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:45,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1226694163, now seen corresponding path program 1 times [2025-01-09 21:30:45,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:45,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053252653] [2025-01-09 21:30:45,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:45,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:30:45,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:30:45,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:45,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:45,332 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:30:45,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053252653] [2025-01-09 21:30:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053252653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:45,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:45,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:45,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605911591] [2025-01-09 21:30:45,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:45,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:45,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:45,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:45,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:45,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 713 [2025-01-09 21:30:45,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 652 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:30:45,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:45,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 713 [2025-01-09 21:30:45,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:45,530 INFO L124 PetriNetUnfolderBase]: 39/1263 cut-off events. [2025-01-09 21:30:45,530 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-01-09 21:30:45,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1263 events. 39/1263 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4864 event pairs, 15 based on Foata normal form. 0/1067 useless extension candidates. Maximal degree in co-relation 1285. Up to 48 conditions per place. [2025-01-09 21:30:45,537 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 17 selfloop transitions, 2 changer transitions 0/651 dead transitions. [2025-01-09 21:30:45,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 651 transitions, 1346 flow [2025-01-09 21:30:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2045 transitions. [2025-01-09 21:30:45,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560542309490416 [2025-01-09 21:30:45,541 INFO L175 Difference]: Start difference. First operand has 645 places, 652 transitions, 1310 flow. Second operand 3 states and 2045 transitions. [2025-01-09 21:30:45,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 651 transitions, 1346 flow [2025-01-09 21:30:45,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 651 transitions, 1345 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:45,547 INFO L231 Difference]: Finished difference. Result has 645 places, 651 transitions, 1311 flow [2025-01-09 21:30:45,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=645, PETRI_TRANSITIONS=651} [2025-01-09 21:30:45,549 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -24 predicate places. [2025-01-09 21:30:45,549 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 651 transitions, 1311 flow [2025-01-09 21:30:45,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:30:45,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:45,550 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] [2025-01-09 21:30:45,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:45,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:45,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1447401519, now seen corresponding path program 1 times [2025-01-09 21:30:45,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:45,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497704570] [2025-01-09 21:30:45,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:45,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:45,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:30:45,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:30:45,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:45,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:45,610 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:30:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:45,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497704570] [2025-01-09 21:30:45,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497704570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:45,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414659736] [2025-01-09 21:30:45,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:45,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:45,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:45,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:45,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 713 [2025-01-09 21:30:45,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 651 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 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:30:45,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:45,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 713 [2025-01-09 21:30:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:45,852 INFO L124 PetriNetUnfolderBase]: 98/2027 cut-off events. [2025-01-09 21:30:45,853 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:30:45,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 2027 events. 98/2027 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 11502 event pairs, 48 based on Foata normal form. 0/1726 useless extension candidates. Maximal degree in co-relation 2134. Up to 127 conditions per place. [2025-01-09 21:30:45,863 INFO L140 encePairwiseOnDemand]: 702/713 looper letters, 24 selfloop transitions, 1 changer transitions 0/641 dead transitions. [2025-01-09 21:30:45,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 641 transitions, 1341 flow [2025-01-09 21:30:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2025-01-09 21:30:45,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434315100514259 [2025-01-09 21:30:45,866 INFO L175 Difference]: Start difference. First operand has 645 places, 651 transitions, 1311 flow. Second operand 3 states and 2018 transitions. [2025-01-09 21:30:45,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 641 transitions, 1341 flow [2025-01-09 21:30:45,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 641 transitions, 1337 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:45,873 INFO L231 Difference]: Finished difference. Result has 635 places, 641 transitions, 1289 flow [2025-01-09 21:30:45,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=635, PETRI_TRANSITIONS=641} [2025-01-09 21:30:45,874 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-01-09 21:30:45,874 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 641 transitions, 1289 flow [2025-01-09 21:30:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 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:30:45,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:45,875 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] [2025-01-09 21:30:45,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:45,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash -921992185, now seen corresponding path program 1 times [2025-01-09 21:30:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936518435] [2025-01-09 21:30:45,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:45,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:30:45,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:30:45,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:45,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:45,935 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:30:45,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:45,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936518435] [2025-01-09 21:30:45,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936518435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:45,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:45,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382033581] [2025-01-09 21:30:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:45,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:45,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:45,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:45,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:45,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-01-09 21:30:45,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 641 transitions, 1289 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:45,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:45,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-01-09 21:30:45,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,037 INFO L124 PetriNetUnfolderBase]: 16/789 cut-off events. [2025-01-09 21:30:46,038 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:46,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 789 events. 16/789 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1395 event pairs, 1 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 775. Up to 13 conditions per place. [2025-01-09 21:30:46,042 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/640 dead transitions. [2025-01-09 21:30:46,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 640 transitions, 1311 flow [2025-01-09 21:30:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-01-09 21:30:46,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-01-09 21:30:46,046 INFO L175 Difference]: Start difference. First operand has 635 places, 641 transitions, 1289 flow. Second operand 3 states and 2059 transitions. [2025-01-09 21:30:46,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 640 transitions, 1311 flow [2025-01-09 21:30:46,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 640 transitions, 1310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:46,052 INFO L231 Difference]: Finished difference. Result has 635 places, 640 transitions, 1290 flow [2025-01-09 21:30:46,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=635, PETRI_TRANSITIONS=640} [2025-01-09 21:30:46,053 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-01-09 21:30:46,053 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 640 transitions, 1290 flow [2025-01-09 21:30:46,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,054 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] [2025-01-09 21:30:46,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:46,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:46,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1458242551, now seen corresponding path program 1 times [2025-01-09 21:30:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794690019] [2025-01-09 21:30:46,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:30:46,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:30:46,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,095 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:30:46,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794690019] [2025-01-09 21:30:46,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794690019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960657842] [2025-01-09 21:30:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-01-09 21:30:46,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 640 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-01-09 21:30:46,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,203 INFO L124 PetriNetUnfolderBase]: 24/1086 cut-off events. [2025-01-09 21:30:46,204 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:46,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1086 events. 24/1086 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3358 event pairs, 3 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1080. Up to 17 conditions per place. [2025-01-09 21:30:46,210 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/639 dead transitions. [2025-01-09 21:30:46,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 639 transitions, 1312 flow [2025-01-09 21:30:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-01-09 21:30:46,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-01-09 21:30:46,213 INFO L175 Difference]: Start difference. First operand has 635 places, 640 transitions, 1290 flow. Second operand 3 states and 2059 transitions. [2025-01-09 21:30:46,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 639 transitions, 1312 flow [2025-01-09 21:30:46,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 639 transitions, 1308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:46,219 INFO L231 Difference]: Finished difference. Result has 634 places, 639 transitions, 1288 flow [2025-01-09 21:30:46,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=634, PETRI_TRANSITIONS=639} [2025-01-09 21:30:46,220 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2025-01-09 21:30:46,220 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 639 transitions, 1288 flow [2025-01-09 21:30:46,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,221 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:30:46,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:46,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:46,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash -269870966, now seen corresponding path program 1 times [2025-01-09 21:30:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337723137] [2025-01-09 21:30:46,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:30:46,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:30:46,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,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:30:46,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337723137] [2025-01-09 21:30:46,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337723137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8926816] [2025-01-09 21:30:46,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-01-09 21:30:46,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 639 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-01-09 21:30:46,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,382 INFO L124 PetriNetUnfolderBase]: 24/1085 cut-off events. [2025-01-09 21:30:46,382 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:46,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 1085 events. 24/1085 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3341 event pairs, 3 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1079. Up to 17 conditions per place. [2025-01-09 21:30:46,389 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/638 dead transitions. [2025-01-09 21:30:46,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 638 transitions, 1310 flow [2025-01-09 21:30:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-01-09 21:30:46,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-01-09 21:30:46,392 INFO L175 Difference]: Start difference. First operand has 634 places, 639 transitions, 1288 flow. Second operand 3 states and 2059 transitions. [2025-01-09 21:30:46,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 638 transitions, 1310 flow [2025-01-09 21:30:46,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 638 transitions, 1306 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:46,400 INFO L231 Difference]: Finished difference. Result has 633 places, 638 transitions, 1286 flow [2025-01-09 21:30:46,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1286, PETRI_PLACES=633, PETRI_TRANSITIONS=638} [2025-01-09 21:30:46,401 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -36 predicate places. [2025-01-09 21:30:46,401 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 638 transitions, 1286 flow [2025-01-09 21:30:46,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,402 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:30:46,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:46,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:46,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1985742691, now seen corresponding path program 1 times [2025-01-09 21:30:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010561204] [2025-01-09 21:30:46,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:30:46,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:30:46,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,441 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:30:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010561204] [2025-01-09 21:30:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010561204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718905911] [2025-01-09 21:30:46,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-01-09 21:30:46,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 638 transitions, 1286 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-01-09 21:30:46,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,545 INFO L124 PetriNetUnfolderBase]: 13/652 cut-off events. [2025-01-09 21:30:46,545 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:30:46,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 652 events. 13/652 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1040 event pairs, 1 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 639. Up to 13 conditions per place. [2025-01-09 21:30:46,549 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/637 dead transitions. [2025-01-09 21:30:46,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 637 transitions, 1308 flow [2025-01-09 21:30:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-01-09 21:30:46,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-01-09 21:30:46,553 INFO L175 Difference]: Start difference. First operand has 633 places, 638 transitions, 1286 flow. Second operand 3 states and 2059 transitions. [2025-01-09 21:30:46,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 637 transitions, 1308 flow [2025-01-09 21:30:46,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 637 transitions, 1304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:46,560 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1284 flow [2025-01-09 21:30:46,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=632, PETRI_TRANSITIONS=637} [2025-01-09 21:30:46,561 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -37 predicate places. [2025-01-09 21:30:46,561 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1284 flow [2025-01-09 21:30:46,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,562 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:30:46,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:46,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:46,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1626403488, now seen corresponding path program 1 times [2025-01-09 21:30:46,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699859130] [2025-01-09 21:30:46,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:30:46,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:30:46,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,601 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:30:46,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699859130] [2025-01-09 21:30:46,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699859130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407790010] [2025-01-09 21:30:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-01-09 21:30:46,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 637 transitions, 1284 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-01-09 21:30:46,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,722 INFO L124 PetriNetUnfolderBase]: 18/769 cut-off events. [2025-01-09 21:30:46,723 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-01-09 21:30:46,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 769 events. 18/769 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1444 event pairs, 3 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 760. Up to 17 conditions per place. [2025-01-09 21:30:46,727 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2025-01-09 21:30:46,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 636 transitions, 1306 flow [2025-01-09 21:30:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-01-09 21:30:46,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-01-09 21:30:46,731 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1284 flow. Second operand 3 states and 2059 transitions. [2025-01-09 21:30:46,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 636 transitions, 1306 flow [2025-01-09 21:30:46,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 636 transitions, 1302 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:46,738 INFO L231 Difference]: Finished difference. Result has 631 places, 636 transitions, 1282 flow [2025-01-09 21:30:46,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1282, PETRI_PLACES=631, PETRI_TRANSITIONS=636} [2025-01-09 21:30:46,739 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -38 predicate places. [2025-01-09 21:30:46,739 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 636 transitions, 1282 flow [2025-01-09 21:30:46,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,740 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] [2025-01-09 21:30:46,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:46,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:46,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash -717379236, now seen corresponding path program 1 times [2025-01-09 21:30:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252140328] [2025-01-09 21:30:46,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:30:46,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:30:46,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,775 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:30:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252140328] [2025-01-09 21:30:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252140328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228956624] [2025-01-09 21:30:46,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 713 [2025-01-09 21:30:46,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 636 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 713 [2025-01-09 21:30:46,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,905 INFO L124 PetriNetUnfolderBase]: 18/749 cut-off events. [2025-01-09 21:30:46,905 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-01-09 21:30:46,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 749 events. 18/749 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1409 event pairs, 3 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 740. Up to 17 conditions per place. [2025-01-09 21:30:46,916 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2025-01-09 21:30:46,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 635 transitions, 1304 flow [2025-01-09 21:30:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2025-01-09 21:30:46,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625993454885461 [2025-01-09 21:30:46,919 INFO L175 Difference]: Start difference. First operand has 631 places, 636 transitions, 1282 flow. Second operand 3 states and 2059 transitions. [2025-01-09 21:30:46,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 635 transitions, 1304 flow [2025-01-09 21:30:46,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 635 transitions, 1300 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:46,924 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1280 flow [2025-01-09 21:30:46,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1280, PETRI_PLACES=630, PETRI_TRANSITIONS=635} [2025-01-09 21:30:46,925 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -39 predicate places. [2025-01-09 21:30:46,926 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1280 flow [2025-01-09 21:30:46,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:30:46,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:46,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:46,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:46,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,927 INFO L85 PathProgramCache]: Analyzing trace with hash -19649208, now seen corresponding path program 1 times [2025-01-09 21:30:46,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411811862] [2025-01-09 21:30:46,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 21:30:46,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 21:30:46,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,976 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:30:46,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411811862] [2025-01-09 21:30:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411811862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627957818] [2025-01-09 21:30:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 681 out of 713 [2025-01-09 21:30:46,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 635 transitions, 1280 flow. Second operand has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 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:30:46,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 681 of 713 [2025-01-09 21:30:46,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:47,078 INFO L124 PetriNetUnfolderBase]: 29/1076 cut-off events. [2025-01-09 21:30:47,078 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:47,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1076 events. 29/1076 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3741 event pairs, 8 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1080. Up to 28 conditions per place. [2025-01-09 21:30:47,084 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 11 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2025-01-09 21:30:47,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 634 transitions, 1304 flow [2025-01-09 21:30:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2025-01-09 21:30:47,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616643291257597 [2025-01-09 21:30:47,087 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1280 flow. Second operand 3 states and 2057 transitions. [2025-01-09 21:30:47,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 634 transitions, 1304 flow [2025-01-09 21:30:47,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 634 transitions, 1300 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:47,092 INFO L231 Difference]: Finished difference. Result has 629 places, 634 transitions, 1278 flow [2025-01-09 21:30:47,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1278, PETRI_PLACES=629, PETRI_TRANSITIONS=634} [2025-01-09 21:30:47,093 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -40 predicate places. [2025-01-09 21:30:47,094 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 634 transitions, 1278 flow [2025-01-09 21:30:47,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 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:30:47,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:47,095 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:47,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash -76078628, now seen corresponding path program 1 times [2025-01-09 21:30:47,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:47,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258476965] [2025-01-09 21:30:47,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:47,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:47,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 21:30:47,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 21:30:47,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:47,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:47,499 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:30:47,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258476965] [2025-01-09 21:30:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258476965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:47,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:47,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334479433] [2025-01-09 21:30:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:47,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:47,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:47,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:47,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 713 [2025-01-09 21:30:47,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 634 transitions, 1278 flow. Second operand has 6 states, 6 states have (on average 627.5) internal successors, (3765), 6 states have internal predecessors, (3765), 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:30:47,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:47,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 713 [2025-01-09 21:30:47,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:48,094 INFO L124 PetriNetUnfolderBase]: 439/4180 cut-off events. [2025-01-09 21:30:48,094 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-09 21:30:48,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 4180 events. 439/4180 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 32718 event pairs, 360 based on Foata normal form. 0/3603 useless extension candidates. Maximal degree in co-relation 4973. Up to 792 conditions per place. [2025-01-09 21:30:48,108 INFO L140 encePairwiseOnDemand]: 701/713 looper letters, 58 selfloop transitions, 10 changer transitions 0/632 dead transitions. [2025-01-09 21:30:48,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 632 transitions, 1410 flow [2025-01-09 21:30:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3826 transitions. [2025-01-09 21:30:48,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8943431510051426 [2025-01-09 21:30:48,113 INFO L175 Difference]: Start difference. First operand has 629 places, 634 transitions, 1278 flow. Second operand 6 states and 3826 transitions. [2025-01-09 21:30:48,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 632 transitions, 1410 flow [2025-01-09 21:30:48,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 632 transitions, 1406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:48,118 INFO L231 Difference]: Finished difference. Result has 630 places, 632 transitions, 1290 flow [2025-01-09 21:30:48,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1290, PETRI_PLACES=630, PETRI_TRANSITIONS=632} [2025-01-09 21:30:48,119 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -39 predicate places. [2025-01-09 21:30:48,119 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 632 transitions, 1290 flow [2025-01-09 21:30:48,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 627.5) internal successors, (3765), 6 states have internal predecessors, (3765), 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:30:48,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:48,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:48,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:48,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:48,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash 636892044, now seen corresponding path program 1 times [2025-01-09 21:30:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:48,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646363958] [2025-01-09 21:30:48,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:48,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:48,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:30:48,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:30:48,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:48,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:48,161 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:30:48,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:48,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646363958] [2025-01-09 21:30:48,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646363958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:48,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:48,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:48,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852860344] [2025-01-09 21:30:48,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:48,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:48,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:48,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:48,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:48,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 681 out of 713 [2025-01-09 21:30:48,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 632 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 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:30:48,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:48,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 681 of 713 [2025-01-09 21:30:48,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:48,271 INFO L124 PetriNetUnfolderBase]: 29/1079 cut-off events. [2025-01-09 21:30:48,271 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:30:48,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 1079 events. 29/1079 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3370 event pairs, 8 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1094. Up to 28 conditions per place. [2025-01-09 21:30:48,276 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 11 selfloop transitions, 2 changer transitions 0/631 dead transitions. [2025-01-09 21:30:48,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 631 transitions, 1314 flow [2025-01-09 21:30:48,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2025-01-09 21:30:48,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616643291257597 [2025-01-09 21:30:48,279 INFO L175 Difference]: Start difference. First operand has 630 places, 632 transitions, 1290 flow. Second operand 3 states and 2057 transitions. [2025-01-09 21:30:48,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 631 transitions, 1314 flow [2025-01-09 21:30:48,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 631 transitions, 1294 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:48,286 INFO L231 Difference]: Finished difference. Result has 626 places, 631 transitions, 1272 flow [2025-01-09 21:30:48,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=626, PETRI_TRANSITIONS=631} [2025-01-09 21:30:48,286 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -43 predicate places. [2025-01-09 21:30:48,287 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 631 transitions, 1272 flow [2025-01-09 21:30:48,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 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:30:48,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:48,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:48,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:48,288 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:48,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash 969049064, now seen corresponding path program 1 times [2025-01-09 21:30:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462137868] [2025-01-09 21:30:48,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:48,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:48,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 21:30:48,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 21:30:48,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:48,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:48,415 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:30:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:48,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462137868] [2025-01-09 21:30:48,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462137868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:48,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483572811] [2025-01-09 21:30:48,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:48,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:48,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:48,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:48,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 713 [2025-01-09 21:30:48,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 631 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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:30:48,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:48,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 713 [2025-01-09 21:30:48,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:48,945 INFO L124 PetriNetUnfolderBase]: 439/4177 cut-off events. [2025-01-09 21:30:48,945 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-09 21:30:48,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5005 conditions, 4177 events. 439/4177 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 32748 event pairs, 360 based on Foata normal form. 0/3603 useless extension candidates. Maximal degree in co-relation 4970. Up to 798 conditions per place. [2025-01-09 21:30:48,957 INFO L140 encePairwiseOnDemand]: 707/713 looper letters, 64 selfloop transitions, 4 changer transitions 0/629 dead transitions. [2025-01-09 21:30:48,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 629 transitions, 1404 flow [2025-01-09 21:30:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1948 transitions. [2025-01-09 21:30:48,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9107059373539037 [2025-01-09 21:30:48,960 INFO L175 Difference]: Start difference. First operand has 626 places, 631 transitions, 1272 flow. Second operand 3 states and 1948 transitions. [2025-01-09 21:30:48,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 629 transitions, 1404 flow [2025-01-09 21:30:48,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 629 transitions, 1400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:48,965 INFO L231 Difference]: Finished difference. Result has 624 places, 629 transitions, 1272 flow [2025-01-09 21:30:48,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=624, PETRI_TRANSITIONS=629} [2025-01-09 21:30:48,966 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -45 predicate places. [2025-01-09 21:30:48,966 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 629 transitions, 1272 flow [2025-01-09 21:30:48,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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:30:48,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:48,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:48,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:48,968 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:48,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1899150423, now seen corresponding path program 1 times [2025-01-09 21:30:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:48,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604470701] [2025-01-09 21:30:48,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:48,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 21:30:48,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 21:30:48,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:48,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,009 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:30:49,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604470701] [2025-01-09 21:30:49,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604470701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:49,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925005970] [2025-01-09 21:30:49,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:49,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:49,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:49,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 683 out of 713 [2025-01-09 21:30:49,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 629 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 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:30:49,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 683 of 713 [2025-01-09 21:30:49,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,084 INFO L124 PetriNetUnfolderBase]: 18/780 cut-off events. [2025-01-09 21:30:49,085 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-01-09 21:30:49,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 780 events. 18/780 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1763 event pairs, 3 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 788. Up to 16 conditions per place. [2025-01-09 21:30:49,089 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 9 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2025-01-09 21:30:49,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 628 transitions, 1292 flow [2025-01-09 21:30:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2061 transitions. [2025-01-09 21:30:49,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635343618513323 [2025-01-09 21:30:49,092 INFO L175 Difference]: Start difference. First operand has 624 places, 629 transitions, 1272 flow. Second operand 3 states and 2061 transitions. [2025-01-09 21:30:49,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 628 transitions, 1292 flow [2025-01-09 21:30:49,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 628 transitions, 1284 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:49,097 INFO L231 Difference]: Finished difference. Result has 623 places, 628 transitions, 1266 flow [2025-01-09 21:30:49,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=623, PETRI_TRANSITIONS=628} [2025-01-09 21:30:49,098 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -46 predicate places. [2025-01-09 21:30:49,098 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 628 transitions, 1266 flow [2025-01-09 21:30:49,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 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:30:49,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:49,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:49,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:49,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash -856039101, now seen corresponding path program 1 times [2025-01-09 21:30:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739857925] [2025-01-09 21:30:49,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 21:30:49,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 21:30:49,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,161 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:30:49,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739857925] [2025-01-09 21:30:49,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739857925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:49,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958267174] [2025-01-09 21:30:49,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:49,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:49,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 683 out of 713 [2025-01-09 21:30:49,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 628 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 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:30:49,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 683 of 713 [2025-01-09 21:30:49,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,255 INFO L124 PetriNetUnfolderBase]: 21/884 cut-off events. [2025-01-09 21:30:49,255 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:30:49,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 884 events. 21/884 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2033 event pairs, 3 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 875. Up to 16 conditions per place. [2025-01-09 21:30:49,258 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 9 selfloop transitions, 2 changer transitions 0/627 dead transitions. [2025-01-09 21:30:49,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 627 transitions, 1286 flow [2025-01-09 21:30:49,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2061 transitions. [2025-01-09 21:30:49,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635343618513323 [2025-01-09 21:30:49,262 INFO L175 Difference]: Start difference. First operand has 623 places, 628 transitions, 1266 flow. Second operand 3 states and 2061 transitions. [2025-01-09 21:30:49,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 627 transitions, 1286 flow [2025-01-09 21:30:49,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 627 transitions, 1282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:49,268 INFO L231 Difference]: Finished difference. Result has 622 places, 627 transitions, 1264 flow [2025-01-09 21:30:49,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=622, PETRI_TRANSITIONS=627} [2025-01-09 21:30:49,269 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -47 predicate places. [2025-01-09 21:30:49,269 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 627 transitions, 1264 flow [2025-01-09 21:30:49,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 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:30:49,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:49,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:49,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:49,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1319617593, now seen corresponding path program 1 times [2025-01-09 21:30:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612490120] [2025-01-09 21:30:49,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 21:30:49,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 21:30:49,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,333 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:30:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612490120] [2025-01-09 21:30:49,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612490120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:49,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973603269] [2025-01-09 21:30:49,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:49,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:49,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 713 [2025-01-09 21:30:49,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 627 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 680.3333333333334) internal successors, (2041), 3 states have internal predecessors, (2041), 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:30:49,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 713 [2025-01-09 21:30:49,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,476 INFO L124 PetriNetUnfolderBase]: 57/1622 cut-off events. [2025-01-09 21:30:49,477 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:30:49,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 1622 events. 57/1622 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7604 event pairs, 19 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1664. Up to 61 conditions per place. [2025-01-09 21:30:49,485 INFO L140 encePairwiseOnDemand]: 707/713 looper letters, 14 selfloop transitions, 2 changer transitions 0/626 dead transitions. [2025-01-09 21:30:49,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 626 transitions, 1295 flow [2025-01-09 21:30:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2025-01-09 21:30:49,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616643291257597 [2025-01-09 21:30:49,489 INFO L175 Difference]: Start difference. First operand has 622 places, 627 transitions, 1264 flow. Second operand 3 states and 2057 transitions. [2025-01-09 21:30:49,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 626 transitions, 1295 flow [2025-01-09 21:30:49,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 626 transitions, 1291 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:49,497 INFO L231 Difference]: Finished difference. Result has 619 places, 625 transitions, 1266 flow [2025-01-09 21:30:49,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=619, PETRI_TRANSITIONS=625} [2025-01-09 21:30:49,498 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -50 predicate places. [2025-01-09 21:30:49,498 INFO L471 AbstractCegarLoop]: Abstraction has has 619 places, 625 transitions, 1266 flow [2025-01-09 21:30:49,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.3333333333334) internal successors, (2041), 3 states have internal predecessors, (2041), 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:30:49,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:49,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:49,499 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:49,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1388583540, now seen corresponding path program 1 times [2025-01-09 21:30:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260250872] [2025-01-09 21:30:49,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 21:30:49,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 21:30:49,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,571 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:30:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260250872] [2025-01-09 21:30:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260250872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283616855] [2025-01-09 21:30:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:49,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:49,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 713 [2025-01-09 21:30:49,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 625 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 680.6666666666666) internal successors, (2042), 3 states have internal predecessors, (2042), 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:30:49,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 713 [2025-01-09 21:30:49,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,738 INFO L124 PetriNetUnfolderBase]: 57/1633 cut-off events. [2025-01-09 21:30:49,738 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2025-01-09 21:30:49,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 1633 events. 57/1633 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7875 event pairs, 15 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1681. Up to 62 conditions per place. [2025-01-09 21:30:49,743 INFO L140 encePairwiseOnDemand]: 707/713 looper letters, 14 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2025-01-09 21:30:49,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 624 transitions, 1297 flow [2025-01-09 21:30:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2025-01-09 21:30:49,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616643291257597 [2025-01-09 21:30:49,746 INFO L175 Difference]: Start difference. First operand has 619 places, 625 transitions, 1266 flow. Second operand 3 states and 2057 transitions. [2025-01-09 21:30:49,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 624 transitions, 1297 flow [2025-01-09 21:30:49,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 624 transitions, 1297 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:49,752 INFO L231 Difference]: Finished difference. Result has 618 places, 623 transitions, 1272 flow [2025-01-09 21:30:49,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=618, PETRI_TRANSITIONS=623} [2025-01-09 21:30:49,753 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -51 predicate places. [2025-01-09 21:30:49,753 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 623 transitions, 1272 flow [2025-01-09 21:30:49,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.6666666666666) internal successors, (2042), 3 states have internal predecessors, (2042), 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:30:49,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:49,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:49,754 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:49,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1370497697, now seen corresponding path program 1 times [2025-01-09 21:30:49,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767540608] [2025-01-09 21:30:49,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-01-09 21:30:49,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-01-09 21:30:49,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:50,049 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:30:50,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767540608] [2025-01-09 21:30:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767540608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:50,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:30:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110843977] [2025-01-09 21:30:50,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:50,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:30:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:50,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:30:50,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:30:50,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 713 [2025-01-09 21:30:50,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 623 transitions, 1272 flow. Second operand has 7 states, 7 states have (on average 668.2857142857143) internal successors, (4678), 7 states have internal predecessors, (4678), 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:30:50,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:50,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 713 [2025-01-09 21:30:50,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:50,598 INFO L124 PetriNetUnfolderBase]: 38/1636 cut-off events. [2025-01-09 21:30:50,598 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:30:50,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 1636 events. 38/1636 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7807 event pairs, 0 based on Foata normal form. 1/1472 useless extension candidates. Maximal degree in co-relation 1687. Up to 29 conditions per place. [2025-01-09 21:30:50,610 INFO L140 encePairwiseOnDemand]: 703/713 looper letters, 45 selfloop transitions, 9 changer transitions 0/647 dead transitions. [2025-01-09 21:30:50,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 647 transitions, 1432 flow [2025-01-09 21:30:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:30:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:30:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4710 transitions. [2025-01-09 21:30:50,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9436986575836506 [2025-01-09 21:30:50,616 INFO L175 Difference]: Start difference. First operand has 618 places, 623 transitions, 1272 flow. Second operand 7 states and 4710 transitions. [2025-01-09 21:30:50,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 647 transitions, 1432 flow [2025-01-09 21:30:50,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 647 transitions, 1432 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:50,623 INFO L231 Difference]: Finished difference. Result has 628 places, 629 transitions, 1329 flow [2025-01-09 21:30:50,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1329, PETRI_PLACES=628, PETRI_TRANSITIONS=629} [2025-01-09 21:30:50,624 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -41 predicate places. [2025-01-09 21:30:50,624 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 629 transitions, 1329 flow [2025-01-09 21:30:50,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 668.2857142857143) internal successors, (4678), 7 states have internal predecessors, (4678), 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:30:50,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:50,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:50,625 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:50,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:50,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1358291559, now seen corresponding path program 1 times [2025-01-09 21:30:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:50,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501460703] [2025-01-09 21:30:50,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:50,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 21:30:50,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 21:30:50,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:50,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:51,229 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:30:51,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:51,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501460703] [2025-01-09 21:30:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501460703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:51,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76226498] [2025-01-09 21:30:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:51,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:51,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:51,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:51,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:51,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 713 [2025-01-09 21:30:51,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 629 transitions, 1329 flow. Second operand has 6 states, 6 states have (on average 655.6666666666666) internal successors, (3934), 6 states have internal predecessors, (3934), 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:30:51,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:51,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 713 [2025-01-09 21:30:51,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,270 INFO L124 PetriNetUnfolderBase]: 350/4930 cut-off events. [2025-01-09 21:30:52,271 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-09 21:30:52,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5626 conditions, 4930 events. 350/4930 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 40315 event pairs, 140 based on Foata normal form. 0/4370 useless extension candidates. Maximal degree in co-relation 5582. Up to 508 conditions per place. [2025-01-09 21:30:52,299 INFO L140 encePairwiseOnDemand]: 701/713 looper letters, 54 selfloop transitions, 8 changer transitions 0/649 dead transitions. [2025-01-09 21:30:52,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 649 transitions, 1497 flow [2025-01-09 21:30:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3990 transitions. [2025-01-09 21:30:52,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326788218793829 [2025-01-09 21:30:52,303 INFO L175 Difference]: Start difference. First operand has 628 places, 629 transitions, 1329 flow. Second operand 6 states and 3990 transitions. [2025-01-09 21:30:52,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 649 transitions, 1497 flow [2025-01-09 21:30:52,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 649 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:52,310 INFO L231 Difference]: Finished difference. Result has 631 places, 633 transitions, 1378 flow [2025-01-09 21:30:52,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1378, PETRI_PLACES=631, PETRI_TRANSITIONS=633} [2025-01-09 21:30:52,311 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -38 predicate places. [2025-01-09 21:30:52,311 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 633 transitions, 1378 flow [2025-01-09 21:30:52,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 655.6666666666666) internal successors, (3934), 6 states have internal predecessors, (3934), 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:30:52,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:52,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:52,312 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1106574628, now seen corresponding path program 1 times [2025-01-09 21:30:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289177866] [2025-01-09 21:30:52,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 21:30:52,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 21:30:52,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:52,366 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:30:52,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:52,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289177866] [2025-01-09 21:30:52,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289177866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:52,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:52,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:52,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856583888] [2025-01-09 21:30:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:52,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:52,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:52,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:52,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:30:52,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 633 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:30:52,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:52,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:30:52,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,683 INFO L124 PetriNetUnfolderBase]: 94/3082 cut-off events. [2025-01-09 21:30:52,684 INFO L125 PetriNetUnfolderBase]: For 21/39 co-relation queries the response was YES. [2025-01-09 21:30:52,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 3082 events. 94/3082 cut-off events. For 21/39 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 22974 event pairs, 8 based on Foata normal form. 2/2734 useless extension candidates. Maximal degree in co-relation 3271. Up to 40 conditions per place. [2025-01-09 21:30:52,702 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/633 dead transitions. [2025-01-09 21:30:52,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 633 transitions, 1403 flow [2025-01-09 21:30:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-01-09 21:30:52,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-01-09 21:30:52,705 INFO L175 Difference]: Start difference. First operand has 631 places, 633 transitions, 1378 flow. Second operand 3 states and 2065 transitions. [2025-01-09 21:30:52,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 633 transitions, 1403 flow [2025-01-09 21:30:52,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 633 transitions, 1403 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:52,712 INFO L231 Difference]: Finished difference. Result has 632 places, 632 transitions, 1380 flow [2025-01-09 21:30:52,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1380, PETRI_PLACES=632, PETRI_TRANSITIONS=632} [2025-01-09 21:30:52,713 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -37 predicate places. [2025-01-09 21:30:52,713 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 632 transitions, 1380 flow [2025-01-09 21:30:52,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:30:52,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:52,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:52,714 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:52,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1988969708, now seen corresponding path program 1 times [2025-01-09 21:30:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438923] [2025-01-09 21:30:52,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 21:30:52,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 21:30:52,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:53,143 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:30:53,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438923] [2025-01-09 21:30:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:53,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:53,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961404545] [2025-01-09 21:30:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:53,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:53,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:53,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:53,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 713 [2025-01-09 21:30:53,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 632 transitions, 1380 flow. Second operand has 6 states, 6 states have (on average 655.8333333333334) internal successors, (3935), 6 states have internal predecessors, (3935), 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:30:53,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:53,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 713 [2025-01-09 21:30:53,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:54,155 INFO L124 PetriNetUnfolderBase]: 368/5642 cut-off events. [2025-01-09 21:30:54,155 INFO L125 PetriNetUnfolderBase]: For 51/77 co-relation queries the response was YES. [2025-01-09 21:30:54,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6468 conditions, 5642 events. 368/5642 cut-off events. For 51/77 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 49377 event pairs, 132 based on Foata normal form. 0/5054 useless extension candidates. Maximal degree in co-relation 6421. Up to 540 conditions per place. [2025-01-09 21:30:54,174 INFO L140 encePairwiseOnDemand]: 701/713 looper letters, 54 selfloop transitions, 8 changer transitions 0/652 dead transitions. [2025-01-09 21:30:54,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 652 transitions, 1548 flow [2025-01-09 21:30:54,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3990 transitions. [2025-01-09 21:30:54,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326788218793829 [2025-01-09 21:30:54,179 INFO L175 Difference]: Start difference. First operand has 632 places, 632 transitions, 1380 flow. Second operand 6 states and 3990 transitions. [2025-01-09 21:30:54,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 652 transitions, 1548 flow [2025-01-09 21:30:54,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 652 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:54,185 INFO L231 Difference]: Finished difference. Result has 635 places, 636 transitions, 1430 flow [2025-01-09 21:30:54,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1430, PETRI_PLACES=635, PETRI_TRANSITIONS=636} [2025-01-09 21:30:54,186 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-01-09 21:30:54,186 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 636 transitions, 1430 flow [2025-01-09 21:30:54,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 655.8333333333334) internal successors, (3935), 6 states have internal predecessors, (3935), 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:30:54,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:54,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:54,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:54,187 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:54,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash 914106095, now seen corresponding path program 1 times [2025-01-09 21:30:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:54,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434781398] [2025-01-09 21:30:54,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:54,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:54,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 21:30:54,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 21:30:54,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:54,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:54,234 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:30:54,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:54,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434781398] [2025-01-09 21:30:54,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434781398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:54,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:54,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221165401] [2025-01-09 21:30:54,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:54,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:54,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:54,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:54,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:30:54,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 636 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:30:54,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:54,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:30:54,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:54,591 INFO L124 PetriNetUnfolderBase]: 120/3688 cut-off events. [2025-01-09 21:30:54,591 INFO L125 PetriNetUnfolderBase]: For 51/65 co-relation queries the response was YES. [2025-01-09 21:30:54,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 3688 events. 120/3688 cut-off events. For 51/65 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 28986 event pairs, 8 based on Foata normal form. 0/3274 useless extension candidates. Maximal degree in co-relation 3969. Up to 64 conditions per place. [2025-01-09 21:30:54,614 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2025-01-09 21:30:54,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 636 transitions, 1455 flow [2025-01-09 21:30:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-01-09 21:30:54,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-01-09 21:30:54,617 INFO L175 Difference]: Start difference. First operand has 635 places, 636 transitions, 1430 flow. Second operand 3 states and 2065 transitions. [2025-01-09 21:30:54,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 636 transitions, 1455 flow [2025-01-09 21:30:54,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 636 transitions, 1455 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:54,623 INFO L231 Difference]: Finished difference. Result has 636 places, 635 transitions, 1432 flow [2025-01-09 21:30:54,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=636, PETRI_TRANSITIONS=635} [2025-01-09 21:30:54,624 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -33 predicate places. [2025-01-09 21:30:54,624 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 635 transitions, 1432 flow [2025-01-09 21:30:54,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:30:54,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:54,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:54,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:54,625 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:54,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:54,626 INFO L85 PathProgramCache]: Analyzing trace with hash -790496952, now seen corresponding path program 1 times [2025-01-09 21:30:54,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:54,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457205579] [2025-01-09 21:30:54,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:54,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:54,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 21:30:54,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 21:30:54,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:54,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:54,685 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:30:54,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:54,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457205579] [2025-01-09 21:30:54,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457205579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:54,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:54,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:54,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836461164] [2025-01-09 21:30:54,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:54,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:54,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:54,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:54,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:54,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:30:54,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 635 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:30:54,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:54,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:30:54,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:55,143 INFO L124 PetriNetUnfolderBase]: 122/3650 cut-off events. [2025-01-09 21:30:55,144 INFO L125 PetriNetUnfolderBase]: For 37/49 co-relation queries the response was YES. [2025-01-09 21:30:55,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4028 conditions, 3650 events. 122/3650 cut-off events. For 37/49 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 30172 event pairs, 8 based on Foata normal form. 0/3258 useless extension candidates. Maximal degree in co-relation 3979. Up to 84 conditions per place. [2025-01-09 21:30:55,172 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2025-01-09 21:30:55,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 635 transitions, 1457 flow [2025-01-09 21:30:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-01-09 21:30:55,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-01-09 21:30:55,175 INFO L175 Difference]: Start difference. First operand has 636 places, 635 transitions, 1432 flow. Second operand 3 states and 2065 transitions. [2025-01-09 21:30:55,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 635 transitions, 1457 flow [2025-01-09 21:30:55,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 635 transitions, 1453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:55,182 INFO L231 Difference]: Finished difference. Result has 635 places, 634 transitions, 1430 flow [2025-01-09 21:30:55,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=635, PETRI_TRANSITIONS=634} [2025-01-09 21:30:55,183 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-01-09 21:30:55,183 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 634 transitions, 1430 flow [2025-01-09 21:30:55,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:30:55,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:55,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:55,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:30:55,184 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:55,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash 875244875, now seen corresponding path program 1 times [2025-01-09 21:30:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:55,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413968169] [2025-01-09 21:30:55,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:55,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 21:30:55,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 21:30:55,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:55,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:55,236 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:30:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413968169] [2025-01-09 21:30:55,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413968169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:55,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:55,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178706569] [2025-01-09 21:30:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:55,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:55,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:55,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:55,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 713 [2025-01-09 21:30:55,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 634 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 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:30:55,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:55,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 713 [2025-01-09 21:30:55,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:55,780 INFO L124 PetriNetUnfolderBase]: 156/5304 cut-off events. [2025-01-09 21:30:55,780 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2025-01-09 21:30:55,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5679 conditions, 5304 events. 156/5304 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 48738 event pairs, 8 based on Foata normal form. 0/4740 useless extension candidates. Maximal degree in co-relation 5630. Up to 96 conditions per place. [2025-01-09 21:30:55,807 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2025-01-09 21:30:55,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 635 transitions, 1457 flow [2025-01-09 21:30:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2069 transitions. [2025-01-09 21:30:55,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672744273024778 [2025-01-09 21:30:55,810 INFO L175 Difference]: Start difference. First operand has 635 places, 634 transitions, 1430 flow. Second operand 3 states and 2069 transitions. [2025-01-09 21:30:55,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 635 transitions, 1457 flow [2025-01-09 21:30:55,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 635 transitions, 1453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:55,816 INFO L231 Difference]: Finished difference. Result has 634 places, 634 transitions, 1436 flow [2025-01-09 21:30:55,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=634, PETRI_TRANSITIONS=634} [2025-01-09 21:30:55,817 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2025-01-09 21:30:55,817 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 634 transitions, 1436 flow [2025-01-09 21:30:55,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 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:30:55,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:55,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:55,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:30:55,818 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:55,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash 686772315, now seen corresponding path program 1 times [2025-01-09 21:30:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:55,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173776846] [2025-01-09 21:30:55,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:55,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 21:30:55,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 21:30:55,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:55,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:55,867 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:30:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173776846] [2025-01-09 21:30:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173776846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:55,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25165440] [2025-01-09 21:30:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:55,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:55,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:55,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:55,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:30:55,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 634 transitions, 1436 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:30:55,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:55,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:30:55,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:56,455 INFO L124 PetriNetUnfolderBase]: 142/4748 cut-off events. [2025-01-09 21:30:56,455 INFO L125 PetriNetUnfolderBase]: For 55/69 co-relation queries the response was YES. [2025-01-09 21:30:56,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 4748 events. 142/4748 cut-off events. For 55/69 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 42501 event pairs, 8 based on Foata normal form. 0/4258 useless extension candidates. Maximal degree in co-relation 5145. Up to 116 conditions per place. [2025-01-09 21:30:56,475 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2025-01-09 21:30:56,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 634 transitions, 1461 flow [2025-01-09 21:30:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-01-09 21:30:56,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-01-09 21:30:56,479 INFO L175 Difference]: Start difference. First operand has 634 places, 634 transitions, 1436 flow. Second operand 3 states and 2065 transitions. [2025-01-09 21:30:56,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 634 transitions, 1461 flow [2025-01-09 21:30:56,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 634 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:56,485 INFO L231 Difference]: Finished difference. Result has 635 places, 633 transitions, 1438 flow [2025-01-09 21:30:56,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=635, PETRI_TRANSITIONS=633} [2025-01-09 21:30:56,486 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-01-09 21:30:56,486 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 633 transitions, 1438 flow [2025-01-09 21:30:56,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:30:56,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:56,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:56,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:30:56,487 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:56,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1425645357, now seen corresponding path program 1 times [2025-01-09 21:30:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317366934] [2025-01-09 21:30:56,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:56,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 21:30:56,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 21:30:56,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:56,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:56,588 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:30:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317366934] [2025-01-09 21:30:56,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317366934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:56,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:56,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065368626] [2025-01-09 21:30:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:56,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:56,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:56,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:56,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:56,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 713 [2025-01-09 21:30:56,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 633 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 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:30:56,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:56,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 713 [2025-01-09 21:30:56,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:57,341 INFO L124 PetriNetUnfolderBase]: 162/5386 cut-off events. [2025-01-09 21:30:57,341 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2025-01-09 21:30:57,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5845 conditions, 5386 events. 162/5386 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 49012 event pairs, 8 based on Foata normal form. 0/4848 useless extension candidates. Maximal degree in co-relation 5792. Up to 100 conditions per place. [2025-01-09 21:30:57,359 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 23 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2025-01-09 21:30:57,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 634 transitions, 1491 flow [2025-01-09 21:30:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2043 transitions. [2025-01-09 21:30:57,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9551192145862553 [2025-01-09 21:30:57,361 INFO L175 Difference]: Start difference. First operand has 635 places, 633 transitions, 1438 flow. Second operand 3 states and 2043 transitions. [2025-01-09 21:30:57,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 634 transitions, 1491 flow [2025-01-09 21:30:57,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 634 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:57,367 INFO L231 Difference]: Finished difference. Result has 634 places, 633 transitions, 1444 flow [2025-01-09 21:30:57,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=634, PETRI_TRANSITIONS=633} [2025-01-09 21:30:57,368 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2025-01-09 21:30:57,368 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 633 transitions, 1444 flow [2025-01-09 21:30:57,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 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:30:57,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:57,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:57,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:30:57,369 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:57,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1995923170, now seen corresponding path program 1 times [2025-01-09 21:30:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:57,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082949519] [2025-01-09 21:30:57,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:57,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 21:30:57,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 21:30:57,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:57,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:57,415 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:30:57,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:57,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082949519] [2025-01-09 21:30:57,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082949519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:57,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:57,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:57,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737274615] [2025-01-09 21:30:57,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:57,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:57,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:57,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:57,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:57,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 713 [2025-01-09 21:30:57,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 633 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:30:57,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:57,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 713 [2025-01-09 21:30:57,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:58,217 INFO L124 PetriNetUnfolderBase]: 184/6558 cut-off events. [2025-01-09 21:30:58,217 INFO L125 PetriNetUnfolderBase]: For 59/73 co-relation queries the response was YES. [2025-01-09 21:30:58,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7042 conditions, 6558 events. 184/6558 cut-off events. For 59/73 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 65702 event pairs, 4 based on Foata normal form. 0/5918 useless extension candidates. Maximal degree in co-relation 6992. Up to 100 conditions per place. [2025-01-09 21:30:58,245 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 11 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2025-01-09 21:30:58,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 635 transitions, 1476 flow [2025-01-09 21:30:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2025-01-09 21:30:58,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967741935483871 [2025-01-09 21:30:58,248 INFO L175 Difference]: Start difference. First operand has 634 places, 633 transitions, 1444 flow. Second operand 3 states and 2070 transitions. [2025-01-09 21:30:58,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 635 transitions, 1476 flow [2025-01-09 21:30:58,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 635 transitions, 1476 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:58,255 INFO L231 Difference]: Finished difference. Result has 635 places, 633 transitions, 1454 flow [2025-01-09 21:30:58,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=635, PETRI_TRANSITIONS=633} [2025-01-09 21:30:58,256 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2025-01-09 21:30:58,256 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 633 transitions, 1454 flow [2025-01-09 21:30:58,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:30:58,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:58,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:58,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:30:58,257 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:58,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash -627639019, now seen corresponding path program 1 times [2025-01-09 21:30:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738892847] [2025-01-09 21:30:58,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:58,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 21:30:58,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 21:30:58,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:58,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:58,316 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:30:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738892847] [2025-01-09 21:30:58,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738892847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:58,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:58,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:58,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312523812] [2025-01-09 21:30:58,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:58,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:58,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:58,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:58,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 713 [2025-01-09 21:30:58,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 633 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 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:30:58,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:58,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 713 [2025-01-09 21:30:58,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:59,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][619], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 486#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 814#true, Black: 756#(<= 2147483647 ~id_0~0), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:30:59,254 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is not cut-off event [2025-01-09 21:30:59,254 INFO L297 olderBase$Statistics]: existing Event has 412 ancestors and is not cut-off event [2025-01-09 21:30:59,254 INFO L297 olderBase$Statistics]: existing Event has 432 ancestors and is not cut-off event [2025-01-09 21:30:59,254 INFO L297 olderBase$Statistics]: existing Event has 440 ancestors and is not cut-off event [2025-01-09 21:30:59,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][619], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 486#L90true, Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 814#true, Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:30:59,265 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is not cut-off event [2025-01-09 21:30:59,265 INFO L297 olderBase$Statistics]: existing Event has 444 ancestors and is not cut-off event [2025-01-09 21:30:59,265 INFO L297 olderBase$Statistics]: existing Event has 452 ancestors and is not cut-off event [2025-01-09 21:30:59,265 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is not cut-off event [2025-01-09 21:30:59,267 INFO L124 PetriNetUnfolderBase]: 150/6044 cut-off events. [2025-01-09 21:30:59,269 INFO L125 PetriNetUnfolderBase]: For 53/85 co-relation queries the response was YES. [2025-01-09 21:30:59,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 6044 events. 150/6044 cut-off events. For 53/85 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 59608 event pairs, 12 based on Foata normal form. 2/5520 useless extension candidates. Maximal degree in co-relation 6630. Up to 157 conditions per place. [2025-01-09 21:30:59,317 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 11 selfloop transitions, 3 changer transitions 0/636 dead transitions. [2025-01-09 21:30:59,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 636 transitions, 1489 flow [2025-01-09 21:30:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2025-01-09 21:30:59,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967741935483871 [2025-01-09 21:30:59,319 INFO L175 Difference]: Start difference. First operand has 635 places, 633 transitions, 1454 flow. Second operand 3 states and 2070 transitions. [2025-01-09 21:30:59,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 636 transitions, 1489 flow [2025-01-09 21:30:59,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 636 transitions, 1489 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:59,325 INFO L231 Difference]: Finished difference. Result has 639 places, 635 transitions, 1476 flow [2025-01-09 21:30:59,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=639, PETRI_TRANSITIONS=635} [2025-01-09 21:30:59,326 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -30 predicate places. [2025-01-09 21:30:59,326 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 635 transitions, 1476 flow [2025-01-09 21:30:59,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 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:30:59,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:59,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:59,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:30:59,327 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:30:59,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash 810451347, now seen corresponding path program 1 times [2025-01-09 21:30:59,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:59,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100555239] [2025-01-09 21:30:59,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:59,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 21:30:59,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 21:30:59,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:59,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:59,427 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:30:59,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100555239] [2025-01-09 21:30:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100555239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:59,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:59,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641031744] [2025-01-09 21:30:59,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:59,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:59,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:59,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:59,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 713 [2025-01-09 21:30:59,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 635 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 674.6666666666666) internal successors, (2024), 3 states have internal predecessors, (2024), 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:30:59,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:59,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 713 [2025-01-09 21:30:59,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:00,194 INFO L124 PetriNetUnfolderBase]: 160/6416 cut-off events. [2025-01-09 21:31:00,195 INFO L125 PetriNetUnfolderBase]: For 123/137 co-relation queries the response was YES. [2025-01-09 21:31:00,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7164 conditions, 6416 events. 160/6416 cut-off events. For 123/137 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 63238 event pairs, 6 based on Foata normal form. 0/5896 useless extension candidates. Maximal degree in co-relation 7109. Up to 106 conditions per place. [2025-01-09 21:31:00,236 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 24 selfloop transitions, 2 changer transitions 0/637 dead transitions. [2025-01-09 21:31:00,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 637 transitions, 1534 flow [2025-01-09 21:31:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2044 transitions. [2025-01-09 21:31:00,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555867227676484 [2025-01-09 21:31:00,237 INFO L175 Difference]: Start difference. First operand has 639 places, 635 transitions, 1476 flow. Second operand 3 states and 2044 transitions. [2025-01-09 21:31:00,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 637 transitions, 1534 flow [2025-01-09 21:31:00,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 637 transitions, 1528 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:00,244 INFO L231 Difference]: Finished difference. Result has 638 places, 635 transitions, 1480 flow [2025-01-09 21:31:00,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=638, PETRI_TRANSITIONS=635} [2025-01-09 21:31:00,245 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -31 predicate places. [2025-01-09 21:31:00,245 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 635 transitions, 1480 flow [2025-01-09 21:31:00,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.6666666666666) internal successors, (2024), 3 states have internal predecessors, (2024), 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:31:00,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:00,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:00,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:31:00,246 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:31:00,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1371641032, now seen corresponding path program 1 times [2025-01-09 21:31:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539052214] [2025-01-09 21:31:00,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:00,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 21:31:00,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 21:31:00,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:00,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:00,291 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:31:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:00,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539052214] [2025-01-09 21:31:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539052214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:00,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:00,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:31:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882321314] [2025-01-09 21:31:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:00,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:00,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:00,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:00,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 713 [2025-01-09 21:31:00,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 635 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:31:00,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:00,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 713 [2025-01-09 21:31:00,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:00,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 423#L60-33true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:00,901 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2025-01-09 21:31:00,901 INFO L297 olderBase$Statistics]: existing Event has 409 ancestors and is cut-off event [2025-01-09 21:31:00,901 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-01-09 21:31:00,901 INFO L297 olderBase$Statistics]: existing Event has 417 ancestors and is cut-off event [2025-01-09 21:31:00,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 423#L60-33true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:00,940 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2025-01-09 21:31:00,940 INFO L297 olderBase$Statistics]: existing Event has 421 ancestors and is cut-off event [2025-01-09 21:31:00,940 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2025-01-09 21:31:00,941 INFO L297 olderBase$Statistics]: existing Event has 401 ancestors and is cut-off event [2025-01-09 21:31:00,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][575], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 566#L60-67true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:00,960 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2025-01-09 21:31:00,960 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2025-01-09 21:31:00,960 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2025-01-09 21:31:00,960 INFO L297 olderBase$Statistics]: existing Event has 459 ancestors and is cut-off event [2025-01-09 21:31:01,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][575], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 566#L60-67true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:01,080 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2025-01-09 21:31:01,080 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-01-09 21:31:01,081 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2025-01-09 21:31:01,081 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2025-01-09 21:31:01,088 INFO L124 PetriNetUnfolderBase]: 146/5998 cut-off events. [2025-01-09 21:31:01,088 INFO L125 PetriNetUnfolderBase]: For 91/107 co-relation queries the response was YES. [2025-01-09 21:31:01,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 5998 events. 146/5998 cut-off events. For 91/107 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 56368 event pairs, 10 based on Foata normal form. 0/5526 useless extension candidates. Maximal degree in co-relation 6744. Up to 173 conditions per place. [2025-01-09 21:31:01,111 INFO L140 encePairwiseOnDemand]: 709/713 looper letters, 11 selfloop transitions, 3 changer transitions 0/638 dead transitions. [2025-01-09 21:31:01,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 638 transitions, 1515 flow [2025-01-09 21:31:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2025-01-09 21:31:01,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967741935483871 [2025-01-09 21:31:01,113 INFO L175 Difference]: Start difference. First operand has 638 places, 635 transitions, 1480 flow. Second operand 3 states and 2070 transitions. [2025-01-09 21:31:01,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 638 transitions, 1515 flow [2025-01-09 21:31:01,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 638 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:01,119 INFO L231 Difference]: Finished difference. Result has 642 places, 637 transitions, 1502 flow [2025-01-09 21:31:01,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=642, PETRI_TRANSITIONS=637} [2025-01-09 21:31:01,120 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -27 predicate places. [2025-01-09 21:31:01,120 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 637 transitions, 1502 flow [2025-01-09 21:31:01,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:31:01,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:01,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:01,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:31:01,121 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:31:01,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -955671709, now seen corresponding path program 1 times [2025-01-09 21:31:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:01,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585302053] [2025-01-09 21:31:01,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:01,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 21:31:01,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 21:31:01,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:01,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:01,166 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:31:01,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:01,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585302053] [2025-01-09 21:31:01,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585302053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:01,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:01,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782283039] [2025-01-09 21:31:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:01,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:01,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:01,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:01,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:31:01,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 637 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:31:01,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:01,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:31:01,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:01,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 486#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 828#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 756#(<= 2147483647 ~id_0~0), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:01,877 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is not cut-off event [2025-01-09 21:31:01,877 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2025-01-09 21:31:01,877 INFO L297 olderBase$Statistics]: existing Event has 448 ancestors and is not cut-off event [2025-01-09 21:31:01,877 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-01-09 21:31:01,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 486#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 828#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:01,879 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is not cut-off event [2025-01-09 21:31:01,879 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-01-09 21:31:01,879 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2025-01-09 21:31:01,879 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2025-01-09 21:31:01,881 INFO L124 PetriNetUnfolderBase]: 112/6394 cut-off events. [2025-01-09 21:31:01,881 INFO L125 PetriNetUnfolderBase]: For 139/179 co-relation queries the response was YES. [2025-01-09 21:31:01,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7344 conditions, 6394 events. 112/6394 cut-off events. For 139/179 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 62675 event pairs, 2 based on Foata normal form. 0/5990 useless extension candidates. Maximal degree in co-relation 7289. Up to 100 conditions per place. [2025-01-09 21:31:01,925 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 12 selfloop transitions, 1 changer transitions 0/638 dead transitions. [2025-01-09 21:31:01,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 638 transitions, 1533 flow [2025-01-09 21:31:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2025-01-09 21:31:01,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663394109396914 [2025-01-09 21:31:01,927 INFO L175 Difference]: Start difference. First operand has 642 places, 637 transitions, 1502 flow. Second operand 3 states and 2067 transitions. [2025-01-09 21:31:01,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 638 transitions, 1533 flow [2025-01-09 21:31:01,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 638 transitions, 1527 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:01,933 INFO L231 Difference]: Finished difference. Result has 640 places, 635 transitions, 1494 flow [2025-01-09 21:31:01,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=640, PETRI_TRANSITIONS=635} [2025-01-09 21:31:01,934 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -29 predicate places. [2025-01-09 21:31:01,934 INFO L471 AbstractCegarLoop]: Abstraction has has 640 places, 635 transitions, 1494 flow [2025-01-09 21:31:01,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:31:01,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:01,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:01,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:31:01,935 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:31:01,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash 722541639, now seen corresponding path program 1 times [2025-01-09 21:31:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:01,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605487853] [2025-01-09 21:31:01,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:01,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 21:31:01,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 21:31:01,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:01,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:01,975 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:31:01,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:01,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605487853] [2025-01-09 21:31:01,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605487853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:01,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:01,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791276852] [2025-01-09 21:31:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:01,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:01,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:01,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:01,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:31:01,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 635 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:31:01,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:01,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:31:01,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:02,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][618], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 486#L90true, Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 831#true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 828#true, Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:02,581 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is not cut-off event [2025-01-09 21:31:02,581 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-01-09 21:31:02,581 INFO L297 olderBase$Statistics]: existing Event has 448 ancestors and is not cut-off event [2025-01-09 21:31:02,581 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2025-01-09 21:31:02,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][618], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 486#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 831#true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 828#true, Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:02,583 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is not cut-off event [2025-01-09 21:31:02,583 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2025-01-09 21:31:02,583 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2025-01-09 21:31:02,583 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-01-09 21:31:02,584 INFO L124 PetriNetUnfolderBase]: 110/5956 cut-off events. [2025-01-09 21:31:02,584 INFO L125 PetriNetUnfolderBase]: For 69/85 co-relation queries the response was YES. [2025-01-09 21:31:02,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6810 conditions, 5956 events. 110/5956 cut-off events. For 69/85 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 56734 event pairs, 2 based on Foata normal form. 0/5592 useless extension candidates. Maximal degree in co-relation 6755. Up to 100 conditions per place. [2025-01-09 21:31:02,625 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 12 selfloop transitions, 1 changer transitions 0/636 dead transitions. [2025-01-09 21:31:02,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 636 transitions, 1525 flow [2025-01-09 21:31:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2025-01-09 21:31:02,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663394109396914 [2025-01-09 21:31:02,627 INFO L175 Difference]: Start difference. First operand has 640 places, 635 transitions, 1494 flow. Second operand 3 states and 2067 transitions. [2025-01-09 21:31:02,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 636 transitions, 1525 flow [2025-01-09 21:31:02,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 636 transitions, 1524 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:02,633 INFO L231 Difference]: Finished difference. Result has 639 places, 633 transitions, 1491 flow [2025-01-09 21:31:02,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1491, PETRI_PLACES=639, PETRI_TRANSITIONS=633} [2025-01-09 21:31:02,634 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -30 predicate places. [2025-01-09 21:31:02,634 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 633 transitions, 1491 flow [2025-01-09 21:31:02,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:31:02,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:02,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:02,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:31:02,635 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:31:02,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1048407190, now seen corresponding path program 1 times [2025-01-09 21:31:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:02,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049271830] [2025-01-09 21:31:02,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:02,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 21:31:02,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 21:31:02,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:02,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:02,682 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:31:02,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:02,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049271830] [2025-01-09 21:31:02,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049271830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:02,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:02,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745170704] [2025-01-09 21:31:02,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:02,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:02,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:02,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:02,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:02,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:31:02,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 633 transitions, 1491 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:31:02,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:02,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:31:02,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:03,522 INFO L124 PetriNetUnfolderBase]: 120/6482 cut-off events. [2025-01-09 21:31:03,522 INFO L125 PetriNetUnfolderBase]: For 107/127 co-relation queries the response was YES. [2025-01-09 21:31:03,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7418 conditions, 6482 events. 120/6482 cut-off events. For 107/127 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 61067 event pairs, 6 based on Foata normal form. 0/6100 useless extension candidates. Maximal degree in co-relation 7363. Up to 108 conditions per place. [2025-01-09 21:31:03,548 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 11 selfloop transitions, 1 changer transitions 0/633 dead transitions. [2025-01-09 21:31:03,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 633 transitions, 1517 flow [2025-01-09 21:31:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2066 transitions. [2025-01-09 21:31:03,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9658719027582983 [2025-01-09 21:31:03,549 INFO L175 Difference]: Start difference. First operand has 639 places, 633 transitions, 1491 flow. Second operand 3 states and 2066 transitions. [2025-01-09 21:31:03,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 633 transitions, 1517 flow [2025-01-09 21:31:03,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 633 transitions, 1516 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:03,555 INFO L231 Difference]: Finished difference. Result has 638 places, 631 transitions, 1488 flow [2025-01-09 21:31:03,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=638, PETRI_TRANSITIONS=631} [2025-01-09 21:31:03,556 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -31 predicate places. [2025-01-09 21:31:03,556 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 631 transitions, 1488 flow [2025-01-09 21:31:03,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:31:03,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:03,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:03,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:31:03,557 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:31:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1797947430, now seen corresponding path program 1 times [2025-01-09 21:31:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702183553] [2025-01-09 21:31:03,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:03,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-09 21:31:03,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-09 21:31:03,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:03,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:03,600 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:31:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:03,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702183553] [2025-01-09 21:31:03,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702183553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:03,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:03,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299915536] [2025-01-09 21:31:03,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:03,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:03,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:03,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:03,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:31:03,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 631 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:31:03,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:03,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:31:03,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:04,352 INFO L124 PetriNetUnfolderBase]: 120/6342 cut-off events. [2025-01-09 21:31:04,352 INFO L125 PetriNetUnfolderBase]: For 107/127 co-relation queries the response was YES. [2025-01-09 21:31:04,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7276 conditions, 6342 events. 120/6342 cut-off events. For 107/127 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 59517 event pairs, 6 based on Foata normal form. 0/6000 useless extension candidates. Maximal degree in co-relation 7221. Up to 108 conditions per place. [2025-01-09 21:31:04,406 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 11 selfloop transitions, 1 changer transitions 0/631 dead transitions. [2025-01-09 21:31:04,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 631 transitions, 1514 flow [2025-01-09 21:31:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2066 transitions. [2025-01-09 21:31:04,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9658719027582983 [2025-01-09 21:31:04,408 INFO L175 Difference]: Start difference. First operand has 638 places, 631 transitions, 1488 flow. Second operand 3 states and 2066 transitions. [2025-01-09 21:31:04,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 631 transitions, 1514 flow [2025-01-09 21:31:04,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 631 transitions, 1513 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:04,414 INFO L231 Difference]: Finished difference. Result has 637 places, 629 transitions, 1485 flow [2025-01-09 21:31:04,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1485, PETRI_PLACES=637, PETRI_TRANSITIONS=629} [2025-01-09 21:31:04,415 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -32 predicate places. [2025-01-09 21:31:04,415 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 629 transitions, 1485 flow [2025-01-09 21:31:04,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:31:04,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:04,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:04,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:31:04,416 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:31:04,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash -560620934, now seen corresponding path program 1 times [2025-01-09 21:31:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:04,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724141931] [2025-01-09 21:31:04,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:04,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:04,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 21:31:04,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 21:31:04,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:04,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:04,461 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:31:04,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:04,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724141931] [2025-01-09 21:31:04,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724141931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:04,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:04,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401178986] [2025-01-09 21:31:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:04,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:04,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:04,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:04,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:31:04,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 629 transitions, 1485 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:31:04,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:04,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:31:04,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:05,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][612], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 486#L90true, Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 837#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:05,318 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2025-01-09 21:31:05,318 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-01-09 21:31:05,319 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-01-09 21:31:05,319 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is not cut-off event [2025-01-09 21:31:05,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][612], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 486#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 837#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:05,321 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is not cut-off event [2025-01-09 21:31:05,321 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-01-09 21:31:05,321 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-01-09 21:31:05,321 INFO L297 olderBase$Statistics]: existing Event has 496 ancestors and is not cut-off event [2025-01-09 21:31:05,323 INFO L124 PetriNetUnfolderBase]: 116/6104 cut-off events. [2025-01-09 21:31:05,323 INFO L125 PetriNetUnfolderBase]: For 73/141 co-relation queries the response was YES. [2025-01-09 21:31:05,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 6104 events. 116/6104 cut-off events. For 73/141 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 58167 event pairs, 12 based on Foata normal form. 2/5832 useless extension candidates. Maximal degree in co-relation 7123. Up to 196 conditions per place. [2025-01-09 21:31:05,371 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/629 dead transitions. [2025-01-09 21:31:05,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 629 transitions, 1510 flow [2025-01-09 21:31:05,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-01-09 21:31:05,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-01-09 21:31:05,373 INFO L175 Difference]: Start difference. First operand has 637 places, 629 transitions, 1485 flow. Second operand 3 states and 2065 transitions. [2025-01-09 21:31:05,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 629 transitions, 1510 flow [2025-01-09 21:31:05,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 629 transitions, 1509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:05,380 INFO L231 Difference]: Finished difference. Result has 637 places, 628 transitions, 1486 flow [2025-01-09 21:31:05,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=637, PETRI_TRANSITIONS=628} [2025-01-09 21:31:05,381 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -32 predicate places. [2025-01-09 21:31:05,381 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 628 transitions, 1486 flow [2025-01-09 21:31:05,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:31:05,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:05,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:05,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:31:05,382 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:31:05,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash 375088832, now seen corresponding path program 1 times [2025-01-09 21:31:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:05,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002784063] [2025-01-09 21:31:05,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:05,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 21:31:05,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 21:31:05,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:05,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:05,445 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:31:05,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:05,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002784063] [2025-01-09 21:31:05,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002784063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:05,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:05,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:05,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631537311] [2025-01-09 21:31:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:05,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:05,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:05,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:05,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:05,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:31:05,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 628 transitions, 1486 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:31:05,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:05,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:31:05,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:06,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][565], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 187#L60-62true, 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,359 INFO L294 olderBase$Statistics]: this new event has 470 ancestors and is cut-off event [2025-01-09 21:31:06,359 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is cut-off event [2025-01-09 21:31:06,359 INFO L297 olderBase$Statistics]: existing Event has 454 ancestors and is cut-off event [2025-01-09 21:31:06,359 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is cut-off event [2025-01-09 21:31:06,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][565], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 187#L60-62true, 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,386 INFO L294 olderBase$Statistics]: this new event has 482 ancestors and is cut-off event [2025-01-09 21:31:06,386 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is cut-off event [2025-01-09 21:31:06,386 INFO L297 olderBase$Statistics]: existing Event has 466 ancestors and is cut-off event [2025-01-09 21:31:06,386 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is cut-off event [2025-01-09 21:31:06,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] L60-61-->L60-62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet26#1][529], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 187#L60-62true, 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,403 INFO L294 olderBase$Statistics]: this new event has 454 ancestors and is not cut-off event [2025-01-09 21:31:06,403 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is not cut-off event [2025-01-09 21:31:06,403 INFO L297 olderBase$Statistics]: existing Event has 470 ancestors and is not cut-off event [2025-01-09 21:31:06,403 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is not cut-off event [2025-01-09 21:31:06,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 845#(= |#race~result_9~0| |thread2Thread1of1ForFork1_#t~nondet26#1|), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 41#L60-63true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,404 INFO L294 olderBase$Statistics]: this new event has 455 ancestors and is cut-off event [2025-01-09 21:31:06,404 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2025-01-09 21:31:06,404 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2025-01-09 21:31:06,404 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-01-09 21:31:06,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 845#(= |#race~result_9~0| |thread2Thread1of1ForFork1_#t~nondet26#1|), 351#L60-64true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,405 INFO L294 olderBase$Statistics]: this new event has 456 ancestors and is cut-off event [2025-01-09 21:31:06,405 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is cut-off event [2025-01-09 21:31:06,405 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is cut-off event [2025-01-09 21:31:06,405 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2025-01-09 21:31:06,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][565], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 188#L62true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,409 INFO L294 olderBase$Statistics]: this new event has 465 ancestors and is cut-off event [2025-01-09 21:31:06,409 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is cut-off event [2025-01-09 21:31:06,409 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is cut-off event [2025-01-09 21:31:06,409 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is cut-off event [2025-01-09 21:31:06,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] L60-61-->L60-62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet26#1][529], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 187#L60-62true, 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,410 INFO L294 olderBase$Statistics]: this new event has 466 ancestors and is not cut-off event [2025-01-09 21:31:06,410 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is not cut-off event [2025-01-09 21:31:06,410 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is not cut-off event [2025-01-09 21:31:06,410 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is not cut-off event [2025-01-09 21:31:06,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, 845#(= |#race~result_9~0| |thread2Thread1of1ForFork1_#t~nondet26#1|), Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 41#L60-63true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,410 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is cut-off event [2025-01-09 21:31:06,410 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2025-01-09 21:31:06,410 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is cut-off event [2025-01-09 21:31:06,410 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2025-01-09 21:31:06,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, 845#(= |#race~result_9~0| |thread2Thread1of1ForFork1_#t~nondet26#1|), Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 351#L60-64true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,411 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is cut-off event [2025-01-09 21:31:06,411 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is cut-off event [2025-01-09 21:31:06,411 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is cut-off event [2025-01-09 21:31:06,411 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is cut-off event [2025-01-09 21:31:06,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][565], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 188#L62true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:06,414 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-01-09 21:31:06,414 INFO L297 olderBase$Statistics]: existing Event has 485 ancestors and is cut-off event [2025-01-09 21:31:06,414 INFO L297 olderBase$Statistics]: existing Event has 493 ancestors and is cut-off event [2025-01-09 21:31:06,414 INFO L297 olderBase$Statistics]: existing Event has 485 ancestors and is cut-off event [2025-01-09 21:31:06,416 INFO L124 PetriNetUnfolderBase]: 158/6108 cut-off events. [2025-01-09 21:31:06,416 INFO L125 PetriNetUnfolderBase]: For 147/165 co-relation queries the response was YES. [2025-01-09 21:31:06,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 6108 events. 158/6108 cut-off events. For 147/165 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 57917 event pairs, 16 based on Foata normal form. 0/5824 useless extension candidates. Maximal degree in co-relation 7243. Up to 224 conditions per place. [2025-01-09 21:31:06,465 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 10 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2025-01-09 21:31:06,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 628 transitions, 1511 flow [2025-01-09 21:31:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2025-01-09 21:31:06,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9654043945769051 [2025-01-09 21:31:06,466 INFO L175 Difference]: Start difference. First operand has 637 places, 628 transitions, 1486 flow. Second operand 3 states and 2065 transitions. [2025-01-09 21:31:06,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 628 transitions, 1511 flow [2025-01-09 21:31:06,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 628 transitions, 1507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:06,473 INFO L231 Difference]: Finished difference. Result has 636 places, 627 transitions, 1484 flow [2025-01-09 21:31:06,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=636, PETRI_TRANSITIONS=627} [2025-01-09 21:31:06,474 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -33 predicate places. [2025-01-09 21:31:06,474 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 627 transitions, 1484 flow [2025-01-09 21:31:06,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:31:06,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:06,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:06,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:31:06,475 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:31:06,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1663988061, now seen corresponding path program 1 times [2025-01-09 21:31:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:06,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087096344] [2025-01-09 21:31:06,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:06,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:06,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 21:31:06,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 21:31:06,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:06,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:06,533 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:31:06,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087096344] [2025-01-09 21:31:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087096344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094631850] [2025-01-09 21:31:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:06,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:06,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:06,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:06,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:31:06,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 627 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:31:06,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:06,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:31:06,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:07,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 486#L90true, Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:07,234 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2025-01-09 21:31:07,234 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-01-09 21:31:07,234 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is not cut-off event [2025-01-09 21:31:07,234 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2025-01-09 21:31:07,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1858] thread2EXIT-->L90: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 486#L90true, 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork1_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:07,235 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is not cut-off event [2025-01-09 21:31:07,235 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-01-09 21:31:07,235 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2025-01-09 21:31:07,235 INFO L297 olderBase$Statistics]: existing Event has 496 ancestors and is not cut-off event [2025-01-09 21:31:07,237 INFO L124 PetriNetUnfolderBase]: 98/5948 cut-off events. [2025-01-09 21:31:07,237 INFO L125 PetriNetUnfolderBase]: For 73/111 co-relation queries the response was YES. [2025-01-09 21:31:07,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 5948 events. 98/5948 cut-off events. For 73/111 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56188 event pairs, 6 based on Foata normal form. 0/5734 useless extension candidates. Maximal degree in co-relation 6879. Up to 124 conditions per place. [2025-01-09 21:31:07,267 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 9 selfloop transitions, 1 changer transitions 0/625 dead transitions. [2025-01-09 21:31:07,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 625 transitions, 1500 flow [2025-01-09 21:31:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2025-01-09 21:31:07,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649368863955119 [2025-01-09 21:31:07,269 INFO L175 Difference]: Start difference. First operand has 636 places, 627 transitions, 1484 flow. Second operand 3 states and 2064 transitions. [2025-01-09 21:31:07,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 625 transitions, 1500 flow [2025-01-09 21:31:07,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 625 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:07,276 INFO L231 Difference]: Finished difference. Result has 634 places, 625 transitions, 1478 flow [2025-01-09 21:31:07,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=634, PETRI_TRANSITIONS=625} [2025-01-09 21:31:07,277 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2025-01-09 21:31:07,277 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 625 transitions, 1478 flow [2025-01-09 21:31:07,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:31:07,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:07,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:07,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 21:31:07,278 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2025-01-09 21:31:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2056290227, now seen corresponding path program 1 times [2025-01-09 21:31:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:07,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381992759] [2025-01-09 21:31:07,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:07,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-01-09 21:31:07,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-01-09 21:31:07,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:07,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:07,336 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:31:07,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:07,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381992759] [2025-01-09 21:31:07,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381992759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:07,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:07,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:07,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096929378] [2025-01-09 21:31:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:07,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:07,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:07,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:07,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 713 [2025-01-09 21:31:07,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 625 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:31:07,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:07,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 713 [2025-01-09 21:31:07,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:08,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][565], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 41#L60-63true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:08,025 INFO L294 olderBase$Statistics]: this new event has 471 ancestors and is cut-off event [2025-01-09 21:31:08,025 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2025-01-09 21:31:08,025 INFO L297 olderBase$Statistics]: existing Event has 455 ancestors and is cut-off event [2025-01-09 21:31:08,025 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2025-01-09 21:31:08,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1857] thread1EXIT-->L89-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][565], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 41#L60-63true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), 849#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:08,040 INFO L294 olderBase$Statistics]: this new event has 475 ancestors and is cut-off event [2025-01-09 21:31:08,040 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2025-01-09 21:31:08,040 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is cut-off event [2025-01-09 21:31:08,040 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is cut-off event [2025-01-09 21:31:08,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1796] L60-62-->L60-63: Formula: (= |v_thread2Thread1of1ForFork1_#t~nondet26#1_3| |v_#race~result_9~0_1|) InVars {thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_1|} AuxVars[] AssignedVars[#race~result_9~0][534], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 41#L60-63true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:08,051 INFO L294 olderBase$Statistics]: this new event has 455 ancestors and is not cut-off event [2025-01-09 21:31:08,051 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is not cut-off event [2025-01-09 21:31:08,051 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2025-01-09 21:31:08,051 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2025-01-09 21:31:08,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1796] L60-62-->L60-63: Formula: (= |v_thread2Thread1of1ForFork1_#t~nondet26#1_3| |v_#race~result_9~0_1|) InVars {thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet26#1=|v_thread2Thread1of1ForFork1_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_1|} AuxVars[] AssignedVars[#race~result_9~0][534], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 209#L89-1true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 41#L60-63true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), 849#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork0_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-01-09 21:31:08,056 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2025-01-09 21:31:08,056 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is not cut-off event [2025-01-09 21:31:08,056 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is not cut-off event [2025-01-09 21:31:08,056 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is not cut-off event [2025-01-09 21:31:08,060 INFO L124 PetriNetUnfolderBase]: 104/5994 cut-off events. [2025-01-09 21:31:08,060 INFO L125 PetriNetUnfolderBase]: For 93/111 co-relation queries the response was YES. [2025-01-09 21:31:08,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6900 conditions, 5994 events. 104/5994 cut-off events. For 93/111 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56103 event pairs, 8 based on Foata normal form. 8/5784 useless extension candidates. Maximal degree in co-relation 6845. Up to 138 conditions per place. [2025-01-09 21:31:08,105 INFO L140 encePairwiseOnDemand]: 710/713 looper letters, 0 selfloop transitions, 0 changer transitions 623/623 dead transitions. [2025-01-09 21:31:08,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 623 transitions, 1492 flow [2025-01-09 21:31:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2025-01-09 21:31:08,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644693782141187 [2025-01-09 21:31:08,106 INFO L175 Difference]: Start difference. First operand has 634 places, 625 transitions, 1478 flow. Second operand 3 states and 2063 transitions. [2025-01-09 21:31:08,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 623 transitions, 1492 flow [2025-01-09 21:31:08,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 623 transitions, 1491 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:08,111 INFO L231 Difference]: Finished difference. Result has 633 places, 0 transitions, 0 flow [2025-01-09 21:31:08,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=713, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=633, PETRI_TRANSITIONS=0} [2025-01-09 21:31:08,112 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -36 predicate places. [2025-01-09 21:31:08,112 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 0 transitions, 0 flow [2025-01-09 21:31:08,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:31:08,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (129 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (128 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (127 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (126 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (125 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (124 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (123 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (122 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (121 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (120 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (119 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (118 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (117 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (116 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (115 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (114 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (113 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (112 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (111 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (110 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (109 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (108 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (107 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (106 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (105 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (104 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (103 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (102 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (101 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (100 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (98 of 130 remaining) [2025-01-09 21:31:08,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (97 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (96 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (95 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (94 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (93 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (92 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (91 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (90 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (89 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (88 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (87 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (86 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (85 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (84 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (83 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (82 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (81 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (80 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (79 of 130 remaining) [2025-01-09 21:31:08,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (78 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (77 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (75 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (73 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (72 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (71 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (70 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (69 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (68 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (67 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (65 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (64 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (63 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (62 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (61 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (60 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (59 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (58 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (57 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (56 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (55 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (54 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (53 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (52 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 130 remaining) [2025-01-09 21:31:08,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (43 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (41 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (40 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (39 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (38 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (37 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (36 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (33 of 130 remaining) [2025-01-09 21:31:08,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (32 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (30 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (29 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (28 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (27 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (26 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (25 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 130 remaining) [2025-01-09 21:31:08,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 130 remaining) [2025-01-09 21:31:08,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 130 remaining) [2025-01-09 21:31:08,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 130 remaining) [2025-01-09 21:31:08,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 130 remaining) [2025-01-09 21:31:08,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 130 remaining) [2025-01-09 21:31:08,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (16 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (13 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (12 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (11 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (10 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (8 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (7 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (6 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (5 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (3 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (2 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (1 of 130 remaining) [2025-01-09 21:31:08,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (0 of 130 remaining) [2025-01-09 21:31:08,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 21:31:08,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:08,133 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:31:08,133 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:31:08,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:31:08 BasicIcfg [2025-01-09 21:31:08,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:31:08,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:31:08,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:31:08,140 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:31:08,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:43" (3/4) ... [2025-01-09 21:31:08,141 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:31:08,144 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:31:08,145 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:31:08,151 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-01-09 21:31:08,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:31:08,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:31:08,153 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:31:08,235 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:31:08,235 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:31:08,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:31:08,236 INFO L158 Benchmark]: Toolchain (without parser) took 25593.15ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 113.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 679.7MB. Max. memory is 16.1GB. [2025-01-09 21:31:08,236 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:08,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.52ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:08,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.62ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 95.5MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:08,238 INFO L158 Benchmark]: Boogie Preprocessor took 65.23ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:08,238 INFO L158 Benchmark]: RCFGBuilder took 641.09ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 46.2MB in the end (delta: 45.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 21:31:08,240 INFO L158 Benchmark]: TraceAbstraction took 24402.48ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 45.7MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 604.2MB. Max. memory is 16.1GB. [2025-01-09 21:31:08,240 INFO L158 Benchmark]: Witness Printer took 95.60ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:08,241 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.12ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.52ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.62ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 95.5MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.23ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 641.09ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 46.2MB in the end (delta: 45.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24402.48ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 45.7MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 604.2MB. Max. memory is 16.1GB. * Witness Printer took 95.60ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 985 locations, 130 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.2s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2821 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1256 mSDsluCounter, 822 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 547 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3471 IncrementalHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 547 mSolverCounterUnsat, 350 mSDtfsCounter, 3471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1502occurred in iteration=31, InterpolantAutomatonStates: 130, 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, 2.9s InterpolantComputationTime, 8741 NumberOfCodeBlocks, 8741 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 8702 ConstructedInterpolants, 0 QuantifiedInterpolants, 9201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:31:08,259 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 Result: TRUE