./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.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/popl20-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:41,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:41,450 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:33:41,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:41,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:41,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:41,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:41,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:41,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:41,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:41,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:41,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:41,469 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:41,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:41,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:41,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:41,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:41,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:41,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:41,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:41,471 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2025-01-09 21:33:41,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:41,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:41,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:41,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:41,700 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:41,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-01-09 21:33:42,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5836019f7/07e7d158fb954058bf623a7133893a7e/FLAG7e47f40ba [2025-01-09 21:33:43,092 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:43,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-01-09 21:33:43,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5836019f7/07e7d158fb954058bf623a7133893a7e/FLAG7e47f40ba [2025-01-09 21:33:43,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5836019f7/07e7d158fb954058bf623a7133893a7e [2025-01-09 21:33:43,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:43,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:43,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:43,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:43,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:43,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43, skipping insertion in model container [2025-01-09 21:33:43,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:43,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:43,270 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:43,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:43,301 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:43,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43 WrapperNode [2025-01-09 21:33:43,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:43,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:43,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:43,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:43,306 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:33:43" (1/1) ... [2025-01-09 21:33:43,315 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:33:43" (1/1) ... [2025-01-09 21:33:43,334 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 265 [2025-01-09 21:33:43,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:43,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:43,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:43,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:43,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:43,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:43,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:43,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:43,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (1/1) ... [2025-01-09 21:33:43,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:43,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:43,419 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:33:43,421 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:33:43,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:43,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:43,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:43,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:43,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:43,444 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:33:43,531 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:43,533 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:44,119 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:44,120 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:44,140 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:44,140 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:44,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:44 BoogieIcfgContainer [2025-01-09 21:33:44,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:44,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:44,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:44,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:44,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:43" (1/3) ... [2025-01-09 21:33:44,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7116a541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:44, skipping insertion in model container [2025-01-09 21:33:44,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:43" (2/3) ... [2025-01-09 21:33:44,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7116a541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:44, skipping insertion in model container [2025-01-09 21:33:44,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:44" (3/3) ... [2025-01-09 21:33:44,148 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-01-09 21:33:44,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:44,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 484 locations, 1 initial locations, 7 loop locations, and 44 error locations. [2025-01-09 21:33:44,160 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:44,258 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:44,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 506 transitions, 1033 flow [2025-01-09 21:33:44,464 INFO L124 PetriNetUnfolderBase]: 23/503 cut-off events. [2025-01-09 21:33:44,466 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:44,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 503 events. 23/503 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 710 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 392. Up to 2 conditions per place. [2025-01-09 21:33:44,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 506 transitions, 1033 flow [2025-01-09 21:33:44,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 472 places, 484 transitions, 986 flow [2025-01-09 21:33:44,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:44,505 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;@616d0400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:44,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-01-09 21:33:44,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:44,513 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:33:44,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:44,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,514 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] [2025-01-09 21:33:44,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:44,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1500302960, now seen corresponding path program 1 times [2025-01-09 21:33:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433198962] [2025-01-09 21:33:44,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:33:44,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:33:44,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,668 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:33:44,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433198962] [2025-01-09 21:33:44,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433198962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023752551] [2025-01-09 21:33:44,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 506 [2025-01-09 21:33:44,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 484 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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:33:44,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 506 [2025-01-09 21:33:44,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,849 INFO L124 PetriNetUnfolderBase]: 23/763 cut-off events. [2025-01-09 21:33:44,849 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-09 21:33:44,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 763 events. 23/763 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2630 event pairs, 7 based on Foata normal form. 22/669 useless extension candidates. Maximal degree in co-relation 423. Up to 31 conditions per place. [2025-01-09 21:33:44,856 INFO L140 encePairwiseOnDemand]: 490/506 looper letters, 13 selfloop transitions, 2 changer transitions 10/470 dead transitions. [2025-01-09 21:33:44,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 470 transitions, 988 flow [2025-01-09 21:33:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-01-09 21:33:44,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.955862977602108 [2025-01-09 21:33:44,870 INFO L175 Difference]: Start difference. First operand has 472 places, 484 transitions, 986 flow. Second operand 3 states and 1451 transitions. [2025-01-09 21:33:44,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 470 transitions, 988 flow [2025-01-09 21:33:44,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 470 transitions, 976 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:44,882 INFO L231 Difference]: Finished difference. Result has 467 places, 460 transitions, 930 flow [2025-01-09 21:33:44,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=467, PETRI_TRANSITIONS=460} [2025-01-09 21:33:44,888 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -5 predicate places. [2025-01-09 21:33:44,888 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 460 transitions, 930 flow [2025-01-09 21:33:44,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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:33:44,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,890 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] [2025-01-09 21:33:44,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:44,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:44,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,891 INFO L85 PathProgramCache]: Analyzing trace with hash -343591037, now seen corresponding path program 1 times [2025-01-09 21:33:44,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037370447] [2025-01-09 21:33:44,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:33:44,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:33:44,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,931 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:33:44,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037370447] [2025-01-09 21:33:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037370447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246384561] [2025-01-09 21:33:44,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 506 [2025-01-09 21:33:44,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 460 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 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:33:44,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 506 [2025-01-09 21:33:44,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,087 INFO L124 PetriNetUnfolderBase]: 17/604 cut-off events. [2025-01-09 21:33:45,087 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:33:45,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 604 events. 17/604 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1616 event pairs, 5 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 615. Up to 31 conditions per place. [2025-01-09 21:33:45,092 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 17 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-01-09 21:33:45,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 459 transitions, 966 flow [2025-01-09 21:33:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1430 transitions. [2025-01-09 21:33:45,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2025-01-09 21:33:45,096 INFO L175 Difference]: Start difference. First operand has 467 places, 460 transitions, 930 flow. Second operand 3 states and 1430 transitions. [2025-01-09 21:33:45,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 459 transitions, 966 flow [2025-01-09 21:33:45,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 459 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:45,105 INFO L231 Difference]: Finished difference. Result has 456 places, 459 transitions, 928 flow [2025-01-09 21:33:45,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=456, PETRI_TRANSITIONS=459} [2025-01-09 21:33:45,106 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2025-01-09 21:33:45,107 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 459 transitions, 928 flow [2025-01-09 21:33:45,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 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:33:45,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:45,108 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] [2025-01-09 21:33:45,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:45,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:45,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1323437658, now seen corresponding path program 1 times [2025-01-09 21:33:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:45,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759013030] [2025-01-09 21:33:45,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:45,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:45,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:33:45,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:33:45,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:45,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:45,157 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:33:45,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759013030] [2025-01-09 21:33:45,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759013030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:45,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:45,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:45,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797517885] [2025-01-09 21:33:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:45,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:45,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:45,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:45,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 506 [2025-01-09 21:33:45,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 459 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 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:33:45,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:45,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 506 [2025-01-09 21:33:45,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,293 INFO L124 PetriNetUnfolderBase]: 29/735 cut-off events. [2025-01-09 21:33:45,293 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:33:45,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 735 events. 29/735 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2630 event pairs, 12 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 763. Up to 54 conditions per place. [2025-01-09 21:33:45,300 INFO L140 encePairwiseOnDemand]: 497/506 looper letters, 22 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2025-01-09 21:33:45,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 958 flow [2025-01-09 21:33:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2025-01-09 21:33:45,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9295125164690382 [2025-01-09 21:33:45,304 INFO L175 Difference]: Start difference. First operand has 456 places, 459 transitions, 928 flow. Second operand 3 states and 1411 transitions. [2025-01-09 21:33:45,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 958 flow [2025-01-09 21:33:45,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:45,310 INFO L231 Difference]: Finished difference. Result has 448 places, 451 transitions, 910 flow [2025-01-09 21:33:45,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=451} [2025-01-09 21:33:45,312 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2025-01-09 21:33:45,312 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 451 transitions, 910 flow [2025-01-09 21:33:45,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 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:33:45,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:45,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:45,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:45,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:45,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2019550661, now seen corresponding path program 1 times [2025-01-09 21:33:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-01-09 21:33:45,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:45,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:45,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:33:45,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:33:45,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:45,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:45,790 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:33:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:45,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-01-09 21:33:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63390728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:45,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:45,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:45,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681588126] [2025-01-09 21:33:45,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:45,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:45,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:45,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:46,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 506 [2025-01-09 21:33:46,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 451 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 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:33:46,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:46,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 506 [2025-01-09 21:33:46,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:48,540 INFO L124 PetriNetUnfolderBase]: 5286/18618 cut-off events. [2025-01-09 21:33:48,540 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2025-01-09 21:33:48,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26699 conditions, 18618 events. 5286/18618 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 212178 event pairs, 4536 based on Foata normal form. 0/15895 useless extension candidates. Maximal degree in co-relation 26661. Up to 7875 conditions per place. [2025-01-09 21:33:48,641 INFO L140 encePairwiseOnDemand]: 482/506 looper letters, 82 selfloop transitions, 20 changer transitions 0/447 dead transitions. [2025-01-09 21:33:48,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 447 transitions, 1106 flow [2025-01-09 21:33:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2416 transitions. [2025-01-09 21:33:48,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7957839262187089 [2025-01-09 21:33:48,646 INFO L175 Difference]: Start difference. First operand has 448 places, 451 transitions, 910 flow. Second operand 6 states and 2416 transitions. [2025-01-09 21:33:48,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 447 transitions, 1106 flow [2025-01-09 21:33:48,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 447 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:48,651 INFO L231 Difference]: Finished difference. Result has 448 places, 447 transitions, 941 flow [2025-01-09 21:33:48,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=448, PETRI_TRANSITIONS=447} [2025-01-09 21:33:48,652 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2025-01-09 21:33:48,653 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 447 transitions, 941 flow [2025-01-09 21:33:48,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 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:33:48,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:48,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:48,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:48,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:48,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:48,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1768706068, now seen corresponding path program 1 times [2025-01-09 21:33:48,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:48,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721762509] [2025-01-09 21:33:48,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:48,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:48,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:33:48,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:33:48,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:48,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:48,694 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:33:48,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721762509] [2025-01-09 21:33:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721762509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523627420] [2025-01-09 21:33:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:48,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:48,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:48,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:48,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-01-09 21:33:48,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 447 transitions, 941 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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:33:48,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:48,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-01-09 21:33:48,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:48,771 INFO L124 PetriNetUnfolderBase]: 28/674 cut-off events. [2025-01-09 21:33:48,771 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:48,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 674 events. 28/674 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2232 event pairs, 15 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 707. Up to 40 conditions per place. [2025-01-09 21:33:48,775 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 12 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2025-01-09 21:33:48,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 446 transitions, 967 flow [2025-01-09 21:33:48,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2025-01-09 21:33:48,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486166007905138 [2025-01-09 21:33:48,778 INFO L175 Difference]: Start difference. First operand has 448 places, 447 transitions, 941 flow. Second operand 3 states and 1440 transitions. [2025-01-09 21:33:48,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 446 transitions, 967 flow [2025-01-09 21:33:48,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 446 transitions, 927 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:48,785 INFO L231 Difference]: Finished difference. Result has 444 places, 446 transitions, 903 flow [2025-01-09 21:33:48,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=444, PETRI_TRANSITIONS=446} [2025-01-09 21:33:48,788 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -28 predicate places. [2025-01-09 21:33:48,788 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 446 transitions, 903 flow [2025-01-09 21:33:48,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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:33:48,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:48,790 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] [2025-01-09 21:33:48,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:48,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -933929968, now seen corresponding path program 1 times [2025-01-09 21:33:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:48,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116254711] [2025-01-09 21:33:48,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:48,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:33:48,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:33:48,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:48,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:48,839 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:33:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116254711] [2025-01-09 21:33:48,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116254711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:48,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:48,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141006218] [2025-01-09 21:33:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:48,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:48,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:48,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:48,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-01-09 21:33:48,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 446 transitions, 903 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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:33:48,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:48,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-01-09 21:33:48,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:48,910 INFO L124 PetriNetUnfolderBase]: 28/673 cut-off events. [2025-01-09 21:33:48,910 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:48,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 673 events. 28/673 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2204 event pairs, 15 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 688. Up to 40 conditions per place. [2025-01-09 21:33:48,914 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 12 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2025-01-09 21:33:48,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 445 transitions, 929 flow [2025-01-09 21:33:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2025-01-09 21:33:48,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486166007905138 [2025-01-09 21:33:48,917 INFO L175 Difference]: Start difference. First operand has 444 places, 446 transitions, 903 flow. Second operand 3 states and 1440 transitions. [2025-01-09 21:33:48,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 445 transitions, 929 flow [2025-01-09 21:33:48,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 445 transitions, 925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:48,924 INFO L231 Difference]: Finished difference. Result has 443 places, 445 transitions, 901 flow [2025-01-09 21:33:48,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=443, PETRI_TRANSITIONS=445} [2025-01-09 21:33:48,926 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -29 predicate places. [2025-01-09 21:33:48,926 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 445 transitions, 901 flow [2025-01-09 21:33:48,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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:33:48,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:48,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] [2025-01-09 21:33:48,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:48,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:48,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash -972797789, now seen corresponding path program 1 times [2025-01-09 21:33:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:48,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-01-09 21:33:48,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:48,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 21:33:48,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 21:33:48,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:48,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:48,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:48,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-01-09 21:33:48,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861974994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:48,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:48,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:48,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124398004] [2025-01-09 21:33:48,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:48,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:48,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:48,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:48,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 506 [2025-01-09 21:33:49,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 445 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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:33:49,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 506 [2025-01-09 21:33:49,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:49,040 INFO L124 PetriNetUnfolderBase]: 13/551 cut-off events. [2025-01-09 21:33:49,041 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:33:49,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 551 events. 13/551 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1310 event pairs, 2 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 540. Up to 16 conditions per place. [2025-01-09 21:33:49,044 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 11 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2025-01-09 21:33:49,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 444 transitions, 925 flow [2025-01-09 21:33:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1442 transitions. [2025-01-09 21:33:49,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9499341238471674 [2025-01-09 21:33:49,046 INFO L175 Difference]: Start difference. First operand has 443 places, 445 transitions, 901 flow. Second operand 3 states and 1442 transitions. [2025-01-09 21:33:49,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 444 transitions, 925 flow [2025-01-09 21:33:49,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 444 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:49,052 INFO L231 Difference]: Finished difference. Result has 442 places, 444 transitions, 899 flow [2025-01-09 21:33:49,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=442, PETRI_TRANSITIONS=444} [2025-01-09 21:33:49,053 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -30 predicate places. [2025-01-09 21:33:49,053 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 444 transitions, 899 flow [2025-01-09 21:33:49,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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:33:49,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:49,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:49,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2121716818, now seen corresponding path program 1 times [2025-01-09 21:33:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:49,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321130866] [2025-01-09 21:33:49,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:49,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 21:33:49,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:33:49,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:49,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:49,098 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:33:49,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:49,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321130866] [2025-01-09 21:33:49,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321130866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:49,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:49,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252507924] [2025-01-09 21:33:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:49,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:49,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:49,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:49,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-01-09 21:33:49,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 444 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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:33:49,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-01-09 21:33:49,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:49,158 INFO L124 PetriNetUnfolderBase]: 22/594 cut-off events. [2025-01-09 21:33:49,158 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:33:49,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 594 events. 22/594 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1561 event pairs, 7 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 598. Up to 32 conditions per place. [2025-01-09 21:33:49,161 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 12 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-01-09 21:33:49,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 443 transitions, 925 flow [2025-01-09 21:33:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2025-01-09 21:33:49,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486166007905138 [2025-01-09 21:33:49,164 INFO L175 Difference]: Start difference. First operand has 442 places, 444 transitions, 899 flow. Second operand 3 states and 1440 transitions. [2025-01-09 21:33:49,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 443 transitions, 925 flow [2025-01-09 21:33:49,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 443 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:49,169 INFO L231 Difference]: Finished difference. Result has 441 places, 443 transitions, 897 flow [2025-01-09 21:33:49,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=441, PETRI_TRANSITIONS=443} [2025-01-09 21:33:49,170 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -31 predicate places. [2025-01-09 21:33:49,170 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 443 transitions, 897 flow [2025-01-09 21:33:49,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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:33:49,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:49,171 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] [2025-01-09 21:33:49,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:49,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:49,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash -34164711, now seen corresponding path program 1 times [2025-01-09 21:33:49,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:49,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635838974] [2025-01-09 21:33:49,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:49,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:33:49,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:33:49,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:49,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:49,272 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:33:49,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635838974] [2025-01-09 21:33:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635838974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:49,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:49,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:49,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484989305] [2025-01-09 21:33:49,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:49,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:49,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:49,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 506 [2025-01-09 21:33:49,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 443 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 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:33:49,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 506 [2025-01-09 21:33:49,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:49,355 INFO L124 PetriNetUnfolderBase]: 41/877 cut-off events. [2025-01-09 21:33:49,355 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:33:49,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 877 events. 41/877 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3814 event pairs, 20 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 906. Up to 56 conditions per place. [2025-01-09 21:33:49,361 INFO L140 encePairwiseOnDemand]: 501/506 looper letters, 14 selfloop transitions, 1 changer transitions 0/439 dead transitions. [2025-01-09 21:33:49,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 439 transitions, 919 flow [2025-01-09 21:33:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2025-01-09 21:33:49,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453227931488801 [2025-01-09 21:33:49,363 INFO L175 Difference]: Start difference. First operand has 441 places, 443 transitions, 897 flow. Second operand 3 states and 1435 transitions. [2025-01-09 21:33:49,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 439 transitions, 919 flow [2025-01-09 21:33:49,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 439 transitions, 915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:49,369 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 887 flow [2025-01-09 21:33:49,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-01-09 21:33:49,371 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-01-09 21:33:49,371 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 887 flow [2025-01-09 21:33:49,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 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:33:49,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:49,372 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] [2025-01-09 21:33:49,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:49,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:49,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash 203497475, now seen corresponding path program 1 times [2025-01-09 21:33:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:49,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118981953] [2025-01-09 21:33:49,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:49,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 21:33:49,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 21:33:49,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:49,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:49,430 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:33:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118981953] [2025-01-09 21:33:49,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118981953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:49,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:49,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:49,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180717887] [2025-01-09 21:33:49,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:49,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:49,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:49,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:49,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 506 [2025-01-09 21:33:49,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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:33:49,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 506 [2025-01-09 21:33:49,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:49,492 INFO L124 PetriNetUnfolderBase]: 17/558 cut-off events. [2025-01-09 21:33:49,492 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:33:49,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 558 events. 17/558 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1290 event pairs, 0 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 558. Up to 19 conditions per place. [2025-01-09 21:33:49,495 INFO L140 encePairwiseOnDemand]: 502/506 looper letters, 16 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2025-01-09 21:33:49,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 444 transitions, 938 flow [2025-01-09 21:33:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1454 transitions. [2025-01-09 21:33:49,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578392621870883 [2025-01-09 21:33:49,498 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 887 flow. Second operand 3 states and 1454 transitions. [2025-01-09 21:33:49,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 444 transitions, 938 flow [2025-01-09 21:33:49,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 937 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:49,506 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 896 flow [2025-01-09 21:33:49,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-01-09 21:33:49,507 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-01-09 21:33:49,507 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 896 flow [2025-01-09 21:33:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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:33:49,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:49,508 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] [2025-01-09 21:33:49,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:49,508 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2007385275, now seen corresponding path program 1 times [2025-01-09 21:33:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753128118] [2025-01-09 21:33:49,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:49,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:49,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 21:33:49,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 21:33:49,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:49,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:49,563 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:33:49,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:49,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753128118] [2025-01-09 21:33:49,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753128118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:49,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:49,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:49,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900787604] [2025-01-09 21:33:49,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:49,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:49,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:49,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-01-09 21:33:49,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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:33:49,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-01-09 21:33:49,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:49,743 INFO L124 PetriNetUnfolderBase]: 135/1964 cut-off events. [2025-01-09 21:33:49,743 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2025-01-09 21:33:49,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 1964 events. 135/1964 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 13341 event pairs, 36 based on Foata normal form. 0/1720 useless extension candidates. Maximal degree in co-relation 2150. Up to 187 conditions per place. [2025-01-09 21:33:49,755 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 18 selfloop transitions, 3 changer transitions 0/444 dead transitions. [2025-01-09 21:33:49,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 444 transitions, 953 flow [2025-01-09 21:33:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2025-01-09 21:33:49,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2025-01-09 21:33:49,758 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 896 flow. Second operand 3 states and 1449 transitions. [2025-01-09 21:33:49,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 444 transitions, 953 flow [2025-01-09 21:33:49,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 953 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:49,763 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 911 flow [2025-01-09 21:33:49,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=911, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-01-09 21:33:49,764 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-01-09 21:33:49,765 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 911 flow [2025-01-09 21:33:49,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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:33:49,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:49,766 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] [2025-01-09 21:33:49,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:49,766 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:49,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:49,767 INFO L85 PathProgramCache]: Analyzing trace with hash -52779602, now seen corresponding path program 1 times [2025-01-09 21:33:49,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:49,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431511187] [2025-01-09 21:33:49,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:49,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:49,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 21:33:49,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 21:33:49,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:49,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:49,822 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:33:49,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:49,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431511187] [2025-01-09 21:33:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431511187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:49,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:49,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949458797] [2025-01-09 21:33:49,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:49,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:49,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:49,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-01-09 21:33:49,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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:33:49,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-01-09 21:33:49,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:49,980 INFO L124 PetriNetUnfolderBase]: 149/1734 cut-off events. [2025-01-09 21:33:49,980 INFO L125 PetriNetUnfolderBase]: For 50/54 co-relation queries the response was YES. [2025-01-09 21:33:49,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1734 events. 149/1734 cut-off events. For 50/54 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10895 event pairs, 22 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 1977. Up to 170 conditions per place. [2025-01-09 21:33:49,990 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 17 selfloop transitions, 3 changer transitions 0/443 dead transitions. [2025-01-09 21:33:49,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 443 transitions, 963 flow [2025-01-09 21:33:49,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1448 transitions. [2025-01-09 21:33:49,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9538866930171278 [2025-01-09 21:33:49,992 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 911 flow. Second operand 3 states and 1448 transitions. [2025-01-09 21:33:49,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 443 transitions, 963 flow [2025-01-09 21:33:49,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 443 transitions, 963 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:49,997 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 926 flow [2025-01-09 21:33:49,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-01-09 21:33:49,999 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-01-09 21:33:49,999 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 926 flow [2025-01-09 21:33:50,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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:33:50,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:50,000 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] [2025-01-09 21:33:50,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:50,001 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:50,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2053216087, now seen corresponding path program 1 times [2025-01-09 21:33:50,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:50,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364375671] [2025-01-09 21:33:50,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:50,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:50,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 21:33:50,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 21:33:50,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:50,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:50,186 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:33:50,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:50,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364375671] [2025-01-09 21:33:50,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364375671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:50,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:50,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:33:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644042261] [2025-01-09 21:33:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:33:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:50,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:33:50,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:33:50,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 506 [2025-01-09 21:33:50,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 926 flow. Second operand has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 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:33:50,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:50,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 506 [2025-01-09 21:33:50,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:50,707 INFO L124 PetriNetUnfolderBase]: 87/1593 cut-off events. [2025-01-09 21:33:50,708 INFO L125 PetriNetUnfolderBase]: For 11/34 co-relation queries the response was YES. [2025-01-09 21:33:50,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 1593 events. 87/1593 cut-off events. For 11/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7180 event pairs, 20 based on Foata normal form. 5/1495 useless extension candidates. Maximal degree in co-relation 1873. Up to 76 conditions per place. [2025-01-09 21:33:50,718 INFO L140 encePairwiseOnDemand]: 469/506 looper letters, 49 selfloop transitions, 56 changer transitions 0/496 dead transitions. [2025-01-09 21:33:50,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 496 transitions, 1258 flow [2025-01-09 21:33:50,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:33:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:33:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4536 transitions. [2025-01-09 21:33:50,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964426877470356 [2025-01-09 21:33:50,725 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 926 flow. Second operand 10 states and 4536 transitions. [2025-01-09 21:33:50,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 496 transitions, 1258 flow [2025-01-09 21:33:50,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 496 transitions, 1258 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:50,734 INFO L231 Difference]: Finished difference. Result has 450 places, 473 transitions, 1181 flow [2025-01-09 21:33:50,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1181, PETRI_PLACES=450, PETRI_TRANSITIONS=473} [2025-01-09 21:33:50,736 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -22 predicate places. [2025-01-09 21:33:50,736 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 473 transitions, 1181 flow [2025-01-09 21:33:50,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 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:33:50,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:50,738 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] [2025-01-09 21:33:50,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:50,738 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:50,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:50,739 INFO L85 PathProgramCache]: Analyzing trace with hash -20960428, now seen corresponding path program 1 times [2025-01-09 21:33:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:50,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679722322] [2025-01-09 21:33:50,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:50,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 21:33:50,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 21:33:50,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:50,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:50,888 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:33:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679722322] [2025-01-09 21:33:50,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679722322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:50,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:50,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788055473] [2025-01-09 21:33:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:50,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:33:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:50,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:33:50,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:33:50,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 506 [2025-01-09 21:33:50,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 473 transitions, 1181 flow. Second operand has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 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:33:50,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:50,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 506 [2025-01-09 21:33:50,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:51,318 INFO L124 PetriNetUnfolderBase]: 153/2461 cut-off events. [2025-01-09 21:33:51,318 INFO L125 PetriNetUnfolderBase]: For 78/123 co-relation queries the response was YES. [2025-01-09 21:33:51,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 2461 events. 153/2461 cut-off events. For 78/123 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14873 event pairs, 45 based on Foata normal form. 10/2294 useless extension candidates. Maximal degree in co-relation 2965. Up to 121 conditions per place. [2025-01-09 21:33:51,360 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 24 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2025-01-09 21:33:51,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 484 transitions, 1269 flow [2025-01-09 21:33:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:33:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:33:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2390 transitions. [2025-01-09 21:33:51,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9446640316205533 [2025-01-09 21:33:51,368 INFO L175 Difference]: Start difference. First operand has 450 places, 473 transitions, 1181 flow. Second operand 5 states and 2390 transitions. [2025-01-09 21:33:51,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 484 transitions, 1269 flow [2025-01-09 21:33:51,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 484 transitions, 1269 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:51,387 INFO L231 Difference]: Finished difference. Result has 456 places, 475 transitions, 1206 flow [2025-01-09 21:33:51,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1206, PETRI_PLACES=456, PETRI_TRANSITIONS=475} [2025-01-09 21:33:51,389 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2025-01-09 21:33:51,389 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 475 transitions, 1206 flow [2025-01-09 21:33:51,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 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:33:51,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:51,394 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:33:51,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:51,394 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:51,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:51,395 INFO L85 PathProgramCache]: Analyzing trace with hash -183614846, now seen corresponding path program 1 times [2025-01-09 21:33:51,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:51,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300713414] [2025-01-09 21:33:51,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:51,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:51,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 21:33:51,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 21:33:51,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:51,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:51,929 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:33:51,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:51,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300713414] [2025-01-09 21:33:51,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300713414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:51,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:51,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062056245] [2025-01-09 21:33:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:51,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:51,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:51,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:52,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-01-09 21:33:52,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 475 transitions, 1206 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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:33:52,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:52,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-01-09 21:33:52,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L67-1-->L67-2: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][364], [504#(= |#race~N~0| 0), Black: 543#(<= ~N~0 0), 239#L67-2true, 173#L51-2true, 559#true, Black: 544#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 526#true, 140#L62true, 525#(= |#race~M~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 530#true, Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), Black: 534#true, 207#L89-4true, 532#(= |#race~A~0| 0), 566#true]) [2025-01-09 21:33:54,101 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-01-09 21:33:54,101 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-01-09 21:33:54,101 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-01-09 21:33:54,102 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-01-09 21:33:54,555 INFO L124 PetriNetUnfolderBase]: 2248/13787 cut-off events. [2025-01-09 21:33:54,556 INFO L125 PetriNetUnfolderBase]: For 873/909 co-relation queries the response was YES. [2025-01-09 21:33:54,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18861 conditions, 13787 events. 2248/13787 cut-off events. For 873/909 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 151369 event pairs, 1160 based on Foata normal form. 0/12402 useless extension candidates. Maximal degree in co-relation 18809. Up to 3033 conditions per place. [2025-01-09 21:33:54,680 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 54 selfloop transitions, 38 changer transitions 0/520 dead transitions. [2025-01-09 21:33:54,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 520 transitions, 1488 flow [2025-01-09 21:33:54,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-01-09 21:33:54,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-01-09 21:33:54,687 INFO L175 Difference]: Start difference. First operand has 456 places, 475 transitions, 1206 flow. Second operand 6 states and 2767 transitions. [2025-01-09 21:33:54,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 520 transitions, 1488 flow [2025-01-09 21:33:54,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 520 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,704 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1455 flow [2025-01-09 21:33:54,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1455, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2025-01-09 21:33:54,705 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2025-01-09 21:33:54,705 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1455 flow [2025-01-09 21:33:54,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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:33:54,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,707 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] [2025-01-09 21:33:54,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:54,707 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:54,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,709 INFO L85 PathProgramCache]: Analyzing trace with hash -360169148, now seen corresponding path program 1 times [2025-01-09 21:33:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396012816] [2025-01-09 21:33:54,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 21:33:54,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 21:33:54,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,778 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:33:54,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396012816] [2025-01-09 21:33:54,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396012816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544977398] [2025-01-09 21:33:54,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-01-09 21:33:54,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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:33:54,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-01-09 21:33:54,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L67-1-->L67-2: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][356], [579#(= |#race~B~0| 0), 239#L67-2true, Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 504#(= |#race~N~0| 0), Black: 543#(<= ~N~0 0), 173#L51-2true, Black: 544#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 207#L89-4true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 279#L59true, Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-01-09 21:33:55,853 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-01-09 21:33:55,853 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-01-09 21:33:55,853 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-01-09 21:33:55,853 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-01-09 21:33:56,150 INFO L124 PetriNetUnfolderBase]: 1600/11576 cut-off events. [2025-01-09 21:33:56,150 INFO L125 PetriNetUnfolderBase]: For 741/958 co-relation queries the response was YES. [2025-01-09 21:33:56,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16517 conditions, 11576 events. 1600/11576 cut-off events. For 741/958 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 122916 event pairs, 343 based on Foata normal form. 0/10650 useless extension candidates. Maximal degree in co-relation 16462. Up to 1365 conditions per place. [2025-01-09 21:33:56,246 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 18 selfloop transitions, 3 changer transitions 0/517 dead transitions. [2025-01-09 21:33:56,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 517 transitions, 1512 flow [2025-01-09 21:33:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2025-01-09 21:33:56,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2025-01-09 21:33:56,248 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1455 flow. Second operand 3 states and 1449 transitions. [2025-01-09 21:33:56,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 517 transitions, 1512 flow [2025-01-09 21:33:56,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 517 transitions, 1512 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:56,261 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1470 flow [2025-01-09 21:33:56,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2025-01-09 21:33:56,262 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2025-01-09 21:33:56,262 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1470 flow [2025-01-09 21:33:56,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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:33:56,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:56,263 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:33:56,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:56,263 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:33:56,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1819131041, now seen corresponding path program 1 times [2025-01-09 21:33:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:56,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-01-09 21:33:56,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:56,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:56,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 21:33:56,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 21:33:56,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:56,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:56,644 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:33:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-01-09 21:33:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373904381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:56,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882540542] [2025-01-09 21:33:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:56,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:56,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:56,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:57,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-01-09 21:33:57,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1470 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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:33:57,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:57,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-01-09 21:33:57,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,016 INFO L124 PetriNetUnfolderBase]: 4627/22163 cut-off events. [2025-01-09 21:34:00,017 INFO L125 PetriNetUnfolderBase]: For 5492/8049 co-relation queries the response was YES. [2025-01-09 21:34:00,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36861 conditions, 22163 events. 4627/22163 cut-off events. For 5492/8049 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 267308 event pairs, 1255 based on Foata normal form. 57/20417 useless extension candidates. Maximal degree in co-relation 36804. Up to 5415 conditions per place. [2025-01-09 21:34:00,215 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 85 selfloop transitions, 110 changer transitions 0/629 dead transitions. [2025-01-09 21:34:00,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 629 transitions, 2432 flow [2025-01-09 21:34:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-01-09 21:34:00,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-01-09 21:34:00,218 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1470 flow. Second operand 6 states and 2767 transitions. [2025-01-09 21:34:00,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 629 transitions, 2432 flow [2025-01-09 21:34:00,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 629 transitions, 2432 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:00,241 INFO L231 Difference]: Finished difference. Result has 474 places, 621 transitions, 2528 flow [2025-01-09 21:34:00,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2528, PETRI_PLACES=474, PETRI_TRANSITIONS=621} [2025-01-09 21:34:00,241 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 2 predicate places. [2025-01-09 21:34:00,242 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 621 transitions, 2528 flow [2025-01-09 21:34:00,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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:34:00,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,243 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] [2025-01-09 21:34:00,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:34:00,243 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:34:00,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1045440216, now seen corresponding path program 1 times [2025-01-09 21:34:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224456289] [2025-01-09 21:34:00,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 21:34:00,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 21:34:00,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,726 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:34:00,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224456289] [2025-01-09 21:34:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224456289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783070649] [2025-01-09 21:34:00,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:00,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:01,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-01-09 21:34:01,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 621 transitions, 2528 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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:34:01,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-01-09 21:34:01,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:04,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L67-1-->L67-2: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][355], [579#(= |#race~B~0| 0), 592#true, Black: 577#true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 583#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0), 239#L67-2true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 504#(= |#race~N~0| 0), Black: 543#(<= ~N~0 0), 173#L51-2true, Black: 544#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), 140#L62true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 581#true, 207#L89-4true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-01-09 21:34:04,776 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-01-09 21:34:04,776 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-01-09 21:34:04,776 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-01-09 21:34:04,776 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-01-09 21:34:05,877 INFO L124 PetriNetUnfolderBase]: 6954/31115 cut-off events. [2025-01-09 21:34:05,877 INFO L125 PetriNetUnfolderBase]: For 23428/33936 co-relation queries the response was YES. [2025-01-09 21:34:06,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61286 conditions, 31115 events. 6954/31115 cut-off events. For 23428/33936 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 394612 event pairs, 1661 based on Foata normal form. 203/29017 useless extension candidates. Maximal degree in co-relation 61224. Up to 7756 conditions per place. [2025-01-09 21:34:06,204 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 187 selfloop transitions, 215 changer transitions 0/838 dead transitions. [2025-01-09 21:34:06,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 838 transitions, 5026 flow [2025-01-09 21:34:06,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-01-09 21:34:06,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-01-09 21:34:06,209 INFO L175 Difference]: Start difference. First operand has 474 places, 621 transitions, 2528 flow. Second operand 6 states and 2767 transitions. [2025-01-09 21:34:06,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 838 transitions, 5026 flow [2025-01-09 21:34:06,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 838 transitions, 5026 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:06,256 INFO L231 Difference]: Finished difference. Result has 484 places, 830 transitions, 5178 flow [2025-01-09 21:34:06,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5178, PETRI_PLACES=484, PETRI_TRANSITIONS=830} [2025-01-09 21:34:06,257 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 12 predicate places. [2025-01-09 21:34:06,258 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 830 transitions, 5178 flow [2025-01-09 21:34:06,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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:34:06,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:06,259 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] [2025-01-09 21:34:06,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:34:06,259 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:34:06,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 820983429, now seen corresponding path program 1 times [2025-01-09 21:34:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021792435] [2025-01-09 21:34:06,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:06,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:34:06,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:34:06,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:06,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:06,730 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:34:06,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:06,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021792435] [2025-01-09 21:34:06,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021792435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:06,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:06,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:06,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746468670] [2025-01-09 21:34:06,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:06,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:06,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:06,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:06,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:07,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-01-09 21:34:07,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 830 transitions, 5178 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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:34:07,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:07,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-01-09 21:34:07,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:13,638 INFO L124 PetriNetUnfolderBase]: 10076/38698 cut-off events. [2025-01-09 21:34:13,638 INFO L125 PetriNetUnfolderBase]: For 72732/81471 co-relation queries the response was YES. [2025-01-09 21:34:13,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93348 conditions, 38698 events. 10076/38698 cut-off events. For 72732/81471 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 497200 event pairs, 1689 based on Foata normal form. 670/36722 useless extension candidates. Maximal degree in co-relation 93281. Up to 11029 conditions per place. [2025-01-09 21:34:14,094 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 382 selfloop transitions, 495 changer transitions 0/1319 dead transitions. [2025-01-09 21:34:14,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 1319 transitions, 12054 flow [2025-01-09 21:34:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-01-09 21:34:14,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-01-09 21:34:14,098 INFO L175 Difference]: Start difference. First operand has 484 places, 830 transitions, 5178 flow. Second operand 6 states and 2767 transitions. [2025-01-09 21:34:14,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 1319 transitions, 12054 flow [2025-01-09 21:34:14,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 1319 transitions, 12054 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:14,235 INFO L231 Difference]: Finished difference. Result has 494 places, 1311 transitions, 12524 flow [2025-01-09 21:34:14,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=5178, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12524, PETRI_PLACES=494, PETRI_TRANSITIONS=1311} [2025-01-09 21:34:14,236 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 22 predicate places. [2025-01-09 21:34:14,236 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 1311 transitions, 12524 flow [2025-01-09 21:34:14,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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:34:14,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:14,236 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] [2025-01-09 21:34:14,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:34:14,237 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:34:14,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1743473024, now seen corresponding path program 1 times [2025-01-09 21:34:14,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:14,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304056268] [2025-01-09 21:34:14,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:14,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:14,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 21:34:14,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 21:34:14,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:14,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:14,708 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:34:14,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:14,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304056268] [2025-01-09 21:34:14,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304056268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:14,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:14,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:14,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067110765] [2025-01-09 21:34:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:14,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:14,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:14,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:14,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:15,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 506 [2025-01-09 21:34:15,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1311 transitions, 12524 flow. Second operand has 6 states, 6 states have (on average 419.1666666666667) internal successors, (2515), 6 states have internal predecessors, (2515), 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:34:15,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:15,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 506 [2025-01-09 21:34:15,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:29,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L67-1-->L67-2: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][353], [579#(= |#race~B~0| 0), 592#true, Black: 577#true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 583#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0), 239#L67-2true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 526#true, 525#(= |#race~M~0| 0), 603#true, Black: 530#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 566#true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~B~0.offset)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), Black: 543#(<= ~N~0 0), 173#L51-2true, Black: 544#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), 140#L62true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 581#true, 207#L89-4true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-01-09 21:34:29,793 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-01-09 21:34:29,793 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-01-09 21:34:29,793 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-01-09 21:34:29,793 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-01-09 21:34:35,063 INFO L124 PetriNetUnfolderBase]: 40929/100034 cut-off events. [2025-01-09 21:34:35,063 INFO L125 PetriNetUnfolderBase]: For 188633/192440 co-relation queries the response was YES. [2025-01-09 21:34:36,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281372 conditions, 100034 events. 40929/100034 cut-off events. For 188633/192440 co-relation queries the response was YES. Maximal size of possible extension queue 2200. Compared 1217050 event pairs, 16417 based on Foata normal form. 702/93539 useless extension candidates. Maximal degree in co-relation 281300. Up to 57622 conditions per place. [2025-01-09 21:34:36,614 INFO L140 encePairwiseOnDemand]: 475/506 looper letters, 890 selfloop transitions, 229 changer transitions 0/1521 dead transitions. [2025-01-09 21:34:36,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 1521 transitions, 16342 flow [2025-01-09 21:34:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2693 transitions. [2025-01-09 21:34:36,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870223978919631 [2025-01-09 21:34:36,617 INFO L175 Difference]: Start difference. First operand has 494 places, 1311 transitions, 12524 flow. Second operand 6 states and 2693 transitions. [2025-01-09 21:34:36,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 1521 transitions, 16342 flow [2025-01-09 21:34:37,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 1521 transitions, 16342 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:37,700 INFO L231 Difference]: Finished difference. Result has 503 places, 1502 transitions, 14919 flow [2025-01-09 21:34:37,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=12524, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14919, PETRI_PLACES=503, PETRI_TRANSITIONS=1502} [2025-01-09 21:34:37,701 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 31 predicate places. [2025-01-09 21:34:37,701 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 1502 transitions, 14919 flow [2025-01-09 21:34:37,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 419.1666666666667) internal successors, (2515), 6 states have internal predecessors, (2515), 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:34:37,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:37,702 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] [2025-01-09 21:34:37,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:34:37,703 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:34:37,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1850592618, now seen corresponding path program 1 times [2025-01-09 21:34:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:37,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-01-09 21:34:37,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:37,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 21:34:37,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 21:34:37,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:37,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:37,991 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:34:37,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-01-09 21:34:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731928131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516458736] [2025-01-09 21:34:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:37,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:37,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:37,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:38,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 506 [2025-01-09 21:34:38,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 1502 transitions, 14919 flow. Second operand has 6 states, 6 states have (on average 419.3333333333333) internal successors, (2516), 6 states have internal predecessors, (2516), 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:34:38,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:38,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 506 [2025-01-09 21:34:38,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:39,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] L67-9-->L67-10: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][399], [Black: 566#true, 579#(= |#race~B~0| 0), 543#(<= ~N~0 0), 592#true, Black: 577#true, 79#L59-10true, 426#L67-10true, 624#true, Black: 583#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0), Black: 585#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), Black: 530#true, 603#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 608#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~B~0.offset)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), 110#$Ultimate##0true, Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 544#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 586#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), 536#(= |#race~C2~0| 0), 526#true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 207#L89-4true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)]) [2025-01-09 21:34:39,456 INFO L294 olderBase$Statistics]: this new event has 269 ancestors and is cut-off event [2025-01-09 21:34:39,456 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-01-09 21:34:39,456 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:34:39,456 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-01-09 21:34:39,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1225] L67-4-->L67-5: Formula: (= (store |v_#race_62| v_~A~0.base_16 (store (select |v_#race_62| v_~A~0.base_16) (+ (* v_thread3Thread1of1ForFork2_~i~2_11 4) v_~A~0.offset_16) 0)) |v_#race_61|) InVars {#race=|v_#race_62|, ~A~0.base=v_~A~0.base_16, ~A~0.offset=v_~A~0.offset_16, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{#race=|v_#race_61|, ~A~0.base=v_~A~0.base_16, ~A~0.offset=v_~A~0.offset_16, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} AuxVars[] AssignedVars[#race][409], [579#(= |#race~B~0| 0), 543#(<= ~N~0 0), 583#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0), Black: 577#true, 592#true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), 624#true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), 603#true, Black: 530#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 566#true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~B~0.offset)) 0)), 614#true, 368#L59-24true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), 298#L67-5true, Black: 605#(= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), 110#$Ultimate##0true, Black: 544#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 536#(= |#race~C2~0| 0), 526#true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 207#L89-4true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-01-09 21:34:39,825 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2025-01-09 21:34:39,825 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:34:39,825 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-01-09 21:34:39,825 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:34:39,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1231] L67-9-->L67-10: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][399], [Black: 566#true, 579#(= |#race~B~0| 0), 543#(<= ~N~0 0), Black: 577#true, 592#true, 79#L59-10true, 426#L67-10true, Black: 583#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0), 624#true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), 603#true, Black: 530#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 608#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~B~0.offset)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), 386#L90-1true, Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 544#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 586#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), 536#(= |#race~C2~0| 0), 526#true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)]) [2025-01-09 21:34:39,874 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2025-01-09 21:34:39,874 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:34:39,874 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:34:39,874 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:34:40,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1225] L67-4-->L67-5: Formula: (= (store |v_#race_62| v_~A~0.base_16 (store (select |v_#race_62| v_~A~0.base_16) (+ (* v_thread3Thread1of1ForFork2_~i~2_11 4) v_~A~0.offset_16) 0)) |v_#race_61|) InVars {#race=|v_#race_62|, ~A~0.base=v_~A~0.base_16, ~A~0.offset=v_~A~0.offset_16, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} OutVars{#race=|v_#race_61|, ~A~0.base=v_~A~0.base_16, ~A~0.offset=v_~A~0.offset_16, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_11} AuxVars[] AssignedVars[#race][409], [579#(= |#race~B~0| 0), 543#(<= ~N~0 0), 583#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0), 592#true, Black: 577#true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), 624#true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), Black: 530#true, 603#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 566#true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~B~0.offset)) 0)), 614#true, 368#L59-24true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), 298#L67-5true, Black: 605#(= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~B~0.offset)) 0)), 386#L90-1true, Black: 544#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 536#(= |#race~C2~0| 0), 526#true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-01-09 21:34:40,244 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-01-09 21:34:40,244 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:34:40,244 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:34:40,244 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event