./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-simple-array-sum.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-simple-array-sum.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 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:56,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:56,467 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:56,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:56,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:56,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:56,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:56,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:56,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:56,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:56,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:56,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:56,497 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:56,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:56,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:56,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:56,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:56,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:56,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:56,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:56,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:56,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:56,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:56,500 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 -> 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 [2025-01-09 21:33:56,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:56,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:56,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:56,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:56,753 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:56,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-01-09 21:33:57,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c107c33df/0128e75be90c427e9ab9078ee26d839c/FLAG6d94a754e [2025-01-09 21:33:58,158 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:58,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-01-09 21:33:58,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c107c33df/0128e75be90c427e9ab9078ee26d839c/FLAG6d94a754e [2025-01-09 21:33:58,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c107c33df/0128e75be90c427e9ab9078ee26d839c [2025-01-09 21:33:58,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:58,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:58,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:58,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:58,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:58,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:58" (1/1) ... [2025-01-09 21:33:58,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3b5a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:58, skipping insertion in model container [2025-01-09 21:33:58,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:58" (1/1) ... [2025-01-09 21:33:58,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:58,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:58,787 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:58,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:58,826 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:58,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:58 WrapperNode [2025-01-09 21:33:58,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:58,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:58,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:58,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:58,832 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:58" (1/1) ... [2025-01-09 21:33:58,840 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:58" (1/1) ... [2025-01-09 21:33:58,863 INFO L138 Inliner]: procedures = 23, calls = 21, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 125 [2025-01-09 21:33:58,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:58,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:58,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:58,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:58,871 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:58" (1/1) ... [2025-01-09 21:33:58,871 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:58" (1/1) ... [2025-01-09 21:33:58,878 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:58" (1/1) ... [2025-01-09 21:33:58,880 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:58" (1/1) ... [2025-01-09 21:33:58,888 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:58" (1/1) ... [2025-01-09 21:33:58,889 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:58" (1/1) ... [2025-01-09 21:33:58,897 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:58" (1/1) ... [2025-01-09 21:33:58,902 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:58" (1/1) ... [2025-01-09 21:33:58,902 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:58" (1/1) ... [2025-01-09 21:33:58,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:58,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:58,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:58,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:58,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:58" (1/1) ... [2025-01-09 21:33:58,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:58,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:58,950 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:58,953 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:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:58,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:58,987 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:59,072 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:59,074 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:59,291 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:59,292 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:59,307 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:59,307 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:59,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:59 BoogieIcfgContainer [2025-01-09 21:33:59,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:59,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:59,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:59,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:59,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:58" (1/3) ... [2025-01-09 21:33:59,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274ca0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:59, skipping insertion in model container [2025-01-09 21:33:59,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:58" (2/3) ... [2025-01-09 21:33:59,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274ca0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:59, skipping insertion in model container [2025-01-09 21:33:59,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:59" (3/3) ... [2025-01-09 21:33:59,314 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-01-09 21:33:59,323 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:59,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 228 locations, 1 initial locations, 5 loop locations, and 16 error locations. [2025-01-09 21:33:59,324 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:59,389 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:59,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 241 transitions, 503 flow [2025-01-09 21:33:59,469 INFO L124 PetriNetUnfolderBase]: 14/238 cut-off events. [2025-01-09 21:33:59,471 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:59,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 238 events. 14/238 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 299 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 191. Up to 3 conditions per place. [2025-01-09 21:33:59,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 241 transitions, 503 flow [2025-01-09 21:33:59,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 218 places, 221 transitions, 460 flow [2025-01-09 21:33:59,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:59,493 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;@65721a6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:59,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-09 21:33:59,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:59,498 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:33:59,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:59,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,498 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:59,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:33:59,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1009169995, now seen corresponding path program 1 times [2025-01-09 21:33:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091976825] [2025-01-09 21:33:59,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:33:59,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:33:59,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,608 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:59,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091976825] [2025-01-09 21:33:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091976825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495590717] [2025-01-09 21:33:59,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 241 [2025-01-09 21:33:59,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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:59,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 241 [2025-01-09 21:33:59,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,835 INFO L124 PetriNetUnfolderBase]: 114/739 cut-off events. [2025-01-09 21:33:59,835 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 21:33:59,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 739 events. 114/739 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4165 event pairs, 78 based on Foata normal form. 4/624 useless extension candidates. Maximal degree in co-relation 775. Up to 182 conditions per place. [2025-01-09 21:33:59,845 INFO L140 encePairwiseOnDemand]: 231/241 looper letters, 19 selfloop transitions, 2 changer transitions 4/213 dead transitions. [2025-01-09 21:33:59,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 486 flow [2025-01-09 21:33:59,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-01-09 21:33:59,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9073305670816044 [2025-01-09 21:33:59,864 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 460 flow. Second operand 3 states and 656 transitions. [2025-01-09 21:33:59,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 486 flow [2025-01-09 21:33:59,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 213 transitions, 474 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:59,872 INFO L231 Difference]: Finished difference. Result has 213 places, 209 transitions, 428 flow [2025-01-09 21:33:59,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=213, PETRI_TRANSITIONS=209} [2025-01-09 21:33:59,877 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -5 predicate places. [2025-01-09 21:33:59,877 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 209 transitions, 428 flow [2025-01-09 21:33:59,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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:59,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,878 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] [2025-01-09 21:33:59,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:59,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:33:59,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1054895249, now seen corresponding path program 1 times [2025-01-09 21:33:59,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132461217] [2025-01-09 21:33:59,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 21:33:59,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 21:33:59,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,921 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:59,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132461217] [2025-01-09 21:33:59,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132461217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154471742] [2025-01-09 21:33:59,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 241 [2025-01-09 21:33:59,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 209 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 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:59,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 241 [2025-01-09 21:33:59,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,113 INFO L124 PetriNetUnfolderBase]: 272/1184 cut-off events. [2025-01-09 21:34:00,113 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:34:00,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 1184 events. 272/1184 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7936 event pairs, 173 based on Foata normal form. 1/1011 useless extension candidates. Maximal degree in co-relation 1564. Up to 380 conditions per place. [2025-01-09 21:34:00,119 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 20 selfloop transitions, 1 changer transitions 2/203 dead transitions. [2025-01-09 21:34:00,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 203 transitions, 460 flow [2025-01-09 21:34:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2025-01-09 21:34:00,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8810511756569848 [2025-01-09 21:34:00,122 INFO L175 Difference]: Start difference. First operand has 213 places, 209 transitions, 428 flow. Second operand 3 states and 637 transitions. [2025-01-09 21:34:00,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 203 transitions, 460 flow [2025-01-09 21:34:00,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 203 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:00,125 INFO L231 Difference]: Finished difference. Result has 203 places, 201 transitions, 410 flow [2025-01-09 21:34:00,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=203, PETRI_TRANSITIONS=201} [2025-01-09 21:34:00,126 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -15 predicate places. [2025-01-09 21:34:00,126 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 201 transitions, 410 flow [2025-01-09 21:34:00,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 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,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,126 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] [2025-01-09 21:34:00,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:34:00,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:34:00,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1505149018, now seen corresponding path program 1 times [2025-01-09 21:34:00,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612243438] [2025-01-09 21:34:00,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:34:00,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:34:00,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,181 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,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612243438] [2025-01-09 21:34:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612243438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343041439] [2025-01-09 21:34:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 241 [2025-01-09 21:34:00,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 201 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 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,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 241 [2025-01-09 21:34:00,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,262 INFO L124 PetriNetUnfolderBase]: 87/645 cut-off events. [2025-01-09 21:34:00,262 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:34:00,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 645 events. 87/645 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3260 event pairs, 53 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 752. Up to 117 conditions per place. [2025-01-09 21:34:00,266 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 15 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2025-01-09 21:34:00,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 200 transitions, 442 flow [2025-01-09 21:34:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2025-01-09 21:34:00,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087136929460581 [2025-01-09 21:34:00,267 INFO L175 Difference]: Start difference. First operand has 203 places, 201 transitions, 410 flow. Second operand 3 states and 657 transitions. [2025-01-09 21:34:00,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 200 transitions, 442 flow [2025-01-09 21:34:00,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 200 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:00,270 INFO L231 Difference]: Finished difference. Result has 201 places, 200 transitions, 411 flow [2025-01-09 21:34:00,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=201, PETRI_TRANSITIONS=200} [2025-01-09 21:34:00,271 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -17 predicate places. [2025-01-09 21:34:00,271 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 200 transitions, 411 flow [2025-01-09 21:34:00,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 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,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,272 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] [2025-01-09 21:34:00,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:34:00,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:34:00,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1659355407, now seen corresponding path program 1 times [2025-01-09 21:34:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158895719] [2025-01-09 21:34:00,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:34:00,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:34:00,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,381 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,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158895719] [2025-01-09 21:34:00,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158895719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261252627] [2025-01-09 21:34:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 241 [2025-01-09 21:34:00,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 200 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 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,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 241 [2025-01-09 21:34:00,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,482 INFO L124 PetriNetUnfolderBase]: 74/490 cut-off events. [2025-01-09 21:34:00,482 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:34:00,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 490 events. 74/490 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2116 event pairs, 53 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 596. Up to 119 conditions per place. [2025-01-09 21:34:00,485 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 15 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2025-01-09 21:34:00,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 199 transitions, 443 flow [2025-01-09 21:34:00,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2025-01-09 21:34:00,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087136929460581 [2025-01-09 21:34:00,487 INFO L175 Difference]: Start difference. First operand has 201 places, 200 transitions, 411 flow. Second operand 3 states and 657 transitions. [2025-01-09 21:34:00,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 199 transitions, 443 flow [2025-01-09 21:34:00,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 199 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:00,491 INFO L231 Difference]: Finished difference. Result has 200 places, 199 transitions, 409 flow [2025-01-09 21:34:00,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=200, PETRI_TRANSITIONS=199} [2025-01-09 21:34:00,492 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -18 predicate places. [2025-01-09 21:34:00,492 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 199 transitions, 409 flow [2025-01-09 21:34:00,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 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,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:00,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:34:00,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:34:00,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash -675552358, now seen corresponding path program 1 times [2025-01-09 21:34:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116535011] [2025-01-09 21:34:00,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:34:00,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:34:00,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,562 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,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116535011] [2025-01-09 21:34:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116535011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410160737] [2025-01-09 21:34:00,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 241 [2025-01-09 21:34:00,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 199 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:00,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 241 [2025-01-09 21:34:00,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,641 INFO L124 PetriNetUnfolderBase]: 118/787 cut-off events. [2025-01-09 21:34:00,642 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:34:00,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 787 events. 118/787 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4400 event pairs, 36 based on Foata normal form. 1/687 useless extension candidates. Maximal degree in co-relation 953. Up to 97 conditions per place. [2025-01-09 21:34:00,646 INFO L140 encePairwiseOnDemand]: 236/241 looper letters, 15 selfloop transitions, 2 changer transitions 2/202 dead transitions. [2025-01-09 21:34:00,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 202 transitions, 455 flow [2025-01-09 21:34:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2025-01-09 21:34:00,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.921161825726141 [2025-01-09 21:34:00,647 INFO L175 Difference]: Start difference. First operand has 200 places, 199 transitions, 409 flow. Second operand 3 states and 666 transitions. [2025-01-09 21:34:00,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 202 transitions, 455 flow [2025-01-09 21:34:00,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 202 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:00,650 INFO L231 Difference]: Finished difference. Result has 198 places, 195 transitions, 400 flow [2025-01-09 21:34:00,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=198, PETRI_TRANSITIONS=195} [2025-01-09 21:34:00,651 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -20 predicate places. [2025-01-09 21:34:00,651 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 195 transitions, 400 flow [2025-01-09 21:34:00,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:00,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,651 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] [2025-01-09 21:34:00,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:34:00,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:34:00,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash -665735140, now seen corresponding path program 1 times [2025-01-09 21:34:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870140166] [2025-01-09 21:34:00,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:34:00,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:34:00,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,699 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,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870140166] [2025-01-09 21:34:00,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870140166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57279816] [2025-01-09 21:34:00,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 241 [2025-01-09 21:34:00,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 241 [2025-01-09 21:34:00,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,781 INFO L124 PetriNetUnfolderBase]: 139/685 cut-off events. [2025-01-09 21:34:00,781 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:34:00,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 685 events. 139/685 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3599 event pairs, 26 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 911. Up to 205 conditions per place. [2025-01-09 21:34:00,784 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 19 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2025-01-09 21:34:00,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 200 transitions, 456 flow [2025-01-09 21:34:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2025-01-09 21:34:00,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239280774550485 [2025-01-09 21:34:00,786 INFO L175 Difference]: Start difference. First operand has 198 places, 195 transitions, 400 flow. Second operand 3 states and 668 transitions. [2025-01-09 21:34:00,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 200 transitions, 456 flow [2025-01-09 21:34:00,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 200 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:00,789 INFO L231 Difference]: Finished difference. Result has 195 places, 195 transitions, 406 flow [2025-01-09 21:34:00,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=195, PETRI_TRANSITIONS=195} [2025-01-09 21:34:00,790 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -23 predicate places. [2025-01-09 21:34:00,790 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 195 transitions, 406 flow [2025-01-09 21:34:00,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,791 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] [2025-01-09 21:34:00,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:34:00,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:34:00,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1808083865, now seen corresponding path program 1 times [2025-01-09 21:34:00,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833171841] [2025-01-09 21:34:00,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:34:00,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:34:00,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,844 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,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833171841] [2025-01-09 21:34:00,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833171841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236360141] [2025-01-09 21:34:00,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 241 [2025-01-09 21:34:00,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 195 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 241 [2025-01-09 21:34:00,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,959 INFO L124 PetriNetUnfolderBase]: 244/1018 cut-off events. [2025-01-09 21:34:00,960 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-09 21:34:00,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1018 events. 244/1018 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6139 event pairs, 56 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1365. Up to 311 conditions per place. [2025-01-09 21:34:00,965 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 18 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2025-01-09 21:34:00,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 199 transitions, 457 flow [2025-01-09 21:34:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-01-09 21:34:00,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225449515905948 [2025-01-09 21:34:00,967 INFO L175 Difference]: Start difference. First operand has 195 places, 195 transitions, 406 flow. Second operand 3 states and 667 transitions. [2025-01-09 21:34:00,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 199 transitions, 457 flow [2025-01-09 21:34:00,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 199 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:00,970 INFO L231 Difference]: Finished difference. Result has 196 places, 195 transitions, 416 flow [2025-01-09 21:34:00,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=196, PETRI_TRANSITIONS=195} [2025-01-09 21:34:00,971 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -22 predicate places. [2025-01-09 21:34:00,971 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 195 transitions, 416 flow [2025-01-09 21:34:00,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,971 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] [2025-01-09 21:34:00,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:34:00,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:34:00,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1498487106, now seen corresponding path program 1 times [2025-01-09 21:34:00,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654613054] [2025-01-09 21:34:00,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:34:00,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:34:00,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,025 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:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654613054] [2025-01-09 21:34:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654613054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486407021] [2025-01-09 21:34:01,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 241 [2025-01-09 21:34:01,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 195 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 241 [2025-01-09 21:34:01,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,135 INFO L124 PetriNetUnfolderBase]: 190/947 cut-off events. [2025-01-09 21:34:01,135 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:01,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 947 events. 190/947 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6105 event pairs, 89 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1294. Up to 197 conditions per place. [2025-01-09 21:34:01,138 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 0 selfloop transitions, 0 changer transitions 199/199 dead transitions. [2025-01-09 21:34:01,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 199 transitions, 464 flow [2025-01-09 21:34:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-01-09 21:34:01,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9197786998616874 [2025-01-09 21:34:01,140 INFO L175 Difference]: Start difference. First operand has 196 places, 195 transitions, 416 flow. Second operand 3 states and 665 transitions. [2025-01-09 21:34:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 199 transitions, 464 flow [2025-01-09 21:34:01,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 199 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:01,142 INFO L231 Difference]: Finished difference. Result has 197 places, 0 transitions, 0 flow [2025-01-09 21:34:01,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=197, PETRI_TRANSITIONS=0} [2025-01-09 21:34:01,143 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -21 predicate places. [2025-01-09 21:34:01,143 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 0 transitions, 0 flow [2025-01-09 21:34:01,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2025-01-09 21:34:01,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2025-01-09 21:34:01,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2025-01-09 21:34:01,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2025-01-09 21:34:01,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2025-01-09 21:34:01,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2025-01-09 21:34:01,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:34:01,148 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:01,151 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:34:01,151 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:34:01,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:34:01 BasicIcfg [2025-01-09 21:34:01,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:34:01,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:34:01,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:34:01,155 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:34:01,156 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:59" (3/4) ... [2025-01-09 21:34:01,157 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:34:01,159 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:34:01,159 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:34:01,159 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:34:01,162 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-01-09 21:34:01,162 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:34:01,162 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:34:01,162 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:34:01,213 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:34:01,214 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:34:01,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:34:01,214 INFO L158 Benchmark]: Toolchain (without parser) took 2727.68ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 125.2MB in the beginning and 232.1MB in the end (delta: -106.9MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2025-01-09 21:34:01,215 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:01,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.83ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 112.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:01,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.35ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:01,215 INFO L158 Benchmark]: Boogie Preprocessor took 38.28ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:01,215 INFO L158 Benchmark]: RCFGBuilder took 403.77ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 88.6MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:34:01,216 INFO L158 Benchmark]: TraceAbstraction took 1845.40ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 87.9MB in the beginning and 239.0MB in the end (delta: -151.2MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. [2025-01-09 21:34:01,216 INFO L158 Benchmark]: Witness Printer took 59.02ms. Allocated memory is still 419.4MB. Free memory was 239.0MB in the beginning and 232.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:01,217 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.83ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 112.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.35ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.28ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 403.77ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 88.6MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1845.40ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 87.9MB in the beginning and 239.0MB in the end (delta: -151.2MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. * Witness Printer took 59.02ms. Allocated memory is still 419.4MB. Free memory was 239.0MB in the beginning and 232.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 300 locations, 28 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 68 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 629 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 621 ConstructedInterpolants, 0 QuantifiedInterpolants, 637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:34:01,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE