./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.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 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:39,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:39,321 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:39,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:39,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:39,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:39,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:39,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:39,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:39,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:39,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:39,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:39,339 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:39,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:39,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:39,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:39,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:39,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:39,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:39,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:39,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:39,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:39,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:39,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:39,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:39,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:39,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:39,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:39,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:39,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:39,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:39,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:39,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:39,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:39,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:39,342 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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2025-01-09 21:33:39,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:39,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:39,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:39,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:39,509 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:39,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-01-09 21:33:40,706 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed63a1aaf/5f025b3c4b654bf2a7f3ed726b4c356b/FLAG5d1b68112 [2025-01-09 21:33:40,953 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:40,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-01-09 21:33:40,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed63a1aaf/5f025b3c4b654bf2a7f3ed726b4c356b/FLAG5d1b68112 [2025-01-09 21:33:41,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed63a1aaf/5f025b3c4b654bf2a7f3ed726b4c356b [2025-01-09 21:33:41,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:41,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:41,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:41,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:41,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:41,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:41" (1/1) ... [2025-01-09 21:33:41,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb21166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:41, skipping insertion in model container [2025-01-09 21:33:41,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:41" (1/1) ... [2025-01-09 21:33:41,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:41,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:41,449 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:41,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:41,486 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:41,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:41 WrapperNode [2025-01-09 21:33:41,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:41,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:41,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:41,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:41,493 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:41" (1/1) ... [2025-01-09 21:33:41,501 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:41" (1/1) ... [2025-01-09 21:33:41,519 INFO L138 Inliner]: procedures = 24, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-01-09 21:33:41,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:41,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:41,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:41,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:41,529 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:41" (1/1) ... [2025-01-09 21:33:41,529 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:41" (1/1) ... [2025-01-09 21:33:41,531 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:41" (1/1) ... [2025-01-09 21:33:41,531 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:41" (1/1) ... [2025-01-09 21:33:41,536 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:41" (1/1) ... [2025-01-09 21:33:41,537 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:41" (1/1) ... [2025-01-09 21:33:41,540 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:41" (1/1) ... [2025-01-09 21:33:41,543 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:41" (1/1) ... [2025-01-09 21:33:41,544 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:41" (1/1) ... [2025-01-09 21:33:41,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:41,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:41,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:41,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:41,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:41" (1/1) ... [2025-01-09 21:33:41,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:41,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:41,595 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:41,597 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:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:41,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:41,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:41,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:41,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:41,615 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:41,688 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:41,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:41,949 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:41,949 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:41,958 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:41,959 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:41,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:41 BoogieIcfgContainer [2025-01-09 21:33:41,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:41,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:41,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:41,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:41,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:41" (1/3) ... [2025-01-09 21:33:41,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dce05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:41, skipping insertion in model container [2025-01-09 21:33:41,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:41" (2/3) ... [2025-01-09 21:33:41,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dce05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:41, skipping insertion in model container [2025-01-09 21:33:41,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:41" (3/3) ... [2025-01-09 21:33:41,965 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-01-09 21:33:41,974 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:41,975 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sum-array-hom.wvr.c that has 4 procedures, 256 locations, 1 initial locations, 4 loop locations, and 27 error locations. [2025-01-09 21:33:41,975 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:42,060 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:42,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 267 transitions, 555 flow [2025-01-09 21:33:42,188 INFO L124 PetriNetUnfolderBase]: 12/264 cut-off events. [2025-01-09 21:33:42,192 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:42,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 264 events. 12/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 200. Up to 2 conditions per place. [2025-01-09 21:33:42,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 267 transitions, 555 flow [2025-01-09 21:33:42,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 247 transitions, 512 flow [2025-01-09 21:33:42,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:42,223 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;@1483444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:42,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-09 21:33:42,229 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:42,229 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:33:42,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:42,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:42,229 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:42,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:42,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:42,233 INFO L85 PathProgramCache]: Analyzing trace with hash -152562962, now seen corresponding path program 1 times [2025-01-09 21:33:42,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:42,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742777324] [2025-01-09 21:33:42,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:42,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:42,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:33:42,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:33:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:42,345 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:42,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:42,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742777324] [2025-01-09 21:33:42,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742777324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:42,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:42,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:42,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679487408] [2025-01-09 21:33:42,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:42,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:42,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:42,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:42,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:42,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 267 [2025-01-09 21:33:42,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 247 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:42,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:42,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 267 [2025-01-09 21:33:42,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:42,563 INFO L124 PetriNetUnfolderBase]: 19/449 cut-off events. [2025-01-09 21:33:42,563 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-09 21:33:42,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 449 events. 19/449 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1618 event pairs, 7 based on Foata normal form. 15/389 useless extension candidates. Maximal degree in co-relation 311. Up to 31 conditions per place. [2025-01-09 21:33:42,570 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 13 selfloop transitions, 2 changer transitions 3/240 dead transitions. [2025-01-09 21:33:42,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 528 flow [2025-01-09 21:33:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-01-09 21:33:42,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9338327091136079 [2025-01-09 21:33:42,584 INFO L175 Difference]: Start difference. First operand has 246 places, 247 transitions, 512 flow. Second operand 3 states and 748 transitions. [2025-01-09 21:33:42,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 528 flow [2025-01-09 21:33:42,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 240 transitions, 516 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:42,592 INFO L231 Difference]: Finished difference. Result has 241 places, 237 transitions, 484 flow [2025-01-09 21:33:42,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=241, PETRI_TRANSITIONS=237} [2025-01-09 21:33:42,596 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -5 predicate places. [2025-01-09 21:33:42,596 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 237 transitions, 484 flow [2025-01-09 21:33:42,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:42,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:42,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:42,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:42,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:42,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:42,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1308600173, now seen corresponding path program 1 times [2025-01-09 21:33:42,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:42,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114920474] [2025-01-09 21:33:42,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:42,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:42,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:33:42,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:33:42,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:42,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:42,628 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:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:42,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114920474] [2025-01-09 21:33:42,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114920474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:42,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:42,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:42,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541847067] [2025-01-09 21:33:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:42,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:42,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:42,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:42,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:42,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 267 [2025-01-09 21:33:42,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 237 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:42,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:42,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 267 [2025-01-09 21:33:42,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:42,694 INFO L124 PetriNetUnfolderBase]: 13/339 cut-off events. [2025-01-09 21:33:42,694 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:33:42,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 339 events. 13/339 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1034 event pairs, 5 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 346. Up to 27 conditions per place. [2025-01-09 21:33:42,697 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 13 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2025-01-09 21:33:42,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 236 transitions, 512 flow [2025-01-09 21:33:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-01-09 21:33:42,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9263420724094882 [2025-01-09 21:33:42,699 INFO L175 Difference]: Start difference. First operand has 241 places, 237 transitions, 484 flow. Second operand 3 states and 742 transitions. [2025-01-09 21:33:42,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 236 transitions, 512 flow [2025-01-09 21:33:42,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 236 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:42,703 INFO L231 Difference]: Finished difference. Result has 237 places, 236 transitions, 482 flow [2025-01-09 21:33:42,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=237, PETRI_TRANSITIONS=236} [2025-01-09 21:33:42,704 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -9 predicate places. [2025-01-09 21:33:42,704 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 236 transitions, 482 flow [2025-01-09 21:33:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:42,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:42,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:42,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:42,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:42,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1857264369, now seen corresponding path program 1 times [2025-01-09 21:33:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677660056] [2025-01-09 21:33:42,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:42,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:42,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:33:42,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:33:42,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:42,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:42,737 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:42,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677660056] [2025-01-09 21:33:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677660056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:42,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:42,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:42,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681952057] [2025-01-09 21:33:42,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:42,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:42,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:42,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:42,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:42,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 267 [2025-01-09 21:33:42,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 236 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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:42,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:42,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 267 [2025-01-09 21:33:42,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:42,800 INFO L124 PetriNetUnfolderBase]: 25/432 cut-off events. [2025-01-09 21:33:42,801 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:33:42,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 432 events. 25/432 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1685 event pairs, 12 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 452. Up to 46 conditions per place. [2025-01-09 21:33:42,804 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 14 selfloop transitions, 1 changer transitions 0/232 dead transitions. [2025-01-09 21:33:42,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 232 transitions, 504 flow [2025-01-09 21:33:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-01-09 21:33:42,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225967540574282 [2025-01-09 21:33:42,806 INFO L175 Difference]: Start difference. First operand has 237 places, 236 transitions, 482 flow. Second operand 3 states and 739 transitions. [2025-01-09 21:33:42,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 232 transitions, 504 flow [2025-01-09 21:33:42,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 232 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:42,809 INFO L231 Difference]: Finished difference. Result has 233 places, 232 transitions, 472 flow [2025-01-09 21:33:42,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=233, PETRI_TRANSITIONS=232} [2025-01-09 21:33:42,810 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -13 predicate places. [2025-01-09 21:33:42,810 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 232 transitions, 472 flow [2025-01-09 21:33:42,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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:42,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:42,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:42,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:42,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:42,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash -897436209, now seen corresponding path program 1 times [2025-01-09 21:33:42,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:42,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97242060] [2025-01-09 21:33:42,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:42,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:33:42,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:33:42,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:42,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:42,905 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:42,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97242060] [2025-01-09 21:33:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97242060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:42,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:42,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:42,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373661622] [2025-01-09 21:33:42,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:42,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:42,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:42,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:42,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:42,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 267 [2025-01-09 21:33:42,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 232 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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:42,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:42,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 267 [2025-01-09 21:33:42,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:42,977 INFO L124 PetriNetUnfolderBase]: 24/403 cut-off events. [2025-01-09 21:33:42,977 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:42,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 403 events. 24/403 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1556 event pairs, 15 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 416. Up to 40 conditions per place. [2025-01-09 21:33:42,981 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 12 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2025-01-09 21:33:42,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 231 transitions, 498 flow [2025-01-09 21:33:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 744 transitions. [2025-01-09 21:33:42,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288389513108615 [2025-01-09 21:33:42,983 INFO L175 Difference]: Start difference. First operand has 233 places, 232 transitions, 472 flow. Second operand 3 states and 744 transitions. [2025-01-09 21:33:42,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 231 transitions, 498 flow [2025-01-09 21:33:42,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 231 transitions, 497 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:42,987 INFO L231 Difference]: Finished difference. Result has 233 places, 231 transitions, 473 flow [2025-01-09 21:33:42,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=233, PETRI_TRANSITIONS=231} [2025-01-09 21:33:42,989 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -13 predicate places. [2025-01-09 21:33:42,989 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 231 transitions, 473 flow [2025-01-09 21:33:42,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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:42,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:42,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:42,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:42,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:42,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1084201620, now seen corresponding path program 1 times [2025-01-09 21:33:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:42,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4634797] [2025-01-09 21:33:42,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:42,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:43,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:33:43,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:33:43,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:43,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:43,630 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:43,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4634797] [2025-01-09 21:33:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4634797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:43,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019503471] [2025-01-09 21:33:43,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:43,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:43,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:43,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:43,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 267 [2025-01-09 21:33:43,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 231 transitions, 473 flow. Second operand has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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:43,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:43,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 267 [2025-01-09 21:33:43,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,075 INFO L124 PetriNetUnfolderBase]: 394/2185 cut-off events. [2025-01-09 21:33:44,075 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-09 21:33:44,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 2185 events. 394/2185 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 17754 event pairs, 264 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 2767. Up to 579 conditions per place. [2025-01-09 21:33:44,098 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 26 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2025-01-09 21:33:44,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 533 flow [2025-01-09 21:33:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1394 transitions. [2025-01-09 21:33:44,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8701622971285893 [2025-01-09 21:33:44,108 INFO L175 Difference]: Start difference. First operand has 233 places, 231 transitions, 473 flow. Second operand 6 states and 1394 transitions. [2025-01-09 21:33:44,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 533 flow [2025-01-09 21:33:44,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 230 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:44,113 INFO L231 Difference]: Finished difference. Result has 235 places, 230 transitions, 477 flow [2025-01-09 21:33:44,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=235, PETRI_TRANSITIONS=230} [2025-01-09 21:33:44,115 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -11 predicate places. [2025-01-09 21:33:44,117 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 230 transitions, 477 flow [2025-01-09 21:33:44,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,119 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] [2025-01-09 21:33:44,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:44,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:44,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1332671889, now seen corresponding path program 1 times [2025-01-09 21:33:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067514221] [2025-01-09 21:33:44,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:33:44,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:33:44,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:44,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067514221] [2025-01-09 21:33:44,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067514221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183596426] [2025-01-09 21:33:44,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 267 [2025-01-09 21:33:44,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 230 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 267 [2025-01-09 21:33:44,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,252 INFO L124 PetriNetUnfolderBase]: 37/538 cut-off events. [2025-01-09 21:33:44,252 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:33:44,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 538 events. 37/538 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2441 event pairs, 20 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 591. Up to 56 conditions per place. [2025-01-09 21:33:44,256 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 14 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2025-01-09 21:33:44,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 226 transitions, 499 flow [2025-01-09 21:33:44,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-01-09 21:33:44,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225967540574282 [2025-01-09 21:33:44,259 INFO L175 Difference]: Start difference. First operand has 235 places, 230 transitions, 477 flow. Second operand 3 states and 739 transitions. [2025-01-09 21:33:44,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 226 transitions, 499 flow [2025-01-09 21:33:44,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 489 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:44,263 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 461 flow [2025-01-09 21:33:44,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2025-01-09 21:33:44,265 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -18 predicate places. [2025-01-09 21:33:44,266 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 461 flow [2025-01-09 21:33:44,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,266 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] [2025-01-09 21:33:44,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:44,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:44,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1063901593, now seen corresponding path program 1 times [2025-01-09 21:33:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205947115] [2025-01-09 21:33:44,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:33:44,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:33:44,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205947115] [2025-01-09 21:33:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205947115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24575815] [2025-01-09 21:33:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-01-09 21:33:44,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-01-09 21:33:44,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,378 INFO L124 PetriNetUnfolderBase]: 13/333 cut-off events. [2025-01-09 21:33:44,378 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:33:44,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 333 events. 13/333 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 934 event pairs, 2 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 332. Up to 12 conditions per place. [2025-01-09 21:33:44,380 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 10 selfloop transitions, 3 changer transitions 0/226 dead transitions. [2025-01-09 21:33:44,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 226 transitions, 489 flow [2025-01-09 21:33:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2025-01-09 21:33:44,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9400749063670412 [2025-01-09 21:33:44,382 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 461 flow. Second operand 3 states and 753 transitions. [2025-01-09 21:33:44,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 226 transitions, 489 flow [2025-01-09 21:33:44,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 488 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:44,386 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 462 flow [2025-01-09 21:33:44,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-01-09 21:33:44,386 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -19 predicate places. [2025-01-09 21:33:44,386 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 462 flow [2025-01-09 21:33:44,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,387 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:33:44,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:44,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:44,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 207234491, now seen corresponding path program 1 times [2025-01-09 21:33:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648856633] [2025-01-09 21:33:44,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:33:44,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:33:44,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648856633] [2025-01-09 21:33:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648856633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977039571] [2025-01-09 21:33:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 267 [2025-01-09 21:33:44,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 267 [2025-01-09 21:33:44,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,565 INFO L124 PetriNetUnfolderBase]: 114/1110 cut-off events. [2025-01-09 21:33:44,565 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:33:44,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 1110 events. 114/1110 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7437 event pairs, 22 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 1271. Up to 161 conditions per place. [2025-01-09 21:33:44,569 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 18 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2025-01-09 21:33:44,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 229 transitions, 519 flow [2025-01-09 21:33:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2025-01-09 21:33:44,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9400749063670412 [2025-01-09 21:33:44,571 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 462 flow. Second operand 3 states and 753 transitions. [2025-01-09 21:33:44,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 229 transitions, 519 flow [2025-01-09 21:33:44,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:44,574 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 471 flow [2025-01-09 21:33:44,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2025-01-09 21:33:44,574 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -21 predicate places. [2025-01-09 21:33:44,574 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 471 flow [2025-01-09 21:33:44,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,575 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] [2025-01-09 21:33:44,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:44,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:44,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1185032043, now seen corresponding path program 1 times [2025-01-09 21:33:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527138044] [2025-01-09 21:33:44,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:33:44,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:33:44,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527138044] [2025-01-09 21:33:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527138044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462207832] [2025-01-09 21:33:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-01-09 21:33:44,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-01-09 21:33:44,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([696] thread3EXIT-->L87: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][210], [288#(= |#race~M~0| 0), Black: 292#true, 294#(= |#race~A~0| 0), 276#(= |#race~N~0| 0), 56#L87true, 296#true]) [2025-01-09 21:33:44,660 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-01-09 21:33:44,660 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-01-09 21:33:44,660 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-01-09 21:33:44,660 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-01-09 21:33:44,660 INFO L124 PetriNetUnfolderBase]: 53/542 cut-off events. [2025-01-09 21:33:44,660 INFO L125 PetriNetUnfolderBase]: For 17/27 co-relation queries the response was YES. [2025-01-09 21:33:44,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 542 events. 53/542 cut-off events. For 17/27 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2457 event pairs, 4 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 628. Up to 41 conditions per place. [2025-01-09 21:33:44,663 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 10 selfloop transitions, 3 changer transitions 0/224 dead transitions. [2025-01-09 21:33:44,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 224 transitions, 499 flow [2025-01-09 21:33:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2025-01-09 21:33:44,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9400749063670412 [2025-01-09 21:33:44,665 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 471 flow. Second operand 3 states and 753 transitions. [2025-01-09 21:33:44,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 224 transitions, 499 flow [2025-01-09 21:33:44,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 224 transitions, 499 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:44,667 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 473 flow [2025-01-09 21:33:44,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2025-01-09 21:33:44,668 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -21 predicate places. [2025-01-09 21:33:44,668 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 473 flow [2025-01-09 21:33:44,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,668 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] [2025-01-09 21:33:44,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:44,668 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:44,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash 579442111, now seen corresponding path program 1 times [2025-01-09 21:33:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801119211] [2025-01-09 21:33:44,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:33:44,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:33:44,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:44,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801119211] [2025-01-09 21:33:44,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801119211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:33:44,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078355133] [2025-01-09 21:33:44,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:33:44,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:33:44,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:33:44,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 267 [2025-01-09 21:33:44,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 473 flow. Second operand has 7 states, 7 states have (on average 239.85714285714286) internal successors, (1679), 7 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 267 [2025-01-09 21:33:44,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([696] thread3EXIT-->L87: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][234], [288#(= |#race~M~0| 0), 299#true, Black: 292#true, 294#(= |#race~A~0| 0), 276#(= |#race~N~0| 0), 56#L87true, 296#true]) [2025-01-09 21:33:45,045 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:33:45,045 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:33:45,045 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-01-09 21:33:45,045 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-01-09 21:33:45,045 INFO L124 PetriNetUnfolderBase]: 56/741 cut-off events. [2025-01-09 21:33:45,045 INFO L125 PetriNetUnfolderBase]: For 9/32 co-relation queries the response was YES. [2025-01-09 21:33:45,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 741 events. 56/741 cut-off events. For 9/32 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3637 event pairs, 18 based on Foata normal form. 5/687 useless extension candidates. Maximal degree in co-relation 884. Up to 62 conditions per place. [2025-01-09 21:33:45,051 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 22 selfloop transitions, 14 changer transitions 0/237 dead transitions. [2025-01-09 21:33:45,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 237 transitions, 583 flow [2025-01-09 21:33:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:33:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:33:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2417 transitions. [2025-01-09 21:33:45,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9052434456928838 [2025-01-09 21:33:45,055 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 473 flow. Second operand 10 states and 2417 transitions. [2025-01-09 21:33:45,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 237 transitions, 583 flow [2025-01-09 21:33:45,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 237 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:45,060 INFO L231 Difference]: Finished difference. Result has 236 places, 229 transitions, 533 flow [2025-01-09 21:33:45,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=533, PETRI_PLACES=236, PETRI_TRANSITIONS=229} [2025-01-09 21:33:45,061 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -10 predicate places. [2025-01-09 21:33:45,061 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 229 transitions, 533 flow [2025-01-09 21:33:45,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 239.85714285714286) internal successors, (1679), 7 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:45,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:45,062 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] [2025-01-09 21:33:45,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:45,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:45,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1883461696, now seen corresponding path program 1 times [2025-01-09 21:33:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578696011] [2025-01-09 21:33:45,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:45,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:33:45,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:33:45,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:45,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:45,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578696011] [2025-01-09 21:33:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578696011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053390732] [2025-01-09 21:33:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:45,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:45,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:45,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:45,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-01-09 21:33:45,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 229 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:45,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:45,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-01-09 21:33:45,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,163 INFO L124 PetriNetUnfolderBase]: 91/737 cut-off events. [2025-01-09 21:33:45,163 INFO L125 PetriNetUnfolderBase]: For 54/65 co-relation queries the response was YES. [2025-01-09 21:33:45,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 737 events. 91/737 cut-off events. For 54/65 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3750 event pairs, 7 based on Foata normal form. 4/689 useless extension candidates. Maximal degree in co-relation 919. Up to 78 conditions per place. [2025-01-09 21:33:45,167 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 8 selfloop transitions, 2 changer transitions 6/229 dead transitions. [2025-01-09 21:33:45,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 229 transitions, 559 flow [2025-01-09 21:33:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2025-01-09 21:33:45,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9388264669163545 [2025-01-09 21:33:45,169 INFO L175 Difference]: Start difference. First operand has 236 places, 229 transitions, 533 flow. Second operand 3 states and 752 transitions. [2025-01-09 21:33:45,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 229 transitions, 559 flow [2025-01-09 21:33:45,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 229 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:45,172 INFO L231 Difference]: Finished difference. Result has 235 places, 221 transitions, 516 flow [2025-01-09 21:33:45,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=235, PETRI_TRANSITIONS=221} [2025-01-09 21:33:45,173 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -11 predicate places. [2025-01-09 21:33:45,173 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 221 transitions, 516 flow [2025-01-09 21:33:45,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:45,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:45,173 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] [2025-01-09 21:33:45,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:45,174 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:45,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1246256495, now seen corresponding path program 1 times [2025-01-09 21:33:45,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:45,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947362837] [2025-01-09 21:33:45,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:45,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:45,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:33:45,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:33:45,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:45,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:45,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:45,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947362837] [2025-01-09 21:33:45,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947362837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:45,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:45,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:45,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80675730] [2025-01-09 21:33:45,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:45,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:33:45,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:45,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:33:45,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:33:45,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 267 [2025-01-09 21:33:45,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 221 transitions, 516 flow. Second operand has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:45,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:45,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 267 [2025-01-09 21:33:45,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,396 INFO L124 PetriNetUnfolderBase]: 94/1147 cut-off events. [2025-01-09 21:33:45,396 INFO L125 PetriNetUnfolderBase]: For 56/65 co-relation queries the response was YES. [2025-01-09 21:33:45,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1147 events. 94/1147 cut-off events. For 56/65 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7181 event pairs, 35 based on Foata normal form. 8/1071 useless extension candidates. Maximal degree in co-relation 1429. Up to 103 conditions per place. [2025-01-09 21:33:45,404 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 22 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2025-01-09 21:33:45,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 231 transitions, 597 flow [2025-01-09 21:33:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:33:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:33:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1228 transitions. [2025-01-09 21:33:45,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9198501872659176 [2025-01-09 21:33:45,406 INFO L175 Difference]: Start difference. First operand has 235 places, 221 transitions, 516 flow. Second operand 5 states and 1228 transitions. [2025-01-09 21:33:45,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 231 transitions, 597 flow [2025-01-09 21:33:45,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 231 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:45,409 INFO L231 Difference]: Finished difference. Result has 233 places, 223 transitions, 537 flow [2025-01-09 21:33:45,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=537, PETRI_PLACES=233, PETRI_TRANSITIONS=223} [2025-01-09 21:33:45,410 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -13 predicate places. [2025-01-09 21:33:45,410 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 223 transitions, 537 flow [2025-01-09 21:33:45,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:45,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:45,411 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] [2025-01-09 21:33:45,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:45,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:45,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:45,411 INFO L85 PathProgramCache]: Analyzing trace with hash -271870402, now seen corresponding path program 1 times [2025-01-09 21:33:45,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:45,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514433176] [2025-01-09 21:33:45,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:45,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:45,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:33:45,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:33:45,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:45,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:45,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514433176] [2025-01-09 21:33:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514433176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:45,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:45,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371756192] [2025-01-09 21:33:45,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:45,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:45,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:45,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:45,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 267 [2025-01-09 21:33:45,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 223 transitions, 537 flow. Second operand has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:45,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:45,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 267 [2025-01-09 21:33:45,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,900 INFO L124 PetriNetUnfolderBase]: 111/1171 cut-off events. [2025-01-09 21:33:45,900 INFO L125 PetriNetUnfolderBase]: For 138/147 co-relation queries the response was YES. [2025-01-09 21:33:45,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1171 events. 111/1171 cut-off events. For 138/147 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7391 event pairs, 32 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1549. Up to 124 conditions per place. [2025-01-09 21:33:45,909 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 24 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2025-01-09 21:33:45,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 617 flow [2025-01-09 21:33:45,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-01-09 21:33:45,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9088639200998752 [2025-01-09 21:33:45,912 INFO L175 Difference]: Start difference. First operand has 233 places, 223 transitions, 537 flow. Second operand 6 states and 1456 transitions. [2025-01-09 21:33:45,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 617 flow [2025-01-09 21:33:45,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 230 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:45,915 INFO L231 Difference]: Finished difference. Result has 235 places, 222 transitions, 540 flow [2025-01-09 21:33:45,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=235, PETRI_TRANSITIONS=222} [2025-01-09 21:33:45,916 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -11 predicate places. [2025-01-09 21:33:45,916 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 222 transitions, 540 flow [2025-01-09 21:33:45,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:45,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:45,917 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:33:45,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:45,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:45,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1592057754, now seen corresponding path program 1 times [2025-01-09 21:33:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:45,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99358733] [2025-01-09 21:33:45,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:45,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:33:45,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:33:45,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:45,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:46,158 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:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:46,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99358733] [2025-01-09 21:33:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99358733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:46,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:46,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312555831] [2025-01-09 21:33:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:46,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:46,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:46,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:46,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:46,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 267 [2025-01-09 21:33:46,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 222 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:46,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:46,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 267 [2025-01-09 21:33:46,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:46,407 INFO L124 PetriNetUnfolderBase]: 181/1135 cut-off events. [2025-01-09 21:33:46,408 INFO L125 PetriNetUnfolderBase]: For 138/203 co-relation queries the response was YES. [2025-01-09 21:33:46,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 1135 events. 181/1135 cut-off events. For 138/203 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7215 event pairs, 44 based on Foata normal form. 8/1072 useless extension candidates. Maximal degree in co-relation 1571. Up to 173 conditions per place. [2025-01-09 21:33:46,414 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 22 selfloop transitions, 5 changer transitions 0/229 dead transitions. [2025-01-09 21:33:46,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 229 transitions, 616 flow [2025-01-09 21:33:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-01-09 21:33:46,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9088639200998752 [2025-01-09 21:33:46,417 INFO L175 Difference]: Start difference. First operand has 235 places, 222 transitions, 540 flow. Second operand 6 states and 1456 transitions. [2025-01-09 21:33:46,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 229 transitions, 616 flow [2025-01-09 21:33:46,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 229 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:46,420 INFO L231 Difference]: Finished difference. Result has 234 places, 221 transitions, 538 flow [2025-01-09 21:33:46,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=234, PETRI_TRANSITIONS=221} [2025-01-09 21:33:46,420 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -12 predicate places. [2025-01-09 21:33:46,420 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 221 transitions, 538 flow [2025-01-09 21:33:46,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:46,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:46,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:46,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:46,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:46,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1488288513, now seen corresponding path program 1 times [2025-01-09 21:33:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:46,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025092201] [2025-01-09 21:33:46,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:46,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:46,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:33:46,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:33:46,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:46,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:46,448 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:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025092201] [2025-01-09 21:33:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025092201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:46,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:46,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:46,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452148808] [2025-01-09 21:33:46,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:46,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:46,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:46,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:46,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:46,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-01-09 21:33:46,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 221 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:46,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:46,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-01-09 21:33:46,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:46,594 INFO L124 PetriNetUnfolderBase]: 83/1048 cut-off events. [2025-01-09 21:33:46,594 INFO L125 PetriNetUnfolderBase]: For 46/51 co-relation queries the response was YES. [2025-01-09 21:33:46,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1048 events. 83/1048 cut-off events. For 46/51 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6146 event pairs, 19 based on Foata normal form. 0/994 useless extension candidates. Maximal degree in co-relation 1338. Up to 86 conditions per place. [2025-01-09 21:33:46,600 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 10 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-01-09 21:33:46,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 222 transitions, 566 flow [2025-01-09 21:33:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2025-01-09 21:33:46,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375780274656679 [2025-01-09 21:33:46,602 INFO L175 Difference]: Start difference. First operand has 234 places, 221 transitions, 538 flow. Second operand 3 states and 751 transitions. [2025-01-09 21:33:46,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 222 transitions, 566 flow [2025-01-09 21:33:46,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 222 transitions, 556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:46,605 INFO L231 Difference]: Finished difference. Result has 230 places, 220 transitions, 530 flow [2025-01-09 21:33:46,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=230, PETRI_TRANSITIONS=220} [2025-01-09 21:33:46,606 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -16 predicate places. [2025-01-09 21:33:46,606 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 220 transitions, 530 flow [2025-01-09 21:33:46,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:46,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:46,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:46,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:46,607 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:46,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2000456731, now seen corresponding path program 1 times [2025-01-09 21:33:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:46,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536261981] [2025-01-09 21:33:46,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:46,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:33:46,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:33:46,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:46,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:33:46,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:46,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536261981] [2025-01-09 21:33:46,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536261981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:46,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:46,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908298679] [2025-01-09 21:33:46,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:46,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:46,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:46,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:47,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 267 [2025-01-09 21:33:47,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 220 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 240.16666666666666) internal successors, (1441), 6 states have internal predecessors, (1441), 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:47,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:47,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 267 [2025-01-09 21:33:47,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:47,159 INFO L124 PetriNetUnfolderBase]: 90/1043 cut-off events. [2025-01-09 21:33:47,159 INFO L125 PetriNetUnfolderBase]: For 76/98 co-relation queries the response was YES. [2025-01-09 21:33:47,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 1043 events. 90/1043 cut-off events. For 76/98 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6262 event pairs, 27 based on Foata normal form. 4/1004 useless extension candidates. Maximal degree in co-relation 1439. Up to 118 conditions per place. [2025-01-09 21:33:47,166 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 24 selfloop transitions, 5 changer transitions 0/227 dead transitions. [2025-01-09 21:33:47,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 610 flow [2025-01-09 21:33:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-01-09 21:33:47,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9088639200998752 [2025-01-09 21:33:47,168 INFO L175 Difference]: Start difference. First operand has 230 places, 220 transitions, 530 flow. Second operand 6 states and 1456 transitions. [2025-01-09 21:33:47,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 610 flow [2025-01-09 21:33:47,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 227 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:47,171 INFO L231 Difference]: Finished difference. Result has 232 places, 219 transitions, 534 flow [2025-01-09 21:33:47,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=232, PETRI_TRANSITIONS=219} [2025-01-09 21:33:47,172 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -14 predicate places. [2025-01-09 21:33:47,172 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 219 transitions, 534 flow [2025-01-09 21:33:47,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 240.16666666666666) internal successors, (1441), 6 states have internal predecessors, (1441), 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:47,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:47,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:47,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:47,173 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:47,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1702171241, now seen corresponding path program 1 times [2025-01-09 21:33:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:47,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135087874] [2025-01-09 21:33:47,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:47,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:33:47,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:33:47,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:47,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:47,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135087874] [2025-01-09 21:33:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135087874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:47,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291346822] [2025-01-09 21:33:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:47,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:47,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:47,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-01-09 21:33:47,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 219 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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:47,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:47,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-01-09 21:33:47,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:47,293 INFO L124 PetriNetUnfolderBase]: 141/1096 cut-off events. [2025-01-09 21:33:47,293 INFO L125 PetriNetUnfolderBase]: For 99/120 co-relation queries the response was YES. [2025-01-09 21:33:47,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 1096 events. 141/1096 cut-off events. For 99/120 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6819 event pairs, 40 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1456. Up to 169 conditions per place. [2025-01-09 21:33:47,299 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 10 selfloop transitions, 2 changer transitions 6/220 dead transitions. [2025-01-09 21:33:47,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 220 transitions, 562 flow [2025-01-09 21:33:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2025-01-09 21:33:47,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375780274656679 [2025-01-09 21:33:47,301 INFO L175 Difference]: Start difference. First operand has 232 places, 219 transitions, 534 flow. Second operand 3 states and 751 transitions. [2025-01-09 21:33:47,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 220 transitions, 562 flow [2025-01-09 21:33:47,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 220 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:47,304 INFO L231 Difference]: Finished difference. Result has 228 places, 212 transitions, 494 flow [2025-01-09 21:33:47,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=228, PETRI_TRANSITIONS=212} [2025-01-09 21:33:47,304 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -18 predicate places. [2025-01-09 21:33:47,304 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 212 transitions, 494 flow [2025-01-09 21:33:47,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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:47,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:47,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:47,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:47,305 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:33:47,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash 817775070, now seen corresponding path program 1 times [2025-01-09 21:33:47,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:47,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933084466] [2025-01-09 21:33:47,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:47,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:47,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:33:47,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:33:47,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:47,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:33:47,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:47,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933084466] [2025-01-09 21:33:47,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933084466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:47,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:47,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:47,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88437195] [2025-01-09 21:33:47,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:47,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:47,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:47,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:47,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:47,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-01-09 21:33:47,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 212 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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:47,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:47,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-01-09 21:33:47,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:47,434 INFO L124 PetriNetUnfolderBase]: 69/990 cut-off events. [2025-01-09 21:33:47,435 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2025-01-09 21:33:47,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 990 events. 69/990 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5902 event pairs, 19 based on Foata normal form. 1/961 useless extension candidates. Maximal degree in co-relation 1215. Up to 61 conditions per place. [2025-01-09 21:33:47,438 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 0 selfloop transitions, 0 changer transitions 213/213 dead transitions. [2025-01-09 21:33:47,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 213 transitions, 522 flow [2025-01-09 21:33:47,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2025-01-09 21:33:47,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375780274656679 [2025-01-09 21:33:47,440 INFO L175 Difference]: Start difference. First operand has 228 places, 212 transitions, 494 flow. Second operand 3 states and 751 transitions. [2025-01-09 21:33:47,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 213 transitions, 522 flow [2025-01-09 21:33:47,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 498 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-09 21:33:47,442 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2025-01-09 21:33:47,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=217, PETRI_TRANSITIONS=0} [2025-01-09 21:33:47,443 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -29 predicate places. [2025-01-09 21:33:47,443 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2025-01-09 21:33:47,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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:47,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-01-09 21:33:47,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-01-09 21:33:47,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-01-09 21:33:47,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-01-09 21:33:47,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-01-09 21:33:47,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-01-09 21:33:47,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-01-09 21:33:47,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-01-09 21:33:47,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-01-09 21:33:47,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-01-09 21:33:47,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-01-09 21:33:47,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:33:47,447 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:47,451 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:47,451 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:47,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:47 BasicIcfg [2025-01-09 21:33:47,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:47,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:47,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:47,455 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:47,455 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:41" (3/4) ... [2025-01-09 21:33:47,456 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:47,458 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:47,458 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:47,458 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:47,461 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-09 21:33:47,461 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:47,461 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:47,461 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:47,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:47,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:47,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:47,515 INFO L158 Benchmark]: Toolchain (without parser) took 6228.83ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 123.0MB in the beginning and 442.7MB in the end (delta: -319.7MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-01-09 21:33:47,515 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:47,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.77ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 110.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:47,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.90ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:47,515 INFO L158 Benchmark]: Boogie Preprocessor took 23.80ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:47,516 INFO L158 Benchmark]: RCFGBuilder took 413.43ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 84.8MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:47,516 INFO L158 Benchmark]: TraceAbstraction took 5493.41ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 84.2MB in the beginning and 451.1MB in the end (delta: -366.9MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:47,516 INFO L158 Benchmark]: Witness Printer took 59.74ms. Allocated memory is still 553.6MB. Free memory was 451.1MB in the beginning and 442.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:47,517 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.23ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.77ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 110.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.90ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.80ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 413.43ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 84.8MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5493.41ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 84.2MB in the beginning and 451.1MB in the end (delta: -366.9MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Witness Printer took 59.74ms. Allocated memory is still 553.6MB. Free memory was 451.1MB in the beginning and 442.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: 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, 361 locations, 46 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: 5.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 988 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 448 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 328 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1508 IncrementalHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 120 mSDtfsCounter, 1508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=13, InterpolantAutomatonStates: 75, 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, 1.8s InterpolantComputationTime, 1540 NumberOfCodeBlocks, 1540 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1522 ConstructedInterpolants, 0 QuantifiedInterpolants, 2228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 9/9 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 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:47,530 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